The following pages link to Theory of Cryptography (Q5901783):
Displaying 15 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← links)
- Enhancements of trapdoor permutations (Q2392094) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- On Constructing 1-1 One-Way Functions (Q3088171) (← links)
- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art (Q3088194) (← links)
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model (Q3627447) (← links)
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols (Q5138779) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way (Q5445518) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Oblivious Transfer Based on the McEliece Assumptions (Q5502796) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
