Pages that link to "Item:Q2442650"

The following pages link to Concurrent zero knowledge, revisited (Q2442650):

Displaying 17 items.

• Concurrent knowledge extraction in public-key models (Q271592) (← links)
• Lower bounds for concurrent zero knowledge (Q812826) (← links)
• On the security loss of unique signatures (Q1629431) (← links)
• Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
• On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
• Scalable zero knowledge with no trusted setup (Q2304940) (← links)
• Simultaneous amplification: the case of non-interactive zero-knowledge (Q2304997) (← links)
• On expected polynomial runtime in cryptography (Q2695649) (← links)
• Concurrent Secure Computation with Optimal Query Complexity (Q3457059) (← links)
• Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions (Q3457061) (← links)
• Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation (Q3457115) (← links)
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds (Q4785630) (← links)
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model (Q4910272) (← links)
• (Q4941875) (← links)
• On Constant-Round Concurrent Zero-Knowledge (Q5445525) (← links)
• Theory of Cryptography (Q5898639) (← links)
• Composable long-term security with rewinding (Q6587965) (← links)