Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A survey on zero-knowledge authentication for internet of things
Z Chen, Y Jiang, X Song, L Chen - Electronics, 2023 - mdpi.com
The Internet of Things (IoT) is ubiquitous in our lives. However, the inherent vulnerability of
IoT smart devices can lead to the destruction of networks in untrustworthy environments …
IoT smart devices can lead to the destruction of networks in untrustworthy environments …
{ACORN}: input validation for secure aggregation
J Bell, A Gascón, T Lepoint, B Li, S Meiklejohn… - 32nd USENIX Security …, 2023 - usenix.org
Secure aggregation enables a server to learn the sum of client-held vectors in a privacy-
preserving way, and has been applied to distributed statistical analysis and machine …
preserving way, and has been applied to distributed statistical analysis and machine …
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 …
LaBRADOR: compact proofs for R1CS from module-SIS
W Beullens, G Seiler - Annual International Cryptology Conference, 2023 - Springer
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 …
Lattice-based succinct arguments from vanishing polynomials
V Cini, RWF Lai, G Malavolta - Annual International Cryptology …, 2023 - Springer
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 …
A framework for practical anonymous credentials from lattices
J Bootle, V Lyubashevsky, NK Nguyen… - Annual International …, 2023 - Springer
We present a framework for building practical anonymous credential schemes based on the
hardness of lattice problems. The running time of the prover and verifier is independent of …
hardness of lattice problems. The running time of the prover and verifier is independent of …
Latticefold: A lattice-based folding scheme and its applications to succinct proof systems
Folding is a recent technique for building efficient recursive SNARKs. Several elegant
folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and …
folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and …
A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
R del Pino, S Katsumata - Annual International Cryptology Conference, 2022 - Springer
Blind signatures, proposed by Chaum (CRYPTO'82), are interactive protocols between a
signer and a user, where a user can obtain a signature without revealing the message to be …
signer and a user, where a user can obtain a signature without revealing the message to be …
Crypto dark matter on the torus: Oblivious prfs from shallow prfs and tfhe
MR Albrecht, A Davidson, A Deo… - … Conference on the Theory …, 2024 - Springer
Abstract Partially Oblivious Pseudorandom Functions (POPRFs) are 2-party protocols that
allow a client to learn pseudorandom function (PRF) evaluations on inputs of its choice from …
allow a client to learn pseudorandom function (PRF) evaluations on inputs of its choice from …
Functional commitments for all functions, with transparent setup and from SIS
L de Castro, C Peikert - Annual International Conference on the Theory …, 2023 - Springer
A functional commitment scheme enables a user to concisely commit to a function from a
specified family, then later concisely and verifiably reveal values of the function at desired …
specified family, then later concisely and verifiably reveal values of the function at desired …