Pages that link to "Item:Q5429387"

The following pages link to Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model (Q5429387):

Displayed 9 items.

• Concurrent knowledge extraction in public-key models (Q271592) ‎ (← links)
• Delayed-input cryptographic protocols (Q2011641) ‎ (← links)
• Individual simulations (Q2691606) ‎ (← links)
• A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) ‎ (← links)
• Improved OR-Composition of Sigma-Protocols (Q2799092) ‎ (← links)
• Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) ‎ (← links)
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) ‎ (← links)
• Resettably Secure Computation (Q3627427) ‎ (← links)
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model (Q5323057) ‎ (← links)