Sok: vector OLE-based zero-knowledge protocols
Open Access
- 1 October 2023
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (11) , 3527-3561
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. This article is a survey of recent developments in building practical zero-knowledge proof systems using vector oblivious linear evaluation (VOLE), a tool from secure two-party computation. In this work, we attempt to systematize the recent works on VOLE-based Zero-Knowledge proofs and make the state of the art accessible in one document.Keywords
Funding Information
- Defense Sciences Office, DARPA (HR001120C0085, HR001120C0087)
This publication has 47 references indexed in Scilit:
- Quadratic Span Programs and Succinct NIZKs without PCPs2013
- Practical Homomorphic MACs for Arithmetic Circuits2013
- A New Approach to Practical Active-Secure Two-Party Computation2012
- Multiparty Computation from Somewhat Homomorphic Encryption2012
- Semi-homomorphic Encryption and Multiparty Computation2011
- Improved Primitives for Secure Multiparty Integer Computation2010
- LEGO for Two-Party Secure Computation2009
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols2001
- Foundations of Secure Interactive Computing2001
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems2000