Pages that link to "Item:Q5176015"
From MaRDI portal
The following pages link to Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds (Q5176015):
Displaying 20 items.
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Random walks and concurrent zero-knowledge (Q2229263) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Individual simulations (Q2691606) (← links)
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security (Q2802147) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model (Q3408213) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model (Q5323057) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
