CDLS: proving knowledge of committed discrete logarithms with soundness
From MaRDI portal
Cites work
- \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys
- Efficient group signature schemes for large groups. (Extended abstract)
- Efficient proofs that a committed number lies in an interval
- Efficient Protocols for Set Membership and Range Proofs
- Efficient secure two-party protocols. Techniques and constructions
- Efficient signature generation by smart cards
- Fiat-Shamir transformation of multi-round interactive proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- Non-interactive and information-theoretic secure verifiable secret sharing
- Non-interactive zero-knowledge proofs for composite statements
- On the composition of zero-knowledge proof systems
- Proofs of partial knowledge and simplified design of witness hiding protocols
- Proving in zero-knowledge that a number is the product of two safe primes
- Statistical zero knowledge protocols to prove modular polynomial relations
- The Arithmetic of Elliptic Curves
- Zero-knowledge proofs of identity
- Zero-knowledge proofs of possession of digital signatures and its applications
This page was built for publication: CDLS: proving knowledge of committed discrete logarithms with soundness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030879)