Replication is not needed: single database, computationally-private information retrieval
暂无分享,去创建一个
[1] Yuval Ishai,et al. Protecting data privacy in private information retrieval schemes , 1998, STOC '98.
[2] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[3] Michael Luby,et al. Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.
[4] Niv Gilboa,et al. Computationally private information retrieval (extended abstract) , 1997, STOC '97.
[5] Rafail Ostrovsky,et al. Private Information Storage , 1996, IACR Cryptol. ePrint Arch..
[6] Gilles Brassard,et al. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[7] Manuel Blum,et al. A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..
[8] Eyal Kushilevitz,et al. Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[9] Moni Naor,et al. Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..
[10] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[11] Kevin S. Mccurley,et al. Odds and ends from cryptology and computational number theory , 1990 .
[12] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[13] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[14] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[15] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[16] Oded Goldreich,et al. Towards a theory of software protection and simulation by oblivious RAMs , 1987, STOC.
[17] Andris Ambainis,et al. On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .
[18] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.