The following pages link to (Q4249649):
Displayed 17 items.
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs (Q5458593) (← links)
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols (Q5502762) (← links)
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? (Q5505474) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls (Q6083137) (← links)
- Collision-resistance from multi-collision-resistance (Q6108993) (← links)
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions (Q6108995) (← links)
- On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← links)
- Augmented random oracles (Q6163941) (← links)
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols (Q6163951) (← links)
- Lifting standard model reductions to common setup assumptions (Q6169031) (← links)
- On the impossibility of algebraic NIZK in pairing-free groups (Q6190127) (← links)
- Publicly-verifiable deletion via target-collapsing functions (Q6190132) (← links)
- On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes (Q6193392) (← links)