搜索结果: 1-11 共查到“密码学 zero knowledge proof”相关记录11条 . 查询时间(0.093 秒)
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...
Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems
snark stark bulletproofs
2019/5/13
The area of practical proof systems, like SNARKs, STARKs, or Bulletproofs, is seeing a very dynamic development. Many use-cases of such systems involve, often as their most expensive apart, proving th...
Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems
snark stark bulletproofs
2019/5/13
The area of practical proof systems, like SNARKs, STARKs, or Bulletproofs, is seeing a very dynamic development. Many use-cases of such systems involve, often as their most expensive apart, proving th...
DIZK: A Distributed Zero Knowledge Proof System
zero knowledge proofs cluster computing SNARKs
2018/7/20
Recently there has been much academic and industrial interest in practical implementations of *zero knowledge proofs*. These techniques allow a party to *prove* to another party that a given statement...
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 ...
Zero-Knowledge Proof of Decryption for FHE Ciphertexts
zero knowledge fully homomorphic encryption verifiable decryption
2018/1/11
Zero-knowledge proofs of knowledge and fully-homomorphic encryption are two areas that have seen considerable advances in recent years, and these two techniques are used in conjunction in the context ...
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...
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
zero knowledge garbled circuits anonymous credentials
2016/6/7
Practical anonymous credential systems are generally built around
sigma-protocol ZK proofs. This requires that credentials be based on specially
formed signatures. Here we ask whether we can instead...
Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof
quantum bit commitment quantum zero-knowledge unconditional study
2016/1/6
Watrous (STOC 2006) proved that plugging classical bit commitment scheme that is secure
against quantum attack into the GMW-type construction of zero-knowledge gives a classical
zero-knowledge proof...
A New Scheme for Zero Knowledge Proof based on Multivariate Quadratic Problem and Quaternion Algebra
Multivariate Quadratic Quaternion Zero Knowledge Proof Authentication
2010/2/20
This paper introduces a new intractable security problem whose
intractability is due to the NP completeness of multivariate quadratic problem. This
novel problem uses quaternion algebra in conjuncti...
The Statistical Zero-knowledge Proof for Blum Integer Based on Discrete Logarithm
cryptography Blum integer statistical zero-knowledge
2009/4/10
Blum integers (BL), which has extensively been used in the domain
of cryptography, are integers with form pk1qk2 , where p and q are
di®erent primes both ´ 3 mod 4 and k1 and k2 are odd in...