A survey on exotic signatures for post-quantum blockchain: Challenges and research directions

M Buser, R Dowsley, M Esgin, C Gritti… - ACM Computing …, 2023 - dl.acm.org
Blockchain technology provides efficient and secure solutions to various online activities by
utilizing a wide range of cryptographic tools. In this article, we survey the existing literature …

The SPHINCS+ Signature Framework

DJ Bernstein, A Hülsing, S Kölbl… - Proceedings of the …, 2019 - dl.acm.org
We introduce SPHINCS+, a stateless hash-based signature framework. SPHINCS+ has
significant advantages over the state of the art in terms of speed, signature size, and …

Orion: Zero knowledge proof with linear prover time

T **e, 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 …

A pragmatic introduction to secure multi-party computation

D Evans, V Kolesnikov, M Rosulek - Foundations and Trends® …, 2018 - nowpublishers.com
Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …

Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings

M Maller, S Bowe, M Kohlweiss… - Proceedings of the 2019 …, 2019 - dl.acm.org
Ever since their introduction, zero-knowledge proofs have become an important tool for
addressing privacy and scalability concerns in a variety of applications. In many systems …

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 …

Ligero: Lightweight sublinear arguments without a trusted setup

S Ames, C Hazay, Y Ishai… - Proceedings of the 2017 …, 2017 - dl.acm.org
We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …

Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head

C Baum, L Braun, CD de Saint Guilhem… - Annual International …, 2023 - Springer
We present a new method for transforming zero-knowledge protocols in the designated
verifier setting into public-coin protocols, which can be made non-interactive and publicly …

Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation

T **e, 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 **e, 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 …