Efficient string-commitment from weak bit-commitment

DOI10.1007/978-3-642-17373-8_16MaRDI QIDQ3058661zbMATH OpenOpenAlexFDO

Authors Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang

Publication date 7 December 2010

Published in Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17373-8_16

zbMATH Keywords

efficiency of black-box security amplificationsecurity amplification for commitment schemes

Mathematics Subject Classification ID

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

Recommendations

• Non-malleability amplification
• Automata, Languages and Programming
• Topics in Cryptology – CT-RSA 2004
• Practical and provably-secure commitment schemes from collision-free hashing
• Security Amplification for Interactive Cryptographic Primitives

Cited in

(2)

• scientific article; zbMATH DE number 1030983 (Why is no real title available?)
• Degradation and Amplification of Computational Hardness

This page was built for publication: Efficient string-commitment from weak bit-commitment

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