Proofs of knowledge for non-monotone discrete-log formulae and applications
From MaRDI portal
Recommendations
- Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order
- Zero-knowledge proofs of knowledge for group homomorphisms
- An improved protocol for demonstrating possession of discrete logarithms and some generalizations
- Group signatures
- Efficient group signature schemes for large groups. (Extended abstract)
Cited in
(7)- Ambiguous one-move nominative signature without random oracles
- An improved protocol for demonstrating possession of discrete logarithms and some generalizations
- Efficient democratic group signatures with threshold traceability
- Removing the strong RSA assumption from arguments over the integers
- Blind signatures from proofs of inequality
- \(k\)-anonymous data collection
- Time-selective convertible undeniable signatures with short conversion receipts
This page was built for publication: Proofs of knowledge for non-monotone discrete-log formulae and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408445)