Pages that link to "Item:Q5445520"
From MaRDI portal
The following pages link to A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520):
Displaying 3 items.
- Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← 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)
