Trusted academic transcripts on the blockchain: A systematic literature review

G Caldarelli, J Ellul - Applied Sciences, 2021 - mdpi.com
Much of the excitement around blockchain is mainly due to promising applications in the
financial sector. However, many also believe in the technology's potential to disrupt non …

Orion: Zero knowledge proof with linear prover time

T Xie, Y Zhang, D Song - Annual International Cryptology Conference, 2022 - Springer
Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

Spartan: Efficient and general-purpose zkSNARKs without trusted setup

S Setty - Annual International Cryptology Conference, 2020 - Springer
This paper introduces Spartan, a new family of zero-knowledge succinct non-interactive
arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …

Doubly-efficient zkSNARKs without trusted setup

RS Wahby, I Tzialla, A Shelat, J Thaler… - … IEEE Symposium on …, 2018 - ieeexplore.ieee.org
We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …

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 …

Mystique: Efficient conversions for {Zero-Knowledge} proofs with applications to machine learning

C Weng, K Yang, X Xie, J Katz, X Wang - 30th USENIX Security …, 2021 - usenix.org
Recent progress in interactive zero-knowledge (ZK) proofs has improved the efficiency of
proving large-scale computations significantly. Nevertheless, real-life applications (eg, in the …

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 …

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 …

vSQL: Verifying arbitrary SQL queries over dynamic outsourced databases

Y Zhang, D Genkin, J Katz… - … IEEE Symposium on …, 2017 - ieeexplore.ieee.org
Cloud database systems such as Amazon RDS or Google Cloud SQLenable the
outsourcing of a large database to a server who then responds to SQL queries. A natural …

Betrayal, distrust, and rationality: Smart counter-collusion contracts for verifiable cloud computing

C Dong, Y Wang, A Aldweesh, P McCorry… - Proceedings of the …, 2017 - dl.acm.org
Cloud computing has become an irreversible trend. Together comes the pressing need for
verifiability, to assure the client the correctness of computation outsourced to the cloud …