More robust private information retrieval scheme

被引:0
|
作者
Chen, Chun-Hua [1 ,2 ]
Horng, Gwoboa [1 ]
机构
[1] Natl Chung Hsing Univ, Inst Comp Sci, 250 Kuo Kuang Rd, Taichung 40227, Taiwan
[2] Chien Kuo Technol Univ, Dept Elect Engn, Changhua, Taiwan
关键词
private information retrieval (PIR); mutual authentication; DSA algorithm; secure coprocessor (SC);
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In e-commerce, the protection of users' privacy from a server was not considered feasible until the private information retrieval (PIR) problem was stated and solved. A PIR scheme allows a user to retrieve a data item from an online database while hiding the identity of the item from a database server. In this paper, a new PIR scheme using a secure coprocessor (SC) and including mutual authentication by DSA signature algorithm for protecting the privacy of users, is proposed. Because of using only one server and including the mutual authentication process in the proposed scheme, it is more efficient and more robust (secure) in the real e-commerce environment compared with previous PIR solutions. In addition, a security analysis (proof) for the proposed scheme and comparisons to other PIR schemes are given.
引用
收藏
页码:297 / +
页数:2
相关论文
共 50 条
  • [1] Robust information-theoretic private information retrieval
    Beimel, A
    Stahl, Y
    SECURITY IN COMMUNICATION NETWORKS, 2003, 2576 : 326 - 341
  • [2] Robust Information-Theoretic Private Information Retrieval
    Amos Beimel
    Yoav Stahl
    Journal of Cryptology, 2007, 20 : 295 - 321
  • [3] Robust information-theoretic private information retrieval
    Beimel, Amos
    Stahl, Yoav
    JOURNAL OF CRYPTOLOGY, 2007, 20 (03) : 295 - 321
  • [4] A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
    Augot, Daniel
    Levy-dit-Vehel, Francoise
    Shikfa, Abdullatif
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2014, 2014, 8813 : 222 - +
  • [5] Robust Private Information Retrieval on Coded Data
    Tajeddine, Razane
    El Rouayheb, Salim
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1903 - 1907
  • [6] Robust Private Information Retrieval with Optimal Server Computation
    Su, Yi-Sheng
    2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 89 - 94
  • [7] On robust combiners for private information retrieval and other primitives
    Meier, Remo
    Przydatek, Bartosz
    ADVANCES IN CRYPTOLOGY - CRYPTO 2006, PROCEEDINGS, 2006, 4117 : 555 - 569
  • [8] The Capacity of Robust Private Information Retrieval With Colluding Databases
    Sun, Hua
    Jafar, Syed Ali
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (04) : 2361 - 2370
  • [9] Private Information Retrieval with Result Verification for More Servers
    Ke, Pengzhen
    Zhang, Liang Feng
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PT II, ACNS 2023, 2023, 13906 : 197 - 216
  • [10] A Note on the Error of Optimized LFC Private Information Retrieval Scheme
    Tamura, Jin
    Kobara, Kazukuni
    Nojima, Ryo
    Imai, Hideki
    Lipmaa, Helger
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 1015 - +