A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)

DOI10.1007/978-3-540-73420-8_30MaRDI QIDQ5428820zbMATH OpenOpenAlexFDO

Authors Bruce M. Kapron, Lior Malka, Venkatesh Srinivasan

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_30

zbMATH Keywords

commitment-schemesrandom self-reducibilityzero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A framework for non-interactive instance-dependent commitment schemes (NIC)
• An Equivalence Between Zero Knowledge and Commitments
• Noninteractive Zero-Knowledge
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• scientific article; zbMATH DE number 4195166

Cited in

(5)

• Non-malleable instance-dependent commitment in the standard model
• A framework for non-interactive instance-dependent commitment schemes (NIC)
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• An Equivalence Between Zero Knowledge and Commitments
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer

This page was built for publication: A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)

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