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

Department of Computer Science

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

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'22 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
Number of pages	14
Place of publication	New York
Publisher	Association for Computing Machinery
Publication date	Nov 2022
Pages	293-306
ISBN (Electronic)	9781450394505
DOIs	https://doi.org/10.1145/3548606.3559354
Publication status	Published - Nov 2022
Event	28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022 - Los Angeles, United States Duration: 7 Nov 2022 → 11 Nov 2022

Conference

Conference	28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022
Country/Territory	United States
City	Los Angeles
Period	07/11/2022 → 11/11/2022
Sponsor	ACM Special Interest Group on Security, Audit and Control (ACM SIGSAC)

Keywords

multi-party computation
threshold cryptography
zero-knowledge proofs

Access to Document

10.1145/3548606.3559354

Cite this

@inproceedings{3ada0d15a67a43558a50420914b5c88e,

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,

doi = "10.1145/3548606.3559354",

language = "English",

pages = "293--306",

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

publisher = "Association for Computing Machinery",

address = "United States",

}

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

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

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › 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

Y1 - 2022/11

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 - Article in proceedings

AN - SCOPUS:85143061769

SP - 293

EP - 306

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

PB - Association for Computing Machinery

CY - New York

Y2 - 7 November 2022 through 11 November 2022

ER -

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this