Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs

Carsten Baum; Robin Jadoul; Emmanuela Orsini; Peter Scholl; Nigel P. Smart

doi:10.1145/3548606.3559354

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs

Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart

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

8 Scopus citations

Abstract

Zero-Knowledge protocols have increasingly become both popular and practical in recent years due to their applicability in many areas such as blockchain systems. Unfortunately, public verifiability and small proof sizes of zero-knowledge protocols currently come at the price of strong assumptions, large prover time, or both, when considering statements with millions of gates. In this regime, the most prover-efficient protocols are in the designated verifier setting, where proofs are only valid to a single party that must keep a secret state. In this work, we bridge this gap between designated-verifier proofs and public verifiability by distributing the verifier efficiently. Here, a set of verifiers can then verify a proof and, if a given threshold t of the n verifiers is honest and trusted, can act as guarantors for the validity of a statement. We achieve this while keeping the concrete efficiency of current designated-verifier proofs, and present constructions that have small concrete computation and communication cost. We present practical protocols in the setting of threshold verifiers with t<n/4 and t<n/3, for which we give performance figures, showcasing the efficiency of our approach.

Original language	English
Title of host publication	CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
Publisher	Association for Computing Machinery
Pages	293-306
Number of pages	14
ISBN (Electronic)	9781450394505
DOIs	https://doi.org/10.1145/3548606.3559354
State	Published - 7 Nov 2022
Externally published	Yes
Event	28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022 - Los Angeles, United States Duration: 7 Nov 2022 → 11 Nov 2022

Publication series

Name	Proceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)	1543-7221

Conference

Conference	28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022
Country/Territory	United States
City	Los Angeles
Period	7/11/22 → 11/11/22

Bibliographical note

Publisher Copyright:
© 2022 Owner/Author.

Funding

We thank Pratik Sarkar for identifying a bug in an earlier version. This work has been supported in part by ERC Advanced Grant ERC-2015-AdG-IMPaCT, by the Defense Advanced Research Projects Agency (DARPA) under contract HR001120C0085, by the FWO under an Odysseus project GOH9718N, by CyberSecurity Research Flanders with reference number VR20192203, by the Aarhus University Research Foundation, and by the Independent Research Fund Denmark under project number 0165-00107B.

Funders	Funder number
CyberSecurity Research Flanders	VR20192203
Defense Advanced Research Projects Agency	HR001120C0085
Aarhus Universitets Forskningsfond
Fonds Wetenschappelijk Onderzoek	GOH9718N
Danmarks Frie Forskningsfond	0165-00107B

Keywords

multi-party computation
threshold cryptography
zero-knowledge proofs

Access to Document

10.1145/3548606.3559354

Cite this

Baum, C., Jadoul, R., Orsini, E., Scholl, P., & Smart, N. P. (2022). Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. In CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 293-306). (Proceedings of the ACM Conference on Computer and Communications Security). Association for Computing Machinery. https://doi.org/10.1145/3548606.3559354

@inproceedings{a5e8f566d59d46d3ba5240c016e99c59,

title = "Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs",

abstract = "Zero-Knowledge protocols have increasingly become both popular and practical in recent years due to their applicability in many areas such as blockchain systems. Unfortunately, public verifiability and small proof sizes of zero-knowledge protocols currently come at the price of strong assumptions, large prover time, or both, when considering statements with millions of gates. In this regime, the most prover-efficient protocols are in the designated verifier setting, where proofs are only valid to a single party that must keep a secret state. In this work, we bridge this gap between designated-verifier proofs and public verifiability by distributing the verifier efficiently. Here, a set of verifiers can then verify a proof and, if a given threshold t of the n verifiers is honest and trusted, can act as guarantors for the validity of a statement. We achieve this while keeping the concrete efficiency of current designated-verifier proofs, and present constructions that have small concrete computation and communication cost. We present practical protocols in the setting of threshold verifiers with t",

keywords = "multi-party computation, threshold cryptography, zero-knowledge proofs",

author = "Carsten Baum and Robin Jadoul and Emmanuela Orsini and Peter Scholl and Smart, {Nigel P.}",

note = "Publisher Copyright: {\textcopyright} 2022 Owner/Author.; 28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022 ; Conference date: 07-11-2022 Through 11-11-2022",

year = "2022",

month = nov,

day = "7",

doi = "10.1145/3548606.3559354",

language = "אנגלית",

series = "Proceedings of the ACM Conference on Computer and Communications Security",

publisher = "Association for Computing Machinery",

pages = "293--306",

booktitle = "CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security",

}

Baum, C, Jadoul, R, Orsini, E, Scholl, P & Smart, NP 2022, Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. in CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. Proceedings of the ACM Conference on Computer and Communications Security, Association for Computing Machinery, pp. 293-306, 28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, United States, 7/11/22. https://doi.org/10.1145/3548606.3559354

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. / Baum, Carsten; Jadoul, Robin; Orsini, Emmanuela et al.
CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, 2022. p. 293-306 (Proceedings of the ACM Conference on Computer and Communications Security).

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

TY - GEN

T1 - Feta

T2 - 28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022

AU - Baum, Carsten

AU - Jadoul, Robin

AU - Orsini, Emmanuela

AU - Scholl, Peter

AU - Smart, Nigel P.

PY - 2022/11/7

Y1 - 2022/11/7

N2 - Zero-Knowledge protocols have increasingly become both popular and practical in recent years due to their applicability in many areas such as blockchain systems. Unfortunately, public verifiability and small proof sizes of zero-knowledge protocols currently come at the price of strong assumptions, large prover time, or both, when considering statements with millions of gates. In this regime, the most prover-efficient protocols are in the designated verifier setting, where proofs are only valid to a single party that must keep a secret state. In this work, we bridge this gap between designated-verifier proofs and public verifiability by distributing the verifier efficiently. Here, a set of verifiers can then verify a proof and, if a given threshold t of the n verifiers is honest and trusted, can act as guarantors for the validity of a statement. We achieve this while keeping the concrete efficiency of current designated-verifier proofs, and present constructions that have small concrete computation and communication cost. We present practical protocols in the setting of threshold verifiers with t

AB - Zero-Knowledge protocols have increasingly become both popular and practical in recent years due to their applicability in many areas such as blockchain systems. Unfortunately, public verifiability and small proof sizes of zero-knowledge protocols currently come at the price of strong assumptions, large prover time, or both, when considering statements with millions of gates. In this regime, the most prover-efficient protocols are in the designated verifier setting, where proofs are only valid to a single party that must keep a secret state. In this work, we bridge this gap between designated-verifier proofs and public verifiability by distributing the verifier efficiently. Here, a set of verifiers can then verify a proof and, if a given threshold t of the n verifiers is honest and trusted, can act as guarantors for the validity of a statement. We achieve this while keeping the concrete efficiency of current designated-verifier proofs, and present constructions that have small concrete computation and communication cost. We present practical protocols in the setting of threshold verifiers with t

KW - multi-party computation

KW - threshold cryptography

KW - zero-knowledge proofs

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

U2 - 10.1145/3548606.3559354

DO - 10.1145/3548606.3559354

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

AN - SCOPUS:85143061769

T3 - Proceedings of the ACM Conference on Computer and Communications Security

SP - 293

EP - 306

BT - CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

PB - Association for Computing Machinery

Y2 - 7 November 2022 through 11 November 2022

ER -

Baum C, Jadoul R, Orsini E, Scholl P, Smart NP. Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. In CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery. 2022. p. 293-306. (Proceedings of the ACM Conference on Computer and Communications Security). doi: 10.1145/3548606.3559354

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this