Pages that link to "Item:Q4875450"

The following pages link to On the Composition of Zero-Knowledge Proof Systems (Q4875450):

Displaying 50 items.

• Concurrent knowledge extraction in public-key models (Q271592) (← links)
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
• Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← links)
• A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
• Parallel repetition of computationally sound protocols revisited (Q421032) (← links)
• Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
• Possibility and impossibility results for selective decommitments (Q451116) (← links)
• Long-term security and universal composability (Q604632) (← links)
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
• Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
• Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
• Random oracles and non-uniformity (Q1648794) (← links)
• The hunting of the SNARK (Q1698394) (← links)
• Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
• What security can we achieve within 4 rounds? (Q2010586) (← links)
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
• Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
• Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
• On the round complexity of black-box secure MPC (Q2128561) (← links)
• Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
• Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
• Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
• Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
• GNUC: a new universal composability framework (Q2516522) (← links)
• Individual simulations (Q2691606) (← links)
• Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
• Concurrent composition of differential privacy (Q2697876) (← links)
• An efficient statistical zero-knowledge authentication protocol for smart cards (Q2804907) (← links)
• On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs (Q2827722) (← links)
• What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
• On the Existence of Extractable One-Way Functions (Q2829449) (← links)
• Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
• On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
• 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
• Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
• Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← links)
• On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
• Impossibility of Black-Box Simulation Against Leakage Attacks (Q3457063) (← links)
• Parallel and Concurrent Security of the HB and HB +  Protocols (Q3593090) (← links)
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
• The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
• How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
• Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
• Cryptography and cryptographic protocols (Q5138490) (← 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)