The following pages link to (Q4314040):
Displaying 7 items.
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes (Q6064047) (← links)
