Commitment schemes and zero-knowledge protocols
From MaRDI portal
Recommendations
Cited in
(19)- Designing a secure e-tender submission protocol
- Hybrid commitments and their applications to zero-knowledge proof systems
- Commitment and authentication systems
- Efficient commitment schemes with bounded sender and unbounded receiver
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Zero-knowledge proofs for committed symmetric Boolean functions
- PKP-based signature scheme
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- scientific article; zbMATH DE number 4195166 (Why is no real title available?)
- Research on commitment scheme
- Grid-obstacle representations with connections to staircase guarding
- Message-restriction-free commitment scheme based on lattice assumption
- Cryptography and zero knowledge
- An Equivalence Between Zero Knowledge and Commitments
- How to challenge and cast your e-vote
- A bivariate polynomial-based cryptographic hard problem and its applications
- Sherlock Holmes zero-knowledge protocols
- Avoiding trusted setup in isogeny-based commitments
- \textsf{Boomy}: batch opening of multivariate polynomial commitment
This page was built for publication: Commitment schemes and zero-knowledge protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250897)