The following pages link to Theory of Cryptography (Q5901772):
Displayed 14 items.
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← 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)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (Q5445524) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)