搜索结果: 1-15 共查到“军事学 non-interactive zero knowledge”相关记录22条 . 查询时间(0.164 秒)
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...
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...
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...
Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains without Trusted Setup
public-key cryptography zero knowledge
2019/1/26
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while efficient zero-knowledge proofs of algebraic statements have existed for decades, a natural challenge aros...
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE
NIZK LWE
2019/1/4
We construct non-interactive zero-knowledge (NIZK) arguments for NPNP from any circular-secure fully homomorphic encryption (FHE) scheme. In particular, we obtain such NIZKs under a circular-secure va...
Non-Interactive Zero-Knowledge Proofs for Composite Statements
Non-interactive zero-knowledge sigma protocols SNARK
2018/6/5
The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for proving algebraic statements while...
Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
zero-knowledge proofs signatures
2018/5/28
Recent work, including ZKBoo, ZKB++, and Ligero, has developed efficient non-interactive zero-knowledge proofs of knowledge (NIZKPoKs) for arbitrary Boolean circuits based on symmetric- key primitives...
A Note On Groth-Ostrovsky-Sahai Non-Interactive Zero-Knowledge Proof System
Non-interactive zero-knowledge proof bilinear groups with composite order subgroup decision problem
2018/4/10
In 2006, Groth, Ostrovsky and Sahai designed one non-interactive zero-knowledge (NIZK) proof system [new version, J. ACM, 59(3), 1-35, 2012] for plaintext being zero or one using bilinear groups with ...
Non-interactive zero-knowledge (NIZK) is a fundamental primitive that is widely used in the construction of cryptographic schemes and protocols. Despite this, general purpose constructions of NIZK pro...
Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge
Zero-knowledge proofs, Non-interactive proofs
2017/10/30
We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge proofs (DVNIZK) for a wide class of algebraic languages over abelian groups, under standard assumpt...
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...
Efficient Non-Interactive Zero Knowledge Arguments for Set Operations
Multisets non-interactive zero knowledge set operation arguments
2016/1/26
We propose a non-interactive zero knowledge pairwise multiset sum equality test (PMSET)
argument in the common reference string (CRS) model that allows a prover to show that the given
committed mult...
Non-interactive zero-knowledge proofs in the quantum random oracle model
Quantum cryptography proofs of knowledge random oracles
2016/1/8
We present a construction for non-interactive zero-knowledge proofs of knowledge in the random
oracle model from general sigma-protocols. Our construction is secure against quantum adversaries.
Prio...
Non-Interactive Zero-Knowledge Proofs of Non-Membership
Zero Knowledge Witness Elimination Smooth Projective Hash Function
2016/1/4
Often, in privacy-sensitive cryptographic protocols, a party commits to a secret message m and later needs to prove
that m belongs to a language L or that m does not belong to L (but does not want to...
Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
Circuit-SAT linear error-correcting codes non-interactive zero knowledge polynomial algebra
2013/4/18
Recently, Gennaro, Gentry, Parno and Raykova~\cite{eprint2012:GennaroGPR} proposed an efficient non-interactive zero knowledge argument for Circuit-SAT, based on non-standard notions like conscientiou...