Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
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 …
Fiat-shamir transformation of multi-round interactive proofs
Abstract The celebrated Fiat-Shamir transformation turns any public-coin interactive proof
into a non-interactive one, which inherits the main security properties (in the random oracle …
into a non-interactive one, which inherits the main security properties (in the random oracle …
Mangrove: A scalable framework for folding-based SNARKs
We present a framework for building efficient folding-based SNARKs. First we develop a
new “uniformizing” compiler for NP statements that converts any poly-time computation to a …
new “uniformizing” compiler for NP statements that converts any poly-time computation to a …
A Compressed -Protocol Theory for Lattices
We show a lattice-based solution for commit-and-prove transparent circuit zero-knowledge
(ZK) with polylog-communication, the first not depending on PCPs. We start from …
(ZK) with polylog-communication, the first not depending on PCPs. We start from …
Proofs, arguments, and zero-knowledge
Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …
prover to provide a guarantee that it performed a requested computation correctly …
LaBRADOR: compact proofs for R1CS from module-SIS
The most compact quantum-safe proof systems for large circuits are PCP-type systems such
as Ligero, Aurora, and Shockwave, that only use weak cryptographic assumptions, namely …
as Ligero, Aurora, and Shockwave, that only use weak cryptographic assumptions, namely …
DualRing: Generic Construction of Ring Signatures with Efficient Instantiations
We introduce a novel generic ring signature construction, called DualRing, which can be
built from several canonical identification schemes (such as Schnorr identification) …
built from several canonical identification schemes (such as Schnorr identification) …
Lattice-based succinct arguments from vanishing polynomials
Succinct arguments allow a prover to convince a verifier of the validity of any statement in a
language, with minimal communication and verifier's work. Among other approaches, lattice …
language, with minimal communication and verifier's work. Among other approaches, lattice …
Rofl: Robustness of secure federated learning
Even though recent years have seen many attacks exposing severe vulnerabilities in
Federated Learning (FL), a holistic understanding of what enables these attacks and how …
Federated Learning (FL), a holistic understanding of what enables these attacks and how …
Brakedown: Linear-time and field-agnostic SNARKs for R1CS
This paper introduces a SNARK called Brakedown. Brakedown targets R1CS, a popular NP-
complete problem that generalizes circuit-satisfiability. It is the first built system that provides …
complete problem that generalizes circuit-satisfiability. It is the first built system that provides …