Pages that link to "Item:Q5700578"
From MaRDI portal
The following pages link to Bounds on the Efficiency of Generic Cryptographic Constructions (Q5700578):
Displayed 8 items.
- 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)
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs (Q3408193) (← links)
- On the Security Loss in Cryptographic Reductions (Q3627428) (← links)
- Efficiency Bounds for Adversary Constructions in Black-Box Reductions (Q3634498) (← 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)