Efficient hardware-based private information retrieval using partial reshuffle  

作　　者：Lan Tian Qin Zhiguang 

机构地区：[1]School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, P.R. China

出　　处：《High Technology Letters》2010年第3期263-267,共5页高技术通讯（英文版）

摘　　要：The paper proposes a novel hardware-based private information retrieval （HWPIR） protocol. By partially reshuffling previously accessed items in each round, instead of frequently reshuffling the whole database, the scheme makes better use of shuffled data copies and achieves the computation overhead at O（/N/K）,where N and k are the sizes of the database and secure storage respectively. For securestorage with moderate size, e.g. k = O（/N）, the overhead is 0（4/N）. The result is much better than the state-of-art schemes （as compared to e.g. O（log2N））. Without increasing response time and communication cost, the proposed protocol is truly practicable regardless of the database size. The security and preformance of the protocol is formally analyzed.

关 键 词：private information retrieval （PIR） trusted hardware reshuffle security PRACTICALITY 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术] F279.241[自动化与计算机技术—计算机科学与技术]