Constructions and bounds for unconditionally secure non-interactive commitment schemes

DOI10.1023/A:1016501125022MaRDI QIDQ1611358zbMATH OpenOpenAlexFDO

Authors Carlo Blundo, Barbara Masucci, D. R. Stinson, Ruizhong Wei

Publication date 21 August 2002

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016501125022

zbMATH Keywords

resolvable designcommitment scheme

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of block designs (05B05)

Recommendations

• Non-interactive and reusable non-malleable commitment schemes
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• scientific article; zbMATH DE number 1759793
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes
• UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS
• An efficient construction of non-interactive secure multiparty computation

Cited in

(16)

• Commitment and authentication systems
• Unconditionally secure NIZK in the fine-grained setting
• scientific article; zbMATH DE number 1982619 (Why is no real title available?)
• Commitment and authentication systems
• Research on commitment scheme
• scientific article; zbMATH DE number 1942445 (Why is no real title available?)
• Efficient commitment schemes with bounded sender and unbounded receiver
• Universally composable private proximity testing
• Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
• Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
• scientific article; zbMATH DE number 1952890 (Why is no real title available?)
• UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS
• Practical and provably-secure commitment schemes from collision-free hashing
• Long-term secure commitments via extractable-binding commitments
• scientific article; zbMATH DE number 2081077 (Why is no real title available?)
• Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment

This page was built for publication: Constructions and bounds for unconditionally secure non-interactive commitment schemes

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