The following pages link to (Q4250778):
Displaying 27 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- On constant-round concurrent non-malleable proof systems (Q1944155) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- Random walks and concurrent zero-knowledge (Q2229263) (← links)
- Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Individual simulations (Q2691606) (← links)
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model (Q3408213) (← links)
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model (Q5323057) (← links)
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (Q5445524) (← links)
