Pages that link to "Item:Q5445499"

The following pages link to Which Languages Have 4-Round Zero-Knowledge Proofs? (Q5445499):

Displaying 8 items.

• 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)
• What security can we achieve within 4 rounds? (Q2010586) (← links)
• What Security Can We Achieve Within 4 Rounds? (Q2827735) (← 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)
• The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
• Zero-knowledge systems from MPC-in-the-head and oblivious transfer (Q6595938) (← links)