Towards non-black-box lower bounds in cryptography

Rafael Pass; Wei Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam

doi:10.1007/978-3-642-19571-6_35

Towards non-black-box lower bounds in cryptography

Rafael Pass^*, Wei Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam

^*Corresponding author for this work

Cornell University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

We consider average-case strengthenings of the traditional assumption that coNP is not contained in AM. Under these assumptions, we rule out generic and potentially non-black-box constructions of various cryptographic primitives (e.g., one-way permutations, collision-resistant hash-functions, constant-round statistically hiding commitments, and constant-round black-box zero-knowledge proofs for NP) from one-way functions, assuming the security reductions are black-box.

Original language	English
Title of host publication	Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings
Publisher	Springer Verlag
Pages	579-596
Number of pages	18
ISBN (Print)	9783642195709
DOIs	https://doi.org/10.1007/978-3-642-19571-6_35
State	Published - 2011
Externally published	Yes
Event	8th Theory of Cryptography Conference, TCC 2011 - Providence, United States Duration: 28 Mar 2011 → 30 Mar 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6597 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th Theory of Cryptography Conference, TCC 2011
Country/Territory	United States
City	Providence
Period	28/03/11 → 30/03/11

Access to Document

10.1007/978-3-642-19571-6_35

Cite this

Pass, R., Tseng, W. L. D., & Venkitasubramaniam, M. (2011). Towards non-black-box lower bounds in cryptography. In Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings (pp. 579-596). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6597 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-19571-6_35

Pass, Rafael ; Tseng, Wei Lung Dustin ; Venkitasubramaniam, Muthuramakrishnan. / Towards non-black-box lower bounds in cryptography. Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings. Springer Verlag, 2011. pp. 579-596 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{31c4ee6150154a14b0ff40d49218189e,

title = "Towards non-black-box lower bounds in cryptography",

abstract = "We consider average-case strengthenings of the traditional assumption that coNP is not contained in AM. Under these assumptions, we rule out generic and potentially non-black-box constructions of various cryptographic primitives (e.g., one-way permutations, collision-resistant hash-functions, constant-round statistically hiding commitments, and constant-round black-box zero-knowledge proofs for NP) from one-way functions, assuming the security reductions are black-box.",

author = "Rafael Pass and Tseng, {Wei Lung Dustin} and Muthuramakrishnan Venkitasubramaniam",

year = "2011",

doi = "10.1007/978-3-642-19571-6_35",

language = "אנגלית",

isbn = "9783642195709",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "579--596",

booktitle = "Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings",

address = "גרמניה",

note = "8th Theory of Cryptography Conference, TCC 2011 ; Conference date: 28-03-2011 Through 30-03-2011",

}

Pass, R, Tseng, WLD & Venkitasubramaniam, M 2011, Towards non-black-box lower bounds in cryptography. in Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6597 LNCS, Springer Verlag, pp. 579-596, 8th Theory of Cryptography Conference, TCC 2011, Providence, United States, 28/03/11. https://doi.org/10.1007/978-3-642-19571-6_35

Towards non-black-box lower bounds in cryptography. / Pass, Rafael; Tseng, Wei Lung Dustin; Venkitasubramaniam, Muthuramakrishnan.
Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings. Springer Verlag, 2011. p. 579-596 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6597 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Towards non-black-box lower bounds in cryptography

AU - Pass, Rafael

AU - Tseng, Wei Lung Dustin

AU - Venkitasubramaniam, Muthuramakrishnan

PY - 2011

Y1 - 2011

N2 - We consider average-case strengthenings of the traditional assumption that coNP is not contained in AM. Under these assumptions, we rule out generic and potentially non-black-box constructions of various cryptographic primitives (e.g., one-way permutations, collision-resistant hash-functions, constant-round statistically hiding commitments, and constant-round black-box zero-knowledge proofs for NP) from one-way functions, assuming the security reductions are black-box.

AB - We consider average-case strengthenings of the traditional assumption that coNP is not contained in AM. Under these assumptions, we rule out generic and potentially non-black-box constructions of various cryptographic primitives (e.g., one-way permutations, collision-resistant hash-functions, constant-round statistically hiding commitments, and constant-round black-box zero-knowledge proofs for NP) from one-way functions, assuming the security reductions are black-box.

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

U2 - 10.1007/978-3-642-19571-6_35

DO - 10.1007/978-3-642-19571-6_35

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:79953200125

SN - 9783642195709

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 579

EP - 596

BT - Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings

PB - Springer Verlag

T2 - 8th Theory of Cryptography Conference, TCC 2011

Y2 - 28 March 2011 through 30 March 2011

ER -

Pass R, Tseng WLD, Venkitasubramaniam M. Towards non-black-box lower bounds in cryptography. In Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings. Springer Verlag. 2011. p. 579-596. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-19571-6_35

Towards non-black-box lower bounds in cryptography

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this