搜索结果: 1-15 共查到“密码学 Arguments”相关记录52条 . 查询时间(0.109 秒)
Succinct Arguments for Bilinear Group Arithmetic: Practical Structure-Preserving Cryptography
NIZK short proofs
font style='font-size:12px;'>
2019/8/30
In their celebrated work, Groth and Sahai [EUROCRYPT'08, SICOMP' 12] constructed non-interactive zero-knowledge (NIZK) proofs for general bilinear group arithmetic relations, which spawned the entire ...
Non-malleable Zero-Knowledge Arguments with Lower Round Complexity
Zero-Knowledge Non-Malleable Multi-Collision Resistance
font style='font-size:12px;'>
2019/8/30
Round complexity is one of the fundamental problems in zero-knowledge proof systems. Non-malleable zero-knowledge (NMZK) protocols are zero-knowledge protocols that provide security even when man-in-t...
PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge
zk-SNARKs SRS
font style='font-size:12px;'>
2019/8/22
zk-SNARK constructions that utilize an updatable universal structured reference string remove one of the main obstacles in deploying zk-SNARKs [GKMMM, Crypto 2018]. The important work of Maller et al....
Efficient zero-knowledge arguments in the discrete log setting, revisited
zero-knowledge argument quadratic equations arithmetic circuit satisfiability
font style='font-size:12px;'>
2019/8/20
This work revisits zero-knowledge proofs in the discrete logarithm setting. First, we identify and carve out basic techniques (partly being used implicitly before) to optimize proofs in this setting. ...
Succinct Arguments in the Quantum Random Oracle Model
succinct arguments quantum random oracle model probabilistically checkable proofs
font style='font-size:12px;'>
2019/7/22
Succinct non-interactive arguments (SNARGs) are highly efficient certificates of membership in non-deterministic languages. Constructions of SNARGs in the random oracle model are widely believed to be...
Statistical Zap Arguments from Quasi-Polynomial LWE
ZAPs interactive proofs argument
font style='font-size:12px;'>
2019/7/22
We give the first construction of statistical Zaps. Our construction satisfies computational soundness and relies on the quasi-polynomial hardness of learning with errors assumpteprint.iacr.orgion.
Statistical ZAP Arguments
cryptographic protocols Witness Indistinguishability
font style='font-size:12px;'>
2019/7/10
Dwork and Naor (FOCS'00) first introduced and constructed two message public coin witness indistinguishable proofs (ZAPs) for NP based on trapdoor permutations. Since then, ZAPs have also been obtaine...
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
Lattice Zero-Knowledge Argument
font style='font-size:12px;'>
2019/6/26
We provide new zero-knowledge argument of knowledge systems that work directly for a wide class of language, namely, ones involving the satisfiability of matrix-vector relations and integer relations ...
Black-Box Language Extension of Non-Interactive Zero-Knowledge Arguments
NIZK USS-NIZK black-box construction
font style='font-size:12px;'>
2019/6/13
Highly efficient non-interactive zero-knowledge arguments (NIZK) are often constructed for limited languages and it is not known how to extend them to cover wider classes of languages in general. In t...
On Round Optimal Statistical Zero Knowledge Arguments
zero knowledge collision resistance statistically hiding commitments
font style='font-size:12px;'>
2019/6/4
We construct the first three message statistical zero knowledge arguments for all of NP, matching the known lower bound. We do so based on keyless multi-collision resistant hash functions and other st...
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
zero-knowledge lattice cryptography MPC
font style='font-size:12px;'>
2019/5/23
In this work we present a new interactive Zero-Knowledge Argument of knowledge for general arithmetic circuits. Our protocol is based on the ``MPC-in-the-head''-paradigm of Ishai et al. (STOC 2009) an...
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments
parallel repetition interactive argument smooth KL-divergence
font style='font-size:12px;'>
2019/4/22
Soundness amplification is a central problem in the study of interactive protocols. While ``natural'' parallel repetition transformation is known to reduce the soundness error of some special cases of...
Classical zero-knowledge arguments for quantum computations
zero knowledge quantum computation
font style='font-size:12px;'>
2019/3/1
We show that every language in BQP admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (a...
Aurora: Transparent Succinct Arguments for R1CS
zero knowledge interactive oracle proofs succinct arguments
font style='font-size:12px;'>
2018/11/16
We design, implement, and evaluate a zero knowledge succinct non-interactive argument (SNARG) for Rank-1 Constraint Satisfaction (R1CS), a widely-deployed NP language undergoing standardization. Our S...
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
One-way permutations zero-knowledge arguments black-box constructions
font style='font-size:12px;'>
2018/11/8
In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for an...