Limits on the Usefulness of Random Oracles

Iftach Haitner; Eran Omri; Hila Zarosim

doi:10.1007/s00145-014-9194-9

Limits on the Usefulness of Random Oracles

Iftach Haitner, Eran Omri, Hila Zarosim

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

Abstract

In their seminal work, Impagliazzo and Rudich (STOC’89) showed that no key-agreement protocol exists in the random-oracle model, yielding that key agreement cannot be black-box reduced to one-way functions. In this work, we generalize their result, showing that, to a large extent, no-private-input, semi-honest, two-party functionalities that can be securely implemented in the random oracle model can be securely implemented information theoretically (where parties are assumed to be all powerful, and no oracle is given). Using a recent information-theoretic impossibility result by McGregor et al. (FOCS’10), our result yields that certain functionalities (e.g. inner product) cannot be computed both in an accurately and in a differentially private manner in the random oracle model, implying that protocols for computing these functionalities cannot be black-box reduced to the existence of one-way functions.

Original language	English
Pages (from-to)	283-335
Number of pages	53
Journal	Journal of Cryptology
Volume	29
Issue number	2
DOIs	https://doi.org/10.1007/s00145-014-9194-9
State	Published - 1 Apr 2016

Bibliographical note

Publisher Copyright:
© 2014, International Association for Cryptologic Research.

Funding

A preliminary version appeared in [17 ]. Supported by the Israeli Centers of Research Excellence (I-CORE) program (Center No. 4/11), Israel Science Foundation (Grant No. 1076/11). Research was done while Eran Omri was at Bar Ilan University. Supported by the Israel Science Foundation (Grant No. 189/11). Supported by the Israel Science Foundation (Grant No. 189/11). Hila Zarosim is grateful to the Azrieli Foundation for the award of an Azrieli Fellowship.

Funders	Funder number
Bar Ilan University	189/11
Israel Science Foundation	1076/11
Azrieli Foundation
Israeli Centers for Research Excellence	4/11

Keywords

Black-box separations
Differential privacy
Key agreement
One-way functions
Random oracles

Access to Document

10.1007/s00145-014-9194-9

Cite this

@article{b12a75b153024e46b0616e931838ddfb,

title = "Limits on the Usefulness of Random Oracles",

abstract = "In their seminal work, Impagliazzo and Rudich (STOC{\textquoteright}89) showed that no key-agreement protocol exists in the random-oracle model, yielding that key agreement cannot be black-box reduced to one-way functions. In this work, we generalize their result, showing that, to a large extent, no-private-input, semi-honest, two-party functionalities that can be securely implemented in the random oracle model can be securely implemented information theoretically (where parties are assumed to be all powerful, and no oracle is given). Using a recent information-theoretic impossibility result by McGregor et al. (FOCS{\textquoteright}10), our result yields that certain functionalities (e.g. inner product) cannot be computed both in an accurately and in a differentially private manner in the random oracle model, implying that protocols for computing these functionalities cannot be black-box reduced to the existence of one-way functions.",

keywords = "Black-box separations, Differential privacy, Key agreement, One-way functions, Random oracles",

author = "Iftach Haitner and Eran Omri and Hila Zarosim",

note = "Publisher Copyright: {\textcopyright} 2014, International Association for Cryptologic Research.",

year = "2016",

month = apr,

day = "1",

doi = "10.1007/s00145-014-9194-9",

language = "אנגלית",

volume = "29",

pages = "283--335",

journal = "Journal of Cryptology",

issn = "0933-2790",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Limits on the Usefulness of Random Oracles

AU - Haitner, Iftach

AU - Omri, Eran

AU - Zarosim, Hila

PY - 2016/4/1

Y1 - 2016/4/1

N2 - In their seminal work, Impagliazzo and Rudich (STOC’89) showed that no key-agreement protocol exists in the random-oracle model, yielding that key agreement cannot be black-box reduced to one-way functions. In this work, we generalize their result, showing that, to a large extent, no-private-input, semi-honest, two-party functionalities that can be securely implemented in the random oracle model can be securely implemented information theoretically (where parties are assumed to be all powerful, and no oracle is given). Using a recent information-theoretic impossibility result by McGregor et al. (FOCS’10), our result yields that certain functionalities (e.g. inner product) cannot be computed both in an accurately and in a differentially private manner in the random oracle model, implying that protocols for computing these functionalities cannot be black-box reduced to the existence of one-way functions.

AB - In their seminal work, Impagliazzo and Rudich (STOC’89) showed that no key-agreement protocol exists in the random-oracle model, yielding that key agreement cannot be black-box reduced to one-way functions. In this work, we generalize their result, showing that, to a large extent, no-private-input, semi-honest, two-party functionalities that can be securely implemented in the random oracle model can be securely implemented information theoretically (where parties are assumed to be all powerful, and no oracle is given). Using a recent information-theoretic impossibility result by McGregor et al. (FOCS’10), our result yields that certain functionalities (e.g. inner product) cannot be computed both in an accurately and in a differentially private manner in the random oracle model, implying that protocols for computing these functionalities cannot be black-box reduced to the existence of one-way functions.

KW - Black-box separations

KW - Differential privacy

KW - Key agreement

KW - One-way functions

KW - Random oracles

UR - http://www.scopus.com/inward/record.url?scp=84959162251&partnerID=8YFLogxK

U2 - 10.1007/s00145-014-9194-9

DO - 10.1007/s00145-014-9194-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84959162251

SN - 0933-2790

VL - 29

SP - 283

EP - 335

JO - Journal of Cryptology

JF - Journal of Cryptology

IS - 2

ER -

Limits on the Usefulness of Random Oracles

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this