Private information storage (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Private information storage (extended abstract)

Full text

Pdf (1.33 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing table of contents

El Paso, Texas, United States

Pages: 294 - 303

Year of Publication: 1997

ISBN:0-89791-888-6

Authors

Rafail Ostrovsky	Bell Communications Research, MCC-1C365B, Morristown, NJ
Victor Shoup	IBM Research Zurich, Säumerstr. 4, 8803 Rüschlikon, Switzerland

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 22, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/258533.258606 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AFK-89	M. Abadi , J. Feigenbaum , J Kilian, On hiding information form an oracle, Journal of Computer and System Sciences, v.39 n.1, p.21-50, Aug. 1989 [doi>10.1016/0022-0000(89)90018-4]
	N-89	Nabil R. Adam , John C. Worthmann, Security-control methods for statistical databases: a comparative study, ACM Computing Surveys (CSUR), v.21 n.4, p.515-556, Dec. 1989 [doi>10.1145/76894.76895]
	Amb-96	A. Ambainis. Upper bound on the communication complexity of private information retrieval. On-line version published in Theory of Cryptography Library, http://theory.lcs.mit.edu/-tcryptol, May 1996.
	BF-90	Donald Beaver , J. Feigenbaum, Hiding instances in multioracle queries, Proceedings of the seventh annual symposium on Theoretical aspects of computer science, p.37-48, February 1990, Rouen, France
	BFKL-90	Donald Beaver , Joan Feigenbaum , Joe Kilian , Phillip Rogaway, Security with Low Communication Overhead, Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, p.62-76, August 11-15, 1990
	BGKW-88	Michael Ben-Or , Shafi Goldwasser , Joe Kilian , Avi Widgerson, Multi-prover interactive proofs: how to remove intractability assumptions, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.113-131, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62223]
	B-79	G.R. Blakley. Safeguarding cryptographic keys. In Proc. NCC AFIPS, pp. 313-317, 1979.
	CG-97	Benny Chor , Niv Gilboa, Computationally private information retrieval (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.304-313, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258609]
	CGKS-95	B. Chor , O. Goldreich , E. Kushilevitz , M. Sudan, Private information retrieval, Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.41, October 23-25, 1995
	G-96	O. Goldreich. Personal communication, June of 1996.
	RAD-78	R.L. Rivest, L. Adleman, and M. L. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation (eds. R. DeMillo, D. Dobkin, A. Jones, and R. Lipton). Academic Press, 1978.
	G-87	O. Goldreich, Towards a theory of software protection and simulation by oblivious RAMs, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.182-194, January 1987, New York, New York, United States [doi>10.1145/28395.28416]
	GMR-85	S. Goldwasser , S. Micali , C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, v.18 n.1, p.186-208, Feb. 1989 [doi>10.1137/0218012]
	GMW-87	O. Goldreich , S. Micali , A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.218-229, January 1987, New York, New York, United States [doi>10.1145/28395.28420]
	GO-96	Oded Goldreich , Rafail Ostrovsky, Software protection and simulation on oblivious RAMs, Journal of the ACM (JACM), v.43 n.3, p.431-473, May 1996 [doi>10.1145/233551.233553]
	GGM-86	Oded Goldreich , Shafi Goldwasser , Silvio Micali, How to construct random functions, Journal of the ACM (JACM), v.33 n.4, p.792-807, Oct. 1986 [doi>10.1145/6490.6503]
	M-92	Silvio Micali, Fair Public-Key Cryptosystems, Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, p.113-138, August 16-20, 1992
	Ost-90	Rafail M. Ostrovsky, Software protection and simulation on oblivious RAMS, Massachusetts Institute of Technology, Cambridge, MA, 1992
	S-79	Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979 [doi>10.1145/359168.359176]
	U.S.-93	A proposed federal information processing standard for an escrowed encryption standard. Federal Register, July 30, 1993.
	Y-82	Yao, A.C., "Theory and Applications of Trapdoor Functions", ~3rd FOC$, 1982, pp. 80-91.

CITED BY 6

	Yuval Ishai , Eyal Kushilevitz, Improved upper bounds on information-theoretic private information retrieval (extended abstract), Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.79-88, May 01-04, 1999, Atlanta, Georgia, United States
	Benny Chor , Niv Gilboa, Computationally private information retrieval (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.304-313, May 04-06, 1997, El Paso, Texas, United States
	Benny Chor , Eyal Kushilevitz , Oded Goldreich , Madhu Sudan, Private information retrieval, Journal of the ACM (JACM), v.45 n.6, p.965-981, Nov. 1998
	Amos Beimel , Yuval Ishai , Eyal Kushilevitz , Tal Malkin, One-way functions are essential for single-server private information retrieval, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.89-98, May 01-04, 1999, Atlanta, Georgia, United States
	Giovanni Di-Crescenzo , Yuval Ishai , Rafail Ostrovsky, Universal service-providers for database private information retrieval (extended abstract), Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, p.91-100, June 28-July 02, 1998, Puerto Vallarta, Mexico
	E. Aïmeur , G. Brassard , F. S. Mani Onana, Blind sales in electronic commerce, Proceedings of the 6th international conference on Electronic commerce, October 25-27, 2004, Delft, The Netherlands