搜索结果: 61-75 共查到“军事学 zero knowledge”相关记录198条 . 查询时间(0.031 秒)
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability
Zero-knowledge arithmetic circuit ideal linear commitments
2017/9/14
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfiability over a large field. For a circuit with N addition and multiplication gates, the prover only u...
Zero-Knowledge Password Policy Check from Lattices
zero-knowledge password policy check set membership proof lattice-based cryptography
2017/9/13
Passwords are ubiquitous and most commonly used to authenticate users when logging into online services. Using high entropy passwords is critical to prevent unauthorized access and password policies e...
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 ...
At Asiacrypt 2016 Bellare, Fuchsbauer and Scafuro introduced the notion of subversion zero knowledge for non-interactive proof systems, demanding that zero knowledge (ZK) is maintained even when the c...
Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services
fair exchange Bitcoin zero knowledge
2017/6/15
Zero Knowledge Contingent Payment (ZKCP) protocols allow fair exchange of sold goods and payments over the Bitcoin network. In this paper we point out two main shortcomings of current proposals for ZK...
Partially Splitting Rings for Faster Lattice-Based Zero-Knowledge Proofs
Lattice cryptography Zero-Knowledge Proofs Ring-LWE
2017/6/6
In this work we show that one can use the optimal challenge sets CC and still have the polynomial Xn+1Xn+1 split into more than two factors. For the most common parameters that are used in such zero-k...
Since its introduction the UC framework by Canetti has received a lot of attention. A contributing factor to its popularity is that it allows to capture a large number of common cryptographic primitiv...
A Zero Knowledge Sumcheck and its Applications
zero knowledge sumcheck algebraic query complexity
2017/4/11
Many seminal results in Interactive Proofs (IPs) use algebraic techniques based on low-degree polynomials, the study of which is pervasive in theoretical computer science. Unfortunately, known methods...
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
post-quantum cryptography zero-knowledge signatures
2017/3/31
In our signature constructions, the public key is an image y=f(x) of a one-way function f and secret key x. A signature is a non-interactive zero-knowledge proof of x, that incorporates a message to b...
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
Probabilistically Checkable Proofs Zero-Knowledge Verifiable Secret Sharing
2017/2/28
A probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form "x∈Lx∈L" by querying only fe...
Zero-knowledge proxy re-identification (ZK-PRI) has been introduced by Blaze et al. in 1998 together with two other well known primitives of recryptography, namely proxy re-encryption (PRE) and proxy ...
Interactive proofs of proximity (Ergun, Kumar and Rubinfeld, Information & Computation, 2004 and Rothblum, Vadhan and Wigderson, STOC 2013), or IPPs, are interactive proofs in which the verifier runs ...
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...
Generic Zero-Knowledge and Multivariate Quadratic Systems
zero-knowledge proof post-quantum signature
2016/12/29
Zero-knowledge proofs are a core building block for a broad range of cryptographic protocols. This paper introduces a generic zero-knowledge proof system capable of proving the correct computation of ...
Key-Homomorphic Signatures and Applications to Multiparty Signatures and Non-Interactive Zero-Knowledge
key-homomorphic signatures ring signatures (universal) designated verifier signatures
2016/12/10
Key-homomorphic properties of cryptographic objects have proven to be useful, both from a theoretical as well as a practical perspective. Important cryptographic objects such as pseudorandom functions...