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

DOI10.1007/978-3-540-73420-8_30zbMath1171.94353OpenAlexW2122545758MaRDI QIDQ5428820

Lior Malka, Venkatesh Srinivasan, Bruce M. Kapron

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

zero-knowledgerandom self-reducibilitycommitment-schemes

Mathematics Subject Classification ID

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

Related Items (4)

Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ 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

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