Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
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 …
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 …
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
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 …
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 …
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 …
Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head
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 …
verifier setting into public-coin protocols, which can be made non-interactive and publicly …
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
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 …
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
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 …
proving large-scale computations significantly. Nevertheless, real-life applications (eg, in the …