Paper 2023/857 Original: eprint.iacr.org/2023/857 ↗
SoK: Vector OLE-Based Zero-Knowledge Protocols
Abstract
A zero-knowledge proof is a cryptographic protocol where a prover can convince a verifier that a statement is true, without revealing any further information except for the truth of the statement. More precisely, if $x$ is a statement from an NP language verified by an efficient machine $M$, then a zero-knowledge proof aims to prove to the verifier that there exists a witness $w$ such that $M(x,w)=1$, without revealing any further information about $w$. The proof is a proof of knowledge, if the prover additionally convinces the verifier that it knows the witness $w$, rather than just of its existence. This article is a survey of recent developments in building practical systems for zero-knowledge proofs of knowledge using vector oblivious linear evaluation (VOLE), a tool from secure two-party computation.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-06-07: last updated
- 2023-06-07: published
- Short URL
- https://ia.cr/2023/857
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/857,
author = {Carsten Baum and Samuel Dittmer and Peter Scholl and Xiao Wang},
title = {SoK: Vector OLE-Based Zero-Knowledge Protocols},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/857},
year = {2023},
url = {https://eprint.iacr.org/2023/857}
}