搜索结果: 1-15 共查到“军队指挥学 proofs”相关记录215条 . 查询时间(0.062 秒)
Local Proofs Approaching the Witness Length
PCP IOP
font style='font-size:12px;'>
2019/9/23
Interactive oracle proofs (IOPs) are a hybrid between interactive proofs and PCPs. In an IOP the prover is allowed to interact with a verifier (like in an interactive proof) by sending relatively long...
Efficient Tightly-Secure Structure-Preserving Signatures and Unbounded Simulation-Sound QA-NIZK Proofs
Structure-preserving signatures QA-NIZK simulation-soundness
font style='font-size:12px;'>
2019/9/16
We show how to construct structure-preserving signatures (SPS) and unbounded quasi-adaptive non-interactive zero-knowledge (USS QA-NIZK) proofs with a tight security reduction to simple assumptions, b...
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
font style='font-size:12px;'>
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...
Non-Interactive Zero Knowledge Proofs in the Random Oracle Model
FS transform NIZK random oracle model
font style='font-size:12px;'>
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...
Traceable and linkable ring signatures, traceable range proofs and applications on regulatable privacy-preserving blockchains
regulatable blockchain privacy preserving decentralization
font style='font-size:12px;'>
2019/8/19
Privacy protection has been extensively studied in the current blockchain research field. As representations, Monero and Zerocash have realized completely anonymous and amount-hiding transactions. How...
Improvements in Everlasting Privacy: Efficient and Secure Zero Knowledge Proofs
Voting Everlasting Privacy Zero Knowledge Proofs
font style='font-size:12px;'>
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...
Simulation-Sound Proofs for LWE and Applications to KDM-CCA2 Security
LWE standard model Naor-Yung
font style='font-size:12px;'>
2019/8/8
The Naor-Yung paradigm is a well-known technique that constructs IND-CCA2-secure encryption schemes by means of non-interactive zero-knowledge proofs satisfying a notion of simulation-soundness. Until...
Efficient Perfectly Sound One-message Zero-Knowledge Proofs via Oracle-aided Simulation
zero-knowledge NIZK RSA ZAP
font style='font-size:12px;'>
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...
Fully Homomorphic NIZK and NIWI Proofs
Non-interactive zero-knowledge (NIZK) Non-interactive witness-indistinguishability (NIWI) Homomorphism
font style='font-size:12px;'>
2019/6/21
Our first result, under the Decision Linear Assumption (DLIN), is an FH-NIZK proof system for L in the common random string model. Our more surprising second result (under a new decisional assumption ...
Decentralized Multi-authority Anonymous Authentication for Global Identities with Non-interactive Proofs
anonymous authentication attribute collusion attack
font style='font-size:12px;'>
2019/6/14
We propose a decentralized multi-authority anonymous authentication scheme in which a prover and a verifier are non-interactive. We give two security definitions; resistance against collusion attacks ...
Comparing proofs of security for lattice-based encryption
lattice-based cryptography security proofs
font style='font-size:12px;'>
2019/6/13
This paper describes the limits of various "security proofs", using 36 lattice-based KEMs as case studies. This description allows the limits to be systematically compared across these KEMs; shows tha...
Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-
Blockchain Digital Signatures Zero-knowledge Proofs
font style='font-size:12px;'>
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...
Incremental Proofs of Sequential Work
Sequential Work random oracles
font style='font-size:12px;'>
2019/6/5
A proof of sequential work allows a prover to convince a verifier that a certain amount of sequential steps have been computed. In this work we introduce the notion of incremental proofs of sequential...
Agree-and-Prove: Generalized Proofs Of Knowledge and Applications
PoK Knowledge and Applications
font style='font-size:12px;'>
2019/6/5
Proofs of knowledge (PoK) are one of the most fundamental notions in cryptography and have been used as a building block in numerous applications. The appeal of this notion is that it is parameterized...
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs
Lattices Zero-Knowledge Proofs Commitments
font style='font-size:12px;'>
2019/6/4
A key component of many lattice-based protocols is a zero-knowledge proof of knowledge of a vector s⃗ s→ with small coefficients satisfying As⃗ =u⃗ modqAs→=u→modq. While there exist ...