On the efficiency of bit commitment reductions

DOI10.1007/978-3-642-25385-0_28MaRDI QIDQ3102208zbMATH OpenOpenAlexFDO

Authors Samuel Ranellucci, Alain Tapp, Severin Winkler, Jürg Wullschleger

Publication date 2 December 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25385-0_28

zbMATH Keywords

bit commitmentinformation theorynoisy channeloblivious transfersecure two-party computationstring commitment

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Topics in Cryptology – CT-RSA 2004
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• On the complexity of UC commitments
• scientific article; zbMATH DE number 1030985

Cited in

(11)

• A light-weight bit commitment protocol based on unpredictable channel noise
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• Cryptography from one-way communication: on completeness of finite channels
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• Bit commitment in the bounded storage model: tight bound and simple optimal construction
• Cryptography with One-Way Communication
• scientific article; zbMATH DE number 4096780 (Why is no real title available?)
• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• Cryptography and Coding
• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• Topics in Cryptology – CT-RSA 2004

This page was built for publication: On the efficiency of bit commitment reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102208)