A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Limits on the provable consequences of one-way permutations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A general completeness theorem for two party games
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fault-tolerant computation in the full information model (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Interactive hashing can simplify zero-knowledge protocol design without computational assumptions
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Private information storage (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Universal service-providers for database private information retrieval (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
One-way functions are essential for single-server private information retrieval
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Upper Bound on Communication Complexity of Private Information Retrieval
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Secure Commitment Against A Powerful Adversary
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Oblivious Transfer with a Memory-Bounded Receiver
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
One-way functions are essential for complexity based cryptography
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Single database private information retrieval implies oblivious transfer
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approximate private information retrieval
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
An Efficient PIR Construction Using Trusted Hardware
ISC '08 Proceedings of the 11th international conference on Information Security
The complexity of online memory checking
Journal of the ACM (JACM)
Selling multiple secrets to a single buyer
Information Sciences: an International Journal
On the Security Loss in Cryptographic Reductions
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Single database private information retrieval implies oblivious transfer
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A survey of single-database private information retrieval: techniques and applications
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A linear lower bound on the communication complexity of single-server private information retrieval
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Private searching on streaming data
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
On robust combiners for private information retrieval and other primitives
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
JustMyFriends: full SQL, full transactional amenities, and access privacy
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Private data warehouse queries
Proceedings of the 18th ACM symposium on Access control models and technologies
Hi-index | 0.00 |
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n. More specifically, we present a protocol in which the user sends O(K2) bits and the server sends n - cn/K bits (for any constant c), where K is the security parameter of the trapdoor permutations. Thus, for sufficiently large databases (e.g., when K = nƐ for some small Ɛ) our construction breaks the information-theoretic lower-bound (of at least n bits). This demonstrates the feasibility of basing single-server private information retrieval on general complexity assumptions. An important implication of our result is that we can implement a 1-out-of- n Oblivious Transfer protocol with communication complexity strictly less than n based on any one-way trapdoor permutation.