Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation

T Xie, J Zhang, Y Zhang, C Papamanthou… - Advances in Cryptology …, 2019 - Springer
We present Libra, the first zero-knowledge proof system that has both optimal prover time
and succinct proof size/verification time. In particular, if C is the size of the circuit being …

Nova: Recursive zero-knowledge arguments from folding schemes

A Kothapalli, S Setty, I Tzialla - Annual International Cryptology …, 2022 - Springer
We introduce a new approach to realize incrementally verifiable computation (IVC), in which
the prover recursively proves the correct execution of incremental computations of the form …

vChain: Enabling verifiable boolean range queries over blockchain databases

C Xu, C Zhang, J Xu - Proceedings of the 2019 international conference …, 2019 - dl.acm.org
Blockchains have recently been under the spotlight due to the boom of cryptocurrencies and
decentralized applications. There is an increasing demand for querying the data stored in a …

BlockchainDB: A shared database on blockchains

M El-Hindi, C Binnig, A Arasu, D Kossmann… - Proceedings of the …, 2019 - dl.acm.org
In this paper we present BlockchainDB, which leverages blockchains as a storage layer and
introduces a database layer on top that extends blockchains by classical data management …

Transparent polynomial delegation and its applications to zero knowledge proof

J Zhang, T Xie, Y Zhang, D Song - 2020 IEEE Symposium on …, 2020 - ieeexplore.ieee.org
We present a new succinct zero knowledge argument scheme for layered arithmetic circuits
without trusted setup. The prover time is O (C+ nlogn) and the proof size is O (D logC+ log 2 …

VQL: Efficient and verifiable cloud query services for blockchain systems

H Wu, Z Peng, S Guo, Y Yang… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Despite increasingly emerging applications, a primary concern for blockchain to be fully
practical is the inefficiency of data query. Direct queries on the blockchain take much time by …

Legosnark: Modular design and composition of succinct zero-knowledge proofs

M Campanelli, D Fiore, A Querol - … of the 2019 ACM SIGSAC Conference …, 2019 - dl.acm.org
We study the problem of building non-interactive proof systems modularly by linking small
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …

FalconDB: Blockchain-based collaborative database

Y Peng, M Du, F Li, R Cheng, D Song - Proceedings of the 2020 ACM …, 2020 - dl.acm.org
Nowadays an emerging class of applications are based oncollaboration over a shared
database among different entities. However, the existing solutions on shared database may …

vChain+: Optimizing verifiable blockchain boolean range queries

H Wang, C Xu, C Zhang, J Xu… - 2022 IEEE 38th …, 2022 - ieeexplore.ieee.org
Blockchain has recently gained massive attention thanks to the success of cryptocurrencies
and decentralized applications. With immutability and tamper-resistance features, it can be …

Ligero++: A new optimized sublinear IOP

R Bhadauria, Z Fang, C Hazay… - Proceedings of the …, 2020 - dl.acm.org
This paper follows the line of works that design concretely efficient transparent sublinear
zero-knowledge Interactive Oracle Proofs (IOP). Arguments obtained via this paradigm have …