On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions

DOI10.1007/3-540-48910-X_5zbMath0932.68045MaRDI QIDQ4250753

Joe Kilian, Louis Salvail, Ivan B. Damgård

Publication date: 13 March 2000

Published in: Advances in Cryptology — EUROCRYPT ’99 (Search for Journal in Brave)

zbMATH Keywords

bit commitmentweak oblivious transferweak generic transfer

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration, Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement, Unclonable polymers and their cryptographic applications, A tight computational indistinguishability bound for product distributions, Cryptography from one-way communication: on completeness of finite channels, Error-Tolerant Combiners for Oblivious Primitives, Basing cryptographic protocols on tamper-evident seals, Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol, OT-Combiners via Secure Computation, Degradation and Amplification of Computational Hardness, Formalising \(\varSigma\)-protocols and commitment schemes using crypthol, David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware, Secure Two-Party Computation over a Z-Channel, Network Oblivious Transfer, Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction, Oblivious Transfer Based on the McEliece Assumptions, Amplifying the security of functional encryption, unconditionally