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

commitment schemeresolvable design

Mathematics Subject Classification ID

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

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
• Efficient non-malleable commitment schemes
• 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

(18)

• Commitment and authentication systems
• Efficient commitment schemes with bounded sender and unbounded receiver
• Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
• Long-term secure commitments via extractable-binding commitments
• Universally composable private proximity testing
• UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS
• Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
• Practical and provably-secure commitment schemes from collision-free hashing
• Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
• Research on commitment scheme
• Commitment and authentication systems
• Efficient commitment schemes with bounded sender and unbounded receiver
• Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor
• Equivocable and extractable commitment schemes
• Unconditionally secure homomorphic pre-distributed commitments
• Mutually independent commitments
• Unconditionally secure NIZK in the fine-grained setting
• Sigma Protocols and Commitment Schemes

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)