Pages that link to "Item:Q3581302"
From MaRDI portal
The following pages link to Lower bounds on the efficiency of encryption and digital signature schemes (Q3581302):
Displaying 8 items.
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← 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)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- Limits of black-box anamorphic encryption (Q6648211) (← links)
