A Note on a Fatal Error of Optimized LFC Private Information Retrieval Scheme and Its Corrected Results
暂无分享,去创建一个
[1] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[2] Ivan Damgård,et al. A Length-Flexible Threshold Cryptosystem with Applications , 2003, ACISP.
[3] Andris Ambainis,et al. On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .
[4] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[5] Jacques Stern,et al. Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.
[6] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[7] Niv Gilboa,et al. Computationally private information retrieval (extended abstract) , 1997, STOC '97.
[8] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[9] Arto Salomaa,et al. Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.
[10] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[11] Helger Lipmaa,et al. An Oblivious Transfer Protocol with Log-Squared Communication , 2005, ISC.
[12] Eyal Kushilevitz,et al. Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[13] Information Security and Privacy , 1996, Lecture Notes in Computer Science.
[14] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[15] Yuval Ishai,et al. Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..