Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Linear Lower Bound on the Communication Complexity of Single-Server ..."

Iftach Haitner, Jonathan J. Hoch, Gil Segev (2007)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-05-11

- view
  - electronic edition @ iacr.org (open access)
- export record
  dblp key:
  - journals/iacr/HaitnerHS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/HaitnerHS07
Iftach Haitner, Jonathan J. Hoch, Gil Segev:
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2007: 351 (2007)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.