Strong proofs of knowledge

Oded Goldreich

doi:https://doi.org/10.1007/978-3-642-22670-0_7

Strong proofs of knowledge

Oded Goldreich

Department of Computer Science and Applied Mathematics

Weizmann Institute of Science

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

Abstract

The concept of proofs-of-knowledge, introduced in the seminal paper of Goldwasser, Micali and Rackoff, plays a central role in various cryptographic applications. An adequate formulation, which enables modular applications of proofs of knowledge inside other protocols, was presented by Bellare and Goldreich. However, this formulation depends in an essential way on the notion of expected (rather than worst-case) running-time. Here we present a seemingly more restricted notion that maintains the main feature of the prior definition while referring only to machines that run in strict probabilistic polynomial-time (rather than to expected polynomial-time).

Original language	English
Title of host publication	Studies in Complexity and Cryptography
Subtitle of host publication	Miscellanea on the Interplay between Randomness and Computation
Editors	Oded Goldreich
Chapter	7
Pages	54-58
Number of pages	5
DOIs	https://doi.org/10.1007/978-3-642-22670-0_7
State	Published - 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6650 LNCS

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-642-22670-0_7

Cite this

Goldreich, O. (2011). Strong proofs of knowledge. In O. Goldreich (Ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation (pp. 54-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS). https://doi.org/10.1007/978-3-642-22670-0_7

@inbook{c3b7f73686bb4ac3b5c5ce203b12068e,

title = "Strong proofs of knowledge",

abstract = "The concept of proofs-of-knowledge, introduced in the seminal paper of Goldwasser, Micali and Rackoff, plays a central role in various cryptographic applications. An adequate formulation, which enables modular applications of proofs of knowledge inside other protocols, was presented by Bellare and Goldreich. However, this formulation depends in an essential way on the notion of expected (rather than worst-case) running-time. Here we present a seemingly more restricted notion that maintains the main feature of the prior definition while referring only to machines that run in strict probabilistic polynomial-time (rather than to expected polynomial-time).",

author = "Oded Goldreich",

year = "2011",

doi = "https://doi.org/10.1007/978-3-642-22670-0_7",

language = "الإنجليزيّة",

isbn = "9783642226694",

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

pages = "54--58",

editor = "Oded Goldreich",

booktitle = "Studies in Complexity and Cryptography",

}

Goldreich, O 2011, Strong proofs of knowledge. in O Goldreich (ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6650 LNCS, pp. 54-58. https://doi.org/10.1007/978-3-642-22670-0_7

Strong proofs of knowledge. / Goldreich, Oded.
Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. ed. / Oded Goldreich. 2011. p. 54-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS).

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

TY - CHAP

T1 - Strong proofs of knowledge

AU - Goldreich, Oded

PY - 2011

Y1 - 2011

N2 - The concept of proofs-of-knowledge, introduced in the seminal paper of Goldwasser, Micali and Rackoff, plays a central role in various cryptographic applications. An adequate formulation, which enables modular applications of proofs of knowledge inside other protocols, was presented by Bellare and Goldreich. However, this formulation depends in an essential way on the notion of expected (rather than worst-case) running-time. Here we present a seemingly more restricted notion that maintains the main feature of the prior definition while referring only to machines that run in strict probabilistic polynomial-time (rather than to expected polynomial-time).

AB - The concept of proofs-of-knowledge, introduced in the seminal paper of Goldwasser, Micali and Rackoff, plays a central role in various cryptographic applications. An adequate formulation, which enables modular applications of proofs of knowledge inside other protocols, was presented by Bellare and Goldreich. However, this formulation depends in an essential way on the notion of expected (rather than worst-case) running-time. Here we present a seemingly more restricted notion that maintains the main feature of the prior definition while referring only to machines that run in strict probabilistic polynomial-time (rather than to expected polynomial-time).

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

U2 - https://doi.org/10.1007/978-3-642-22670-0_7

DO - https://doi.org/10.1007/978-3-642-22670-0_7

M3 - فصل

SN - 9783642226694

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

SP - 54

EP - 58

BT - Studies in Complexity and Cryptography

A2 - Goldreich, Oded

ER -

Goldreich O. Strong proofs of knowledge. In Goldreich O, editor, Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. 2011. p. 54-58. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-642-22670-0_7

Strong proofs of knowledge

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this