One-way functions are essential for single-server private information retrieval
暂无分享,去创建一个
Yuval Ishai | Eyal Kushilevitz | Tal Malkin | Amos Beimel | E. Kushilevitz | T. Malkin | A. Beimel | Y. Ishai
[1] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[2] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[3] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[4] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[5] Elizabeth D Mann. Private access to distributed information , 1998 .
[6] Martín Abadi,et al. On hiding information from an oracle , 1987, J. Comput. Syst. Sci..
[7] Oded Goldreich,et al. Foundations of Cryptography (Fragments of a Book) , 1995 .
[8] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[9] Yuval Ishai,et al. Improved upper bounds on information-theoretic private information retrieval , 1999, STOC 1999.
[10] Rafail Ostrovsky,et al. Single Database Private Information Retrieval Implies Oblivious Transfer , 2000, EUROCRYPT.
[11] Niv Gilboa,et al. Computationally private information retrieval (extended abstract) , 1997, STOC '97.
[12] Yuval Ishai,et al. Improved upper bounds on information-theoretic private information retrieval (extended abstract) , 1999, STOC '99.
[13] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[14] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[15] Rafail Ostrovsky,et al. Universal service-providers for database private information retrieval (extended abstract) , 1998, PODC '98.
[16] Johan Hstad,et al. Construction of a pseudo-random generator from any one-way function , 1989 .
[17] Rafail Ostrovsky,et al. One-way functions are essential for non-trivial zero-knowledge , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[18] Michael Luby,et al. Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.
[19] Yuval Ishai,et al. Protecting data privacy in private information retrieval schemes , 1998, STOC '98.
[20] Claude Crépeau,et al. Equivalence Between Two Flavours of Oblivious Transfers , 1987, CRYPTO.
[21] Martín Abadi,et al. On hiding information from an oracle , 1987, STOC '87.
[22] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..
[23] Oded Goldreich,et al. A Note on Computational Indistinguishability , 1990, Inf. Process. Lett..
[24] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[25] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[26] Rafail Ostrovsky,et al. Private information storage (extended abstract) , 1997, STOC '97.
[27] Andris Ambainis,et al. On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .
[28] Rafail Ostrovsky,et al. Private Information Storage , 1996, IACR Cryptol. ePrint Arch..
[29] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[30] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[31] Joan Feigenbaum,et al. Security with Low Communication Overhead , 1990, CRYPTO.
[32] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[33] Tal Malkin,et al. A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication , 1998, RANDOM.