Mutually independent commitments

DOI10.1007/3-540-45682-1_23MaRDI QIDQ4474186zbMATH OpenFDO

Authors Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith

Publication date 4 August 2004

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/2248/22480385.htm

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

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

Cited in

(6)

• Efficient commitment schemes with bounded sender and unbounded receiver
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Multi-prover commitments against non-signaling attacks
• Efficient Simultaneous Broadcast
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes

This page was built for publication: Mutually independent commitments

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