Automata, Languages and Programming
From MaRDI portal
Publication:5716759
DOI10.1007/11523468zbMath1081.94028OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716759
Omer Horvitz, Jonathan N. Katz
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
