scientific article; zbMATH DE number 697823
From MaRDI portal
Publication:4314040
Cited in
(7)- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Round-optimal zero-knowledge proofs of knowledge for NP
- The Knowledge Complexity of Interactive Proof Systems
- Which languages have 4-round zero-knowledge proofs?
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
- Constant-round adaptive zero-knowledge proofs for NP
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4314040)