搜索结果: 1-15 共查到“军队指挥学 zero-knowledge arguments”相关记录25条 . 查询时间(0.062 秒)
Non-malleable Zero-Knowledge Arguments with Lower Round Complexity
Zero-Knowledge Non-Malleable Multi-Collision Resistance
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...
Efficient zero-knowledge arguments in the discrete log setting, revisited
zero-knowledge argument quadratic equations arithmetic circuit satisfiability
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. ...
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
Lattice Zero-Knowledge Argument
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
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
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
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...
Classical zero-knowledge arguments for quantum computations
zero knowledge quantum computation
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...
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
One-way permutations zero-knowledge arguments black-box constructions
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...
Lattice-Based Zero-Knowledge Arguments for Integer Relations
Lattice-based cryptography zero-knowledge arguments integer relations
2018/8/2
We provide lattice-based protocols allowing to prove relations among committed integers. While the most general zero-knowledge proof techniques can handle arithmetic circuits in the lattice setting, a...
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
Zero-Knowledge Arithmetic Circuits Sub-linear proofs
2018/6/5
We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic circuit satisfiability over a prime pp whose security is based on the hardness of the short integer...
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials
Sigma-protocol zero-knowledge argument batch-verification
2018/1/11
The work of Bootle et al. (EUROCRYPT 2016) constructs an extremely efficient zero-knowledge argument for arithmetic circuit satisfiability in the discrete logarithm setting. However, the argument does...
Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash
Lattices pseudo-random functions zero-knowledge arguments
2017/9/13
Beyond their security guarantees under well-studied assumptions, algebraic pseudo-random functions are motivated by their compatibility with efficient zero-knowledge proof systems, which is useful in ...
We describe a new succinct zero-knowledge argument protocol with the following properties. The prover commits to a large data-set MM, and can thereafter prove many statements of the form ∃w:Ri(M...
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
Lattices zero-knowledge proofs group encryption anonymity
2016/12/9
Group encryption (GE) is the natural encryption analogue of group signatures in that it allows verifiably encrypting messages for some anonymous member of a group while providing evidence that the rec...
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Sigma-protocol zero-knowledge argument arithmetic circuit
2016/3/9
We provide a zero-knowledge argument for arithmetic circuit
satisfiability with a communication complexity that grows logarithmically
in the size of the circuit. The round complexity is also logarit...
