Theory of Cryptography
From MaRDI portal
Publication:5901783
DOI10.1007/b95566zbMath1197.94189OpenAlexW2498336418MaRDI QIDQ5901783
Publication date: 14 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95566
Related Items (15)
Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Enhancements of trapdoor permutations ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Communication-efficient distributed oblivious transfer ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ Semi-honest to Malicious Oblivious Transfer—The Black-Box Way ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model ⋮ On Constructing 1-1 One-Way Functions ⋮ Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
This page was built for publication: Theory of Cryptography
