Oblivious data structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Oblivious data structures: applications to cryptography

Full text

Pdf (1.49 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: 456 - 464

Year of Publication: 1997

ISBN:0-89791-888-6

Author

Daniele Micciancio

Laboratory for Computer Science, Massachusetts Institute of Technology

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 39, Citation Count: 5

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.258638 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	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 [doi>10.1145/225058.225080]
	2	Mihir Bellare , Oded Goldreich , Shafi Goldwasser, Incremental Cryptography: The Case of Hashing and Signing, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.216-233, August 21-25, 1994
	3	W. Pugh, "Skip Lists: A Probabilistic Alternative to Balanced Trees", Univ. of Mar>,Iand, Tech. Report CS-TR-2190. 1989.
	4	C. R. Aragon and R. G. Seidel, "Randomized Search Trees", Proc. of the 30th Ann. IEEE Syrup. on Foundations of Computer Science. 1983. pp 540-545.
	5	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	6	Martin Wirsing, Algebraic specification, Handbook of theoretical computer science (vol. B): formal models and semantics, MIT Press, Cambridge, MA, 1991
	7	Shafi Goldwasser , Silvio Micali , Ronald L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing, v.17 n.2, p.281-308, April 1988 [doi>10.1137/0217017]
	8	Birgit Pfitzmann , Michael Waidner, How To Break and Repair A "Provably Secure" Untraceable Payment System, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.338-350, August 11-15, 1991
	9	Arne Anderson , Thomas Ottmann, Faster uniquely represented dictionaries, Proceedings of the 32nd annual symposium on Foundations of computer science, p.642-649, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185430]

CITED BY 5

	Linda Null, Integrating security across the computer science curriculum, Journal of Computing Sciences in Colleges, v.19 n.5, p.170-178, May 2004
	Moni Naor , Vanessa Teague, Anti-presistence: history independent data structures, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.492-501, July 2001, Hersonissos, Greece
	Umut A. Acar , Guy E. Blelloch , Robert Harper , Jorge L. Vittes , Shan Leung Maverick Woo, Dynamizing static algorithms, with applications to dynamic trees and history independence, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana
	Niv Buchbinder , Erez Petrank, Lower and upper bounds on obtaining history independence, Information and Computation, v.204 n.2, p.291-337, February 2006
	Patrick Stahlberg , Gerome Miklau , Brian Neil Levine, Threats to privacy in the forensic analysis of database systems, Proceedings of the 2007 ACM SIGMOD international conference on Management of data, June 11-14, 2007, Beijing, China

INDEX TERMS

Primary Classification:
E. Data

Additional Classification:
D. Software
D.3 PROGRAMMING LANGUAGES
D.3.3 Language Constructs and Features
Subjects: Data types and structures

E. Data
E.3 DATA ENCRYPTION

G. Mathematics of Computing
G.2 DISCRETE MATHEMATICS
G.2.2 Graph Theory
Subjects: Trees
G.4 MATHEMATICAL SOFTWARE
Subjects: Algorithm design and analysis

General Terms:
Algorithms, Design, Languages, Measurement, Performance, Reliability, Theory, Verification

Collaborative Colleagues:

Daniele Micciancio: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player