Single Database Private Information Retrieval with Logarithmic Communication
暂无分享,去创建一个
[1] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[2] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[3] Rafail Ostrovsky,et al. One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval , 2000, EUROCRYPT.
[4] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[5] Tsuyoshi Takagi,et al. New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive , 2002, Public Key Cryptography.
[6] Ronald Cramer,et al. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption , 2001, EUROCRYPT.
[7] David Pointcheval,et al. Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries , 1999, ASIACRYPT.
[8] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[9] Yuval Ishai,et al. Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.
[10] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[11] Jacques Stern,et al. The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm , 2002, ASIACRYPT.
[12] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[13] Kaoru Kurosawa,et al. Some RSA-Based Encryption Schemes with Tight Security Reduction , 2003, ASIACRYPT.
[14] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[15] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[16] Dmitri Asonov. Private Information Retrieval – An Overview and Current Trends , 2001 .
[17] Rosario Gennaro,et al. Paillier's cryptosystem revisited , 2001, CCS '01.
[18] Rosario Gennaro,et al. Paillier's Trapdoor Function Hides up to O(n) Bits , 2002, Journal of Cryptology.
[19] Paz Morillo,et al. A Practical Public Key Cryptosystem from Paillier and Rabin Schemes , 2003, Public Key Cryptography.
[20] Jacques Stern,et al. Short Proofs of Knowledge for Factoring , 2000, Public Key Cryptography.
[21] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[22] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[23] Rafail Ostrovsky,et al. Single Database Private Information Retrieval Implies Oblivious Transfer , 2000, EUROCRYPT.
[24] Steven D. Galbraith,et al. Elliptic Curve Paillier Schemes , 2001, Journal of Cryptology.
[25] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.