Pages that link to "Item:Q380963"
From MaRDI portal
The following pages link to A note on constant-round zero-knowledge proofs of knowledge (Q380963):
Displaying 16 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← 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)
- On the existence of three round zero-knowledge proofs (Q1653072) (← links)
- How to construct constant-round zero-knowledge proof systems for NP (Q1924196) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits (Q2817870) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311538) (← links)
- Theory of Cryptography (Q5901772) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Doubly adaptive zero-knowledge proofs (Q6132969) (← links)
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states (Q6562577) (← links)
