A survey on exotic signatures for post-quantum blockchain: Challenges and research directions
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 …
utilizing a wide range of cryptographic tools. In this article, we survey the existing literature …
A pragmatic introduction to secure multi-party computation
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 …
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 …
addressing privacy and scalability concerns in a variety of applications. In many systems …
The SPHINCS+ Signature Framework
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 …
significant advantages over the state of the art in terms of speed, signature size, and …
Orion: Zero knowledge proof with linear prover time
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 …
applications in the real world. However, existing schemes with succinct proof size suffer from …
Ligero: Lightweight sublinear arguments without a trusted setup
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 …
communication complexity is proportional to the square-root of the verification circuit size …
Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
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 …
arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …
Post-quantum cryptography research landscape: a scientometric perspective
Post-quantum cryptography (PQC) is under development to guard against the threats of
quantum computers by implementing a new class of cryptosystems. In this direction, much …
quantum computers by implementing a new class of cryptosystems. In this direction, much …
Doubly-efficient zkSNARKs without trusted setup
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 …
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …