Equivocable and extractable commitment schemes

DOI10.1007/3-540-36413-7_6MaRDI QIDQ4414269zbMATH OpenFDO

Authors Giovanni Di Crescenzo

Publication date 24 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2576/25760074.htm

Mathematics Subject Classification ID

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

Recommendations

• Non-interactive and reusable non-malleable commitment schemes
• Efficient and non-interactive non-malleable commitment
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• Universally composable commitments (extended abstract)
• scientific article; zbMATH DE number 1775398

Cited in

(7)

• Practical algorithm substitution attack on extractable signatures
• DL-extractable UC-commitment schemes
• Long-term secure commitments via extractable-binding commitments
• Input-aware equivocable commitments and UC-secure commitments with atomic exchanges
• Non-interactive and re-usable universally composable string commitments with adaptive security
• A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
• Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms

This page was built for publication: Equivocable and extractable commitment schemes

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