Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. EOS: Efficient Private Delegation of zkSNARK Provers
 
Loading...
Thumbnail Image
conference paper

EOS: Efficient Private Delegation of zkSNARK Provers

Chiesa, Alessandro  
•
Lehmkuhl, Ryan
•
Mishra, Pratyush
Show more
January 1, 2023
Proceedings Of The 32Nd Usenix Security Symposium
32nd USENIX Security Symposium

Succinct zero knowledge proofs (i.e. zkSNARKs) are powerful cryptographic tools that enable a prover to convince a verifier that a given statement is true without revealing any additional information. Their attractive privacy properties have led to much academic and industrial interest.|Unfortunately, existing systems for generating zkSNARKs are expensive, which limits the applications in which these proofs can be used. One approach is to take advantage of powerful cloud servers to generate the proof. However, existing techniques for this (e.g., DIZK) sacrifice privacy by revealing secret information to the cloud machines. This is problematic for many applications of zkSNARKs, such as decentralized private currency and computation systems.|In this work we design and implement privacy-preserving delegation protocols for zkSNARKs with universal setup. Our protocols enable a prover to outsource proof generation to a set of workers, so that if at least one worker does not collude with other workers, no private information is revealed to any worker. Our protocols achieve security against malicious workers without relying on heavyweight cryptographic tools.|We implement and evaluate our delegation protocols for a state-of-the-art zkSNARK in a variety of computational and bandwidth settings, and demonstrate that our protocols are concretely efficient. When compared to local proving, using our protocols to delegate proof generation from a recent smartphone (a) reduces end-to-end latency by up to 26x, (b) lowers the delegator's active computation time by up to 1447x, and (c) enables proving up to 256x larger instances.

  • Details
  • Metrics
Type
conference paper
Web of Science ID

WOS:001066451506037

Author(s)
Chiesa, Alessandro  
•
Lehmkuhl, Ryan
•
Mishra, Pratyush
•
Zhang, Yinuo
Corporate authors
USENIX Association
Date Issued

2023-01-01

Publisher

Usenix Assoc

Publisher place

Berkeley

Published in
Proceedings Of The 32Nd Usenix Security Symposium
ISBN of the book

978-1-939133-37-3

Start page

6453

End page

6469

Subjects

Technology

Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
COMPSEC  
Event nameEvent placeEvent date
32nd USENIX Security Symposium

Anaheim, CA

AUG 09-11, 2023

FunderGrant Number

NSF CISE Expeditions

CCF-1730628

NSF Career

1943347

Ethereum Foundation

Show more
Available on Infoscience
February 20, 2024
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/204639
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés