The following pages link to Theory of Cryptography (Q5901762):
Displaying 28 items.
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way (Q5445518) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? (Q5505474) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← 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)
- CCA security and trapdoor functions via key-dependent-message security (Q5918652) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- (Q6084353) (← links)
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Lifting standard model reductions to common setup assumptions (Q6169031) (← links)
- Universal reductions: reductions relative to stateful oracles (Q6169554) (← links)
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions (Q6562579) (← links)
- Lower bounds on assumptions behind registration-based encryption (Q6582178) (← links)
- Pseudorandomness with proof of destruction and applications (Q6587948) (← links)
- Limits in the provable security of ECDSA signatures (Q6587956) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q6617635) (← links)
- New limits of provable security and applications to ElGamal encryption (Q6637527) (← links)
- Limits on the power of prime-order groups: separating Q-type from static assumptions (Q6652960) (← links)
- Structural lower bounds on black-box constructions of pseudorandom functions (Q6652977) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q6665547) (← links)
