Protecting data privacy in private information retrieval schemes
暂无分享,去创建一个
Yuval Ishai | Eyal Kushilevitz | Tal Malkin | Yael Gertner | E. Kushilevitz | Yael Gertner | T. Malkin | Y. Ishai
[1] Rafail Ostrovsky,et al. Single Database Private Information Retrieval Implies Oblivious Transfer , 2000, EUROCRYPT.
[2] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[3] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[4] Yuval Ishai,et al. One-way functions are essential for single-server private information retrieval , 1999, STOC '99.
[5] Yuval Ishai,et al. Improved upper bounds on information-theoretic private information retrieval , 1999, STOC 1999.
[6] Yuval Ishai,et al. Private simultaneous messages protocols with applications , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[7] Niv Gilboa,et al. Computationally private information retrieval (extended abstract) , 1997, STOC '97.
[8] Andris Ambainis,et al. On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .
[9] Gilles Brassard,et al. Oblivious transfers and intersecting codes , 1996, IEEE Trans. Inf. Theory.
[10] Eyal Kushilevitz,et al. Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[11] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[12] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[13] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[14] Eyal Kushilevitz,et al. Privacy and communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.
[15] Eyal Kushilevitz,et al. A zero-one law for Boolean privacy , 1989, STOC '89.
[16] Mitsuru Ito,et al. Secret sharing scheme realizing general access structure , 1989 .
[17] Donald Beaver. Perfect Privacy For Two-Party Protocols , 1989, Distributed Computing And Cryptography.
[18] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[19] Josh Benaloh,et al. Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.
[20] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[21] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[22] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[23] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[24] Gilles Brassard,et al. Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[25] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[26] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[27] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[28] 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).
[29] Adi Shamir,et al. How to share a secret , 1979, CACM.