The following pages link to (Q5750403):
Displaying 11 items.
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Limits on the usefulness of random oracles (Q290382) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- On the Communication Complexity of Key-Agreement Protocols. (Q5090417) (← links)
- (Q6084353) (← links)
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
- On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes (Q6193392) (← links)