One-way Trapdoor Permutations Are Suucient for Non-trivial Single-server Private Information Retrieval
نویسندگان
چکیده
We show that general one-way trapdoor permutations are suucient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n. More speciically, we present a protocol in which the user sends O(K 2) 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 suuciently 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.
منابع مشابه
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
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(K) 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 sufficientl...
متن کاملOne-way Trapdoor Permutations Are Su cient for Non-Trivial Single-Server Private Information Retrieval
We show that general one-way trapdoor permutations are su cient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n. More speci cally, we present a protocol in which the user sends O(K) 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 su ciently larg...
متن کاملSemi-honest to Malicious Oblivious Transfer - The Black-Box Way
Until recently, all known constructions of oblivious transfer protocols based on general hardness assumptions had the following form. First, the hardness assumption is used in a black-box manner (i.e., the construction uses only the input/output behavior of the primitive guaranteed by the assumption) to construct a semi-honest oblivious transfer, a protocol whose security is guaranteed to hold ...
متن کاملOn the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
We know that trapdoor permutations can be used to construct all kinds of basic cryptographic primitives, including trapdoor functions, public-key encryption, private information retrieval, oblivious transfer, key agreement, and those known to be equivalent to one-way functions such as digital signature, private-key encryption, bit commitment, pseudo-random generator and pseudo-random functions....
متن کاملOn the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
We show that non-interactive statistically-secret bit commitment cannot be constructed from arbitrary black-box one-to-one trapdoor functions and thus from general public-key cryptosystems. Reducing the problems of non-interactive crypto-computing, rerandomizable encryption, and non-interactive statistically-sender-private oblivious transfer and low-communication private information retrieval t...
متن کامل