Shuhong Wang, Xuhua Ding, Robert H. Deng, Feng Bao  Home/Search
Context
Related
| iacr.org/2006/208.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impractical to deploy due to the prohibitively high communication and computation complexity. The recent trend in outsourcing databases fuels the research on practical PIR schemes. In this paper, we propose a new PIR system by making use of trusted hardware. Our system is proven to be information theoretically secure. Furthermore, we... (Update)
Active bibliography (related documents): More All
0.5: Some Applications of Coding Theory in Computational Complexity - Trevisan (2004) (Correct)
0.5: On Arbitrary Waksman Networks and their Vulnerability - Beauquier, Darrot (Correct)
0.5: Efficient Construction of (Distributed) Verifiable Random Functions - Dodis (2002) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ wang-private,
author = "Shuhong Wang and Xuhua Ding and Robert H. Deng and Feng Bao",
title = "Private Information Retrieval Using Trusted Hardware",
url = "citeseer.ist.psu.edu/wang06private.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al.
322 Sorting networks and their applications (context) - Batcher - 1968
260 Relations among Notions of Security for Public-key Encryptio.. (context) - Bellare, Desai et al. - 1998
174 Private information retrieval - Chor, Kushilevitz et al. - 1998
174 Private information retrieval - Chor, Kushilevitz et al. - 1995
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Racko - 1988
57 Software protection and simulation on oblivious rams - Goldreich, Ostrovsky - 1996
46 On data banks and privacy homomorphisms (context) - Rivest, Adleman et al.
38 A permutation network - Waksman - 1968
29 Reducing the servers computation in private information retr.. - Beimel, Ishai et al. - 2000
18 barrier for information-theoretic private information retrie.. (context) - Beimel, Ishai et al. - 2002
11 An oblivious transfer protocol with log-squared communicatio.. - Lipmaa - 2005
5 can you take advantage of someone without having to trust hi.. (context) - Feigenbaum, instances - 1985
5 Practical server privacy with secure coprocessors (context) - Smith, Sa - 2001
2 volume 2729 of Lecture Notes in Computer Science (context) - Patarin, rounds et al. - 2003
2 The Bulletin of the European Association for Theoretical Com.. (context) - Gasarch, on et al. - 2004
2 the synthesis of signal switching networks with transient bl.. (context) - Goldstein, Leibholz - 1967
1 Intel Developer Forum (context) - architecrure - 2003
1 Protecting client privacy with trusted computing at the serv.. (context) - Iliev, Smith - 2005
1 Private information storage with logarithm-space secure hard.. (context) - Iliev, Smith - 2004
1 Ciphers with arbitrary nite domains (context) - Black, Rogaway - 2002
1 cation Architecture Overview (context) - Speci
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC