The following pages link to (Q4250778):
Displayed 11 items.
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← 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)
- 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)