scientific article; zbMATH DE number 5009195
From MaRDI portal
Publication:3374903
zbMATH Open1082.68567MaRDI QIDQ3374903FDOQ3374903
Authors: Eyal Kushilevitz, Rafail Ostrovsky 
Publication date: 1 March 2006
Title of this publication is not available (Why is that?)
Recommendations
- One-way functions are essential for single-server private information retrieval
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
- Public Key Cryptography - PKC 2005
- scientific article; zbMATH DE number 2079922
- On constructing one-way permutations from indistinguishability obfuscation
- On constructing one-way permutations from indistinguishability obfuscation
- Round-optimal secure two-party computation from trapdoor permutations
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Oblivious transfer from trapdoor permutations in minimal rounds
Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cited In (18)
- Lower bounds for (batch) PIR with private preprocessing
- On the Security Loss in Cryptographic Reductions
- One-way functions are essential for single-server private information retrieval
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- Minicrypt primitives with algebraic structure and applications
- Simple and generic constructions of succinct functional encryption
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Private information retrieval with sublinear online time
- Verifiable single-server private information retrieval from LWE with binary errors
- An Efficient PIR Construction Using Trusted Hardware
- Lower-bounds on public-key operations in PIR
- Doubly efficient cryptography: commitments, arguments and RAM MPC
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Privacy-enhanced attribute-based private information retrieval
- Random-index PIR and applications
- Selling multiple secrets to a single buyer
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374903)
