FrodoPIR: Simple, Scalable, Single-Server Private Information Retrieval
نویسندگان
چکیده
We design FrodoPIR — a highly configurable, stateful, single-server Private Information Retrieval (PIR) scheme that involves an offline phase is completely client-independent. Coupled with small online overheads, it leads to much smaller amortized financial costs on the server-side than previous approaches. In terms of performance for database 1 million 1KB elements, requires < second responding client query, has server response size blow-up factor 3.6x, and are ~$1 answering 100,000 queries. Our experimental analysis built upon simple, non-optimized Rust implementation, illustrating particularly suitable deployments involve large numbers clients.
منابع مشابه
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
We study the communication complexity of single-server Private Information Retrieval (PIR) protocols that are based on fundamental cryptographic primitives in a black-box manner. In this setting, we establish a tight lower bound on the number of bits communicated by the server in any polynomially-preserving construction that relies on trapdoor permutations. More specifically, our main result st...
متن کامل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...
متن کاملA Fast Single Server Private Information Retrieval Protocol with Low Communication Cost
Existing single server Private Information Retrieval (PIR) protocols are far from practical. To be practical, a single server PIR protocol has to be both communicationally and computationally efficient. In this paper, we present a single server PIR protocol that has low communication cost and is much faster than existing protocols. A major building block of the PIR protocol in this paper is a t...
متن کامل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...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings on Privacy Enhancing Technologies
سال: 2023
ISSN: ['2299-0984']
DOI: https://doi.org/10.56553/popets-2023-0022