搜索结果: 1-15 共查到“军队指挥学 zero knowledge”相关记录198条 . 查询时间(0.171 秒)
There Are 10 Types of Vectors (and Polynomials): Efficient Zero-Knowledge Proofs of "One-Hotness" via Polynomials with One Zero
Zero-knowledge efficiency privacy-preserving protocols
2019/8/30
We present a new 4-move special honest-verifier zero-knowledge proof of knowledge system for proving that a vector of Pedersen commitments opens to a so-called "one-hot" vector (i.e., to a vector from...
A hash function family is called correlation intractable if for all sparse relations, it hard to find, given a random function from the family, an input output pair that satisfies the relation. Correl...
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...
WI Is Not Enough: Zero-Knowledge Contingent (Service) Payments Revisited
ZK contingent payments Bitcoin zkSNARKs
2019/8/27
While fair exchange of goods is known to be impossible without assuming a trusted party, smart contracts in cryptocurrencies forgo such parties by assuming trust in the currency system. They allow a s...
Non-Interactive Zero Knowledge Proofs in the Random Oracle Model
FS transform NIZK random oracle model
2019/8/22
The Fiat-Shamir (FS) transform is a well known and widely used technique to convert any constant-round public-coin honest-verifier zero-knowledge (HVZK) proof or argument system CIPC=(Prov,Ver)CIPC=(P...
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. ...
Improvements in Everlasting Privacy: Efficient and Secure Zero Knowledge Proofs
Voting Everlasting Privacy Zero Knowledge Proofs
2019/8/8
Verifiable electronic voting promises to ensure the correctness of elections even in the presence of a corrupt authority, while providing strong privacy guarantees. However, few practical systems with...
The foundation of zero-knowledge is the simulator: a weak machine capable of pretending to be a weak verifier talking with all-powerful provers. To achieve this, simulators need some kind of advantage...
Efficient Perfectly Sound One-message Zero-Knowledge Proofs via Oracle-aided Simulation
zero-knowledge NIZK RSA ZAP
2019/6/26
In this paper we put forth new one-message proof systems for several practical applications, like proving that an El Gamal ciphertext (over a multiplicative group) decrypts to a given value and correc...
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...
Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-
Blockchain Digital Signatures Zero-knowledge Proofs
2019/6/5
Timestamping is an important cryptographic primitive with numerous applications. The availability of a decentralized blockchain such as that offered by the Bitcoin protocol offers new possibilities to...
Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge
NIZK Security Amplification
2019/6/4
We develop novel techniques to leverage the use of leakage simulation lemma (Jetchev-Peitzrak TCC 2014) to argue amplification. A crucial component of our result is a new notion for secret sharing NPN...
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge
non-uniform certificates concurrent zero-knowledge
2019/6/4
We introduce the notion of non-uniformly sound certificates: succinct single-message (unidirectional) argument systems that satisfy a ``best-possible security'' against non-uniform polynomial-time att...
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...