Efficient computation on oblivious RAMs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient computation on oblivious RAMs

Full text

Pdf (1.00 MB)

Source

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

Baltimore, Maryland, United States

Pages: 514 - 523

Year of Publication: 1990

ISBN:0-89791-361-2

Author

R. Ostrovsky

Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 20, Citation Count: 10

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/100216.100289 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.

	1	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	M. Ajtai , J. Komlós , E. Szemerédi, An 0(n log n) sorting network, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.1-9, December 1983 [doi>10.1145/800061.808726]
	3	Bat Botcher, K. "Sorting Networks and their Applications" AFIPS Spring Joint Computer Conference 32, 1968, pp. 307-314.
	4	Be Best, R. "Microprocessor for Executing Encrypted Programs" US Patent 4,168396 Issued September 1979.
	5	CW J.L. Carter J.L. and M.N. Wegman "Universal Classes of Hash Functions" Journal of Computer and System Sciences 18 (1979), pp. 143-154.
	6	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]
	7	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]
	8	GM Goldwasser S., and S. Micali, "Probabilistic Encryption" Jour. of Computer and System Science, Vol. 28, No. 2, 1984, pp. 270-299.
	9	J. Håstad, Pseudo-random generators under uniform assumptions, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.395-404, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100270]
	10	R. Impagliazzo , L. A. Levin , M. Luby, Pseudo-random generation from one-way functions, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.12-24, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73009]
	11	S. Kent, PROTECTING EXTERNALLY SUPPLIED SOFTWARE IN SMALL COMPUTERS, Massachusetts Institute of Technology, Cambridge, MA, 1981
	12	Nicholas Pippenger , Michael J. Fischer, Relations Among Complexity Measures, Journal of the ACM (JACM), v.26 n.2, p.361-381, April 1979 [doi>10.1145/322123.322138]

CITED BY 10

	Mihir Bellare , Oded Goldreich , Shafi Goldwasser, Incremental cryptography and application to virus protection, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.45-56, May 29-June 01, 1995, Las Vegas, Nevada, United States
	Cynthia Dwork , Jeffrey Lotspiech , Moni Naor, Digital signets: self-enforcing protection of digital information (preliminary version), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.489-498, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Miklós Ajtai, The invasiveness of off-line memory checking, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	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
	Charles Rackoff , Daniel R. Simon, Cryptographic defense against traffic analysis, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.672-681, May 16-18, 1993, San Diego, California, United States
	P. T. Devanbu , S. G. Stubblebine, Stack and Queue Integrity on Hostile Platforms, IEEE Transactions on Software Engineering, v.28 n.1, p.100-108, January 2002
	Reza Curtmola , Juan Garay , Seny Kamara , Rafail Ostrovsky, Searchable symmetric encryption: improved definitions and efficient constructions, Proceedings of the 13th ACM conference on Computer and communications security, October 30-November 03, 2006, Alexandria, Virginia, USA
	Bennet Yee , J. D. Tygar, Secure coprocessors in electronic commerce applications, Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce, p.14-14, July 11-12, 1995, New York, New York
	Arati Baliga , Joe Kilian, On covert collaboration, Proceedings of the 9th workshop on Multimedia & security, September 20-21, 2007, Dallas, Texas, USA
	Moni Naor , Guy N. Rothblum, The complexity of online memory checking, Journal of the ACM (JACM), v.56 n.1, p.1-46, January 2009