Guaranteed Output in O(&#x221A;n) Rounds for Round-Robin Sampling Protocols

Ran Cohen; Jack Doerner; Yashvanth Kondi; Abhi Shelat

doi:10.1007/978-3-031-06944-4_9

Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols

Ran Cohen
, Jack Doerner
, Yashvanth Kondi
, Abhi Shelat

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

4 Scopus citations

Abstract

We introduce a notion of round-robin secure sampling that captures several protocols in the literature, such as the “powers-of-tau” setup protocol for pairing-based polynomial commitments and zk-SNARKs, and certain verifiable mixnets. Due to their round-robin structure, protocols of this class inherently require n sequential broadcast rounds, where n is the number of participants. We describe how to compile them generically into protocols that require only O(n) broadcast rounds. Our compiled protocols guarantee output delivery against any dishonest majority. This stands in contrast to prior techniques, which require Ω(n) sequential broadcasts in most cases (and sometimes many more). Our compiled protocols permit a certain amount of adversarial bias in the output, as all sampling protocols with guaranteed output must, due to Cleve’s impossibility result (STOC’86). We show that in the context of the aforementioned applications, this bias is harmless.

Original language	English
Title of host publication	Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings
Editors	Orr Dunkelman, Stefan Dziembowski
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	241-271
Number of pages	31
ISBN (Print)	9783031069437
DOIs	https://doi.org/10.1007/978-3-031-06944-4_9
State	Published - 2022
Externally published	Yes
Event	41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022 - Trondheim, Norway Duration: 30 May 2022 → 3 Jun 2022

Publication series

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

Conference

Conference	41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022
Country/Territory	Norway
City	Trondheim
Period	30/05/22 → 3/06/22

Bibliographical note

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

Funding

thank an anonymous reviewer for making us aware of certain practical optimizations used in the full version of this paper. Ran Cohen’s research is supported in part by NSF grant no. 2055568. The other authors are supported in part by NSF grants 1816028 and 1646671.

Funders	Funder number
Neurosciences Foundation	1646671, 1816028, 2055568

Access to Document

10.1007/978-3-031-06944-4_9

Cite this

Cohen, R., Doerner, J., Kondi, Y., & Shelat, A. (2022). Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols. In O. Dunkelman, & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 241-271). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13275 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-06944-4_9

Cohen, Ran ; Doerner, Jack ; Kondi, Yashvanth et al. / Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols. Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. editor / Orr Dunkelman ; Stefan Dziembowski. Springer Science and Business Media Deutschland GmbH, 2022. pp. 241-271 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ea1f2e2043184fce909c84f0681013b1,

title = "Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols",

abstract = "We introduce a notion of round-robin secure sampling that captures several protocols in the literature, such as the “powers-of-tau” setup protocol for pairing-based polynomial commitments and zk-SNARKs, and certain verifiable mixnets. Due to their round-robin structure, protocols of this class inherently require n sequential broadcast rounds, where n is the number of participants. We describe how to compile them generically into protocols that require only O(n) broadcast rounds. Our compiled protocols guarantee output delivery against any dishonest majority. This stands in contrast to prior techniques, which require Ω(n) sequential broadcasts in most cases (and sometimes many more). Our compiled protocols permit a certain amount of adversarial bias in the output, as all sampling protocols with guaranteed output must, due to Cleve{\textquoteright}s impossibility result (STOC{\textquoteright}86). We show that in the context of the aforementioned applications, this bias is harmless.",

author = "Ran Cohen and Jack Doerner and Yashvanth Kondi and Abhi Shelat",

note = "Publisher Copyright: {\textcopyright} 2022, International Association for Cryptologic Research.; 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022 ; Conference date: 30-05-2022 Through 03-06-2022",

year = "2022",

doi = "10.1007/978-3-031-06944-4\_9",

language = "אנגלית",

isbn = "9783031069437",

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

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "241--271",

editor = "Orr Dunkelman and Stefan Dziembowski",

booktitle = "Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings",

address = "גרמניה",

}

Cohen, R, Doerner, J, Kondi, Y & Shelat, A 2022, Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols. in O Dunkelman & S Dziembowski (eds), Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13275 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 241-271, 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022, Trondheim, Norway, 30/05/22. https://doi.org/10.1007/978-3-031-06944-4_9

Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols. / Cohen, Ran; Doerner, Jack; Kondi, Yashvanth et al.
Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. ed. / Orr Dunkelman; Stefan Dziembowski. Springer Science and Business Media Deutschland GmbH, 2022. p. 241-271 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13275 LNCS).

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

TY - GEN

T1 - Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols

AU - Cohen, Ran

AU - Doerner, Jack

AU - Kondi, Yashvanth

AU - Shelat, Abhi

PY - 2022

Y1 - 2022

N2 - We introduce a notion of round-robin secure sampling that captures several protocols in the literature, such as the “powers-of-tau” setup protocol for pairing-based polynomial commitments and zk-SNARKs, and certain verifiable mixnets. Due to their round-robin structure, protocols of this class inherently require n sequential broadcast rounds, where n is the number of participants. We describe how to compile them generically into protocols that require only O(n) broadcast rounds. Our compiled protocols guarantee output delivery against any dishonest majority. This stands in contrast to prior techniques, which require Ω(n) sequential broadcasts in most cases (and sometimes many more). Our compiled protocols permit a certain amount of adversarial bias in the output, as all sampling protocols with guaranteed output must, due to Cleve’s impossibility result (STOC’86). We show that in the context of the aforementioned applications, this bias is harmless.

AB - We introduce a notion of round-robin secure sampling that captures several protocols in the literature, such as the “powers-of-tau” setup protocol for pairing-based polynomial commitments and zk-SNARKs, and certain verifiable mixnets. Due to their round-robin structure, protocols of this class inherently require n sequential broadcast rounds, where n is the number of participants. We describe how to compile them generically into protocols that require only O(n) broadcast rounds. Our compiled protocols guarantee output delivery against any dishonest majority. This stands in contrast to prior techniques, which require Ω(n) sequential broadcasts in most cases (and sometimes many more). Our compiled protocols permit a certain amount of adversarial bias in the output, as all sampling protocols with guaranteed output must, due to Cleve’s impossibility result (STOC’86). We show that in the context of the aforementioned applications, this bias is harmless.

UR - https://www.scopus.com/pages/publications/85131956744

U2 - 10.1007/978-3-031-06944-4_9

DO - 10.1007/978-3-031-06944-4_9

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

AN - SCOPUS:85131956744

SN - 9783031069437

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

SP - 241

EP - 271

BT - Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings

A2 - Dunkelman, Orr

A2 - Dziembowski, Stefan

PB - Springer Science and Business Media Deutschland GmbH

T2 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022

Y2 - 30 May 2022 through 3 June 2022

ER -

Cohen R, Doerner J, Kondi Y, Shelat A. Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols. In Dunkelman O, Dziembowski S, editors, Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 241-271. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-06944-4_9

Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this

Guaranteed Output in O(&#x221A;n) Rounds for Round-Robin Sampling Protocols

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this

Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols