Malleable zero-knowledge proofs and applications
dc.contributor.advisor
Kohlweiss, Markulf
dc.contributor.advisor
Arapinis, Myrto
dc.contributor.author
Volkhov, Mikhail
dc.date.accessioned
2023-12-12T10:55:24Z
dc.date.available
2023-12-12T10:55:24Z
dc.date.issued
2023-12-12
dc.description.abstract
In recent years, the field of privacy-preserving technologies has experienced considerable expansion, with zero-knowledge proofs (ZKPs) playing one of the most prominent roles.
Although ZKPs have been a well-established theoretical construct for three decades, recent efficiency improvements and novel privacy applications within decentralized finance have become the main drivers behind the surge of interest and investment in this area.
This momentum has subsequently sparked unprecedented technical advances.
Non-interactive ZKPs (NIZKs) are now regularly implemented across a variety of domains, encompassing, but not limited to, privacy-enabling cryptocurrencies, credential systems, voting, mixing, secure multi-party computation, and other cryptographic protocols.
This thesis, although covering several areas of ZKP technologies and their application, focuses on one important aspect of NIZKs, namely their malleability.
Malleability is a quality of a proof system that describes the potential for altering an already generated proof.
Different properties may be desired in different application contexts.
On the one end of the spectrum, non-malleability ensures proof immutability, an important requirement in scenarios such as prevention of replay attacks in anonymous cryptocurrencies.
At the other end, some NIZKs enable proof updatability, recursively and directly, a feature that is integral for a variety of contexts, such as private smart contracts, compact blockchains, ZK rollups, ZK virtual machines, and MPC protocols generally.
This work starts with a detailed analysis of the malleability and overarching security of a popular NIZK, known as Groth16.
Here we adopt a more definitional approach, studying certain properties of the proof system, and its setup ceremony, that are crucial for its precise modelling within bigger systems.
Subsequently, the work explores the malleability of transactions within a private cryptocurrency variant, where we show that relaxing non-malleability assumptions enables a functionality, specifically an atomic asset swap, that is useful for cryptocurrency applications.
The work culminates with a study of a less general, algebraic NIZK, and particularly its updatability properties, whose applicability we present within the context of ensuring privacy for regulatory compliance purposes.
en
dc.identifier.uri
https://hdl.handle.net/1842/41275
dc.identifier.uri
http://dx.doi.org/10.7488/era/4011
dc.language.iso
en
en
dc.publisher
The University of Edinburgh
en
dc.subject
zero-knowledge proofs
en
dc.subject
ZKPs
en
dc.subject
NIZKs
en
dc.subject
proof updatability
en
dc.subject
Groth16
en
dc.subject
malleability of transactions
en
dc.subject
private cryptocurrency variant
en
dc.title
Malleable zero-knowledge proofs and applications
en
dc.type
Thesis or Dissertation
en
dc.type.qualificationlevel
Doctoral
en
dc.type.qualificationname
PhD Doctor of Philosophy
en
Files
Original bundle
1 - 1 of 1
- Name:
- Volkhov2023.pdf
- Size:
- 1.81 MB
- Format:
- Adobe Portable Document Format
- Description:
This item appears in the following Collection(s)

