On the Efficiency of Bit Commitment Reductions

DOI10.1007/978-3-642-25385-0_28zbMath1227.94062OpenAlexW1550795257MaRDI QIDQ3102208

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

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

information theorybit commitmentoblivious transfersecure two-party computationnoisy channelstring commitment

Mathematics Subject Classification ID

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

Related Items (4)

Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Cryptography with One-Way Communication ⋮ Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) ⋮ Cryptography from one-way communication: on completeness of finite channels

This page was built for publication: On the Efficiency of Bit Commitment Reductions