The following pages link to (Q3374903):
Displaying 16 items.
- Selling multiple secrets to a single buyer (Q833739) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Random-index PIR and applications (Q2697885) (← links)
- One-way functions are essential for single-server private information retrieval (Q2819537) (← links)
- An Efficient PIR Construction Using Trusted Hardware (Q3540144) (← links)
- On the Security Loss in Cryptographic Reductions (Q3627428) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations (Q5746341) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- Doubly efficient cryptography: commitments, arguments and RAM MPC (Q6653029) (← links)
