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 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 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 1424187 (Why is no real title available?)
- Non-interactive zero-knowledge proofs for composite statements
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
- The Arithmetic of Elliptic Curves
- Zero-knowledge proofs of identity
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)