Private information storage with logarithmic-space secure hardware

IFIP Advances in Information and Communication Technology

Volumn 148, Issue , 2004, Pages 201-216

  Iliev, Alexander ^a   Smith, Sean ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

Luby rackoff cipher; Oblivious ram; Permutation network; Private information retrieval and storage; Sorting network

Indexed keywords

COMPUTER PRIVACY; COPROCESSOR; CRYPTOGRAPHY; INFORMATION RETRIEVAL; LARGE DATASET; RANDOM ACCESS STORAGE;

LUBY-RACKOFF CIPHER; PERMUTATION NETWORK; PRIVATE INFORMATION; PRIVATE INFORMATION RETRIEVAL; PSEUDORANDOM PERMUTATION; SECURE COPROCESSOR; SORTING NETWORK; SPACE REQUIREMENTS;

HARDWARE SECURITY;

EID: 84902504748     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8145-6_17     Document Type: Conference Paper

References (22)

1. Dmitri Asonov and Johann-Christoph Freytag. Almost optimal private information retrieval. In Dingledine and Syverson [5], pages 209-223. LNCS 2482.
2. Christian Cachin, Silvio Micali, and Markus Stadler. Computationally private information retrieval with polylogarithmic communication. In Eurocrypt 1999, Prague, Czech Republic. Springer Verlag. LNCS 1592.
3. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. Journal of the ACM, 45:965-982, 1998.
4. Thomas Cormen, Charles Leiserson, Ronald Rivest, and Cliff Stein. Introduction to Algorithms. McGraw-Hill, second edition, 2001.
5. R. Dingledine and P. Syverson, editors. Privacy Enhancing Technologies, San Francisco, CA, April 2002. Springer. LNCS 2482.
6. Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM,43(3):431-473, 1996.
7. Alex Iliev and Sean Smith. Privacy-enhanced directory services. In 2nd Annual PKI Research Workshop, Gaithersburg, MD, April 2003. NIST.
8. Dogan Kesdogan, Mark Borning, and Michael Schmeink. Unobservable surfing on the world wide web: is private information retrieval an alternative to the MIX based approach? In Dingledine and Syverson [5]. LNCS 2482.
9. Eyal Kushilevitz and Rafail Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In IEEE Symposium on Foundations of Computer Science, pages 364-373, 1997.
10. D. Lie, C. Thekkath, M. Mitchell, P. Lincoln, D. Boneh, J. Mitchell, and M. Horowitz. Architectural Support for Copy and Tamper Resistant Software. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 168-177, November 2000.
11. M. Luby and C. Rackoff. How to construct pseudo-random permutations from pseudo-random functions. SIAM Journal on Computing, 17(2):373-386, 1988.
12. P. McGregor and R. Lee. Virtual Secure Co-Processing on General-purpose Processors. Technical Report CE-L2002-003, Princeton University, November 2002.
13. Moni Naor and Omer Reingold. On the construction of pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryptology, 12(1):29-66, 1999.
14. Rafail Ostrovsky and Victor Shoup. Private information storage. In ACM Symposium on Theory of Computing. ACM, 1997.
15. Jacques Patarin. Luby-Rackoff: 7 rounds are enough for security. In Advances in Cryptology-CRYPTO 2003, pages 513-529. Springer-Verlag, Oct 2003.
16. th European Symposium on Research in Computer Science, Oct 2002.
17. Sean W. Smith and Steve Weingart. Building a high-performance, programmable secure coprocessor. Computer Networks, 31:831-860, 1999.
18. S.W. Smith and D. Safford. Practical server privacy using secure coprocessors. IBM Systems Journal, 40(3), 2001. (Special Issue on End-to-End Security).
19. National Institute Of Standards and Technology. Security requirements for cryptographic modules. http://csrc.nist.gov/publications/fips/fips140-1/fips1401.htm, Jan 1994. FIPS PUB 140-1.
20. G. Edward Suh, Dwaine Clarke, Blaise Gassend, Marten van Dijk, and Srinivas Devadas. AEGIS: architecture for tamper-evident and tamper-resistant processing. In Proceedings of the 17th annual international conference on Supercomputing, pages 160-171. ACM Press, 2003.
21. Abraham Waksman. A permutation network. Journal of the ACM, 15(1):159-163, Jan 1968.
22. Bennet S. Yee. Using Secure Coprocessors. PhD thesis, Carnegie Mellon University, 1994.