Predictable arguments of knowledge

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Standard

Predictable arguments of knowledge. / Faonio, Antonio; Nielsen, Jesper Buus; Venturi, Daniele.

Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. ed. / Serge Fehr. Vol. 10174 Springer VS, 2017. p. 121-150 (Lecture Notes in Computer Science, Vol. 10174).

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Harvard

Faonio, A, Nielsen, JB & Venturi, D 2017, Predictable arguments of knowledge. in S Fehr (ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. vol. 10174, Springer VS, Lecture Notes in Computer Science, vol. 10174, pp. 121-150, 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017, Amsterdam, Netherlands, 28/03/2017. https://doi.org/10.1007/978-3-662-54365-8_6

APA

Faonio, A., Nielsen, J. B., & Venturi, D. (2017). Predictable arguments of knowledge. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 10174, pp. 121-150). Springer VS. Lecture Notes in Computer Science, Vol.. 10174 https://doi.org/10.1007/978-3-662-54365-8_6

CBE

Faonio A, Nielsen JB, Venturi D. 2017. Predictable arguments of knowledge. Fehr S, editor. In Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Springer VS. pp. 121-150. (Lecture Notes in Computer Science, Vol. 10174). https://doi.org/10.1007/978-3-662-54365-8_6

MLA

Faonio, Antonio, Jesper Buus Nielsen and Daniele Venturi "Predictable arguments of knowledge". Fehr, Serge (ed.). Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Springer VS. (Lecture Notes in Computer Science, Vol. 10174). 2017, 121-150. https://doi.org/10.1007/978-3-662-54365-8_6

Vancouver

Faonio A, Nielsen JB, Venturi D. Predictable arguments of knowledge. In Fehr S, editor, Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Vol. 10174. Springer VS. 2017. p. 121-150. (Lecture Notes in Computer Science, Vol. 10174). https://doi.org/10.1007/978-3-662-54365-8_6

Author

Faonio, Antonio ; Nielsen, Jesper Buus ; Venturi, Daniele. / Predictable arguments of knowledge. Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. editor / Serge Fehr. Vol. 10174 Springer VS, 2017. pp. 121-150 (Lecture Notes in Computer Science, Vol. 10174).

Bibtex

@inproceedings{75fc3eae40064ec1a29ef7f683446845,
title = "Predictable arguments of knowledge",
abstract = "We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP. Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the verifier; we call such protocols Predictable Arguments of Knowledge (PAoK). Our study encompasses a full characterization of PAoK, showing that such arguments can be made extremely laconic, with the prover sending a single bit, and assumed to have only one round (i.e., two messages) of communication without loss of generality. We additionally explore PAoK satisfying additional properties (including zero-knowledge and the possibility of re-using the same challenge across multiple executions with the prover), present several constructions of PAoK relying on different cryptographic tools, and discuss applications to cryptography.",
author = "Antonio Faonio and Nielsen, {Jesper Buus} and Daniele Venturi",
year = "2017",
doi = "10.1007/978-3-662-54365-8_6",
language = "English",
isbn = "9783662543641",
volume = "10174",
series = "Lecture Notes in Computer Science",
publisher = "Springer VS",
pages = "121--150",
editor = "Fehr, {Serge }",
booktitle = "Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings",
note = "20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017 ; Conference date: 28-03-2017 Through 31-03-2017",

}

RIS

TY - GEN

T1 - Predictable arguments of knowledge

AU - Faonio, Antonio

AU - Nielsen, Jesper Buus

AU - Venturi, Daniele

PY - 2017

Y1 - 2017

N2 - We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP. Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the verifier; we call such protocols Predictable Arguments of Knowledge (PAoK). Our study encompasses a full characterization of PAoK, showing that such arguments can be made extremely laconic, with the prover sending a single bit, and assumed to have only one round (i.e., two messages) of communication without loss of generality. We additionally explore PAoK satisfying additional properties (including zero-knowledge and the possibility of re-using the same challenge across multiple executions with the prover), present several constructions of PAoK relying on different cryptographic tools, and discuss applications to cryptography.

AB - We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP. Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the verifier; we call such protocols Predictable Arguments of Knowledge (PAoK). Our study encompasses a full characterization of PAoK, showing that such arguments can be made extremely laconic, with the prover sending a single bit, and assumed to have only one round (i.e., two messages) of communication without loss of generality. We additionally explore PAoK satisfying additional properties (including zero-knowledge and the possibility of re-using the same challenge across multiple executions with the prover), present several constructions of PAoK relying on different cryptographic tools, and discuss applications to cryptography.

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

U2 - 10.1007/978-3-662-54365-8_6

DO - 10.1007/978-3-662-54365-8_6

M3 - Article in proceedings

AN - SCOPUS:85014465351

SN - 9783662543641

VL - 10174

T3 - Lecture Notes in Computer Science

SP - 121

EP - 150

BT - Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings

A2 - Fehr, Serge

PB - Springer VS

T2 - 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017

Y2 - 28 March 2017 through 31 March 2017

ER -