Pages that link to "Item:Q5700578"
From MaRDI portal
The following pages link to Bounds on the Efficiency of Generic Cryptographic Constructions (Q5700578):
Displayed 15 items.
- Limits on the usefulness of random oracles (Q290382) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- On the impossibility of highly-efficient blockcipher-based hash functions (Q1027986) (← links)
- Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
- On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs (Q3408193) (← links)
- (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond (Q3457067) (← links)
- On the Security Loss in Cryptographic Reductions (Q3627428) (← links)
- Efficiency Bounds for Adversary Constructions in Black-Box Reductions (Q3634498) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Asymptotically Efficient Lattice-Based Digital Signatures (Q5445497) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)