搜索结果: 1-5 共查到“军事学 noninteractive zero knowledge”相关记录5条 . 查询时间(0.073 秒)
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...
Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors
noninteractive zero knowledge correlation intractability learning with errors
2019/2/25
We finally close the long-standing problem of constructing a noninteractive zero-knowledge (NIZK) proof system for any NP language with security based on the plain Learning With Errors (LWE) problem, ...
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
cryptography computational complexity noninteractive zero-knowledge proofs
2009/6/2
We show that interactive and noninteractive zero-knowledge are equivalent in the `help
model' of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference
string is generated b...
Interactive and Noninteractive Zero Knowledge Coincide in the Help Model
cryptography computational complexity noninteractive zero-knowledge proofs
2008/5/26
We show that a problem in AM has a interactive zero-knowledge proof system if and only if it
has a noninteractive zero knowledge proof system in the ‘help model’ of Ben-Or and Gutfreund
(J. Cryptolo...
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
cryptography computational complexity noninteractive zero-knowledge proofs
2008/5/20
We show that interactive and noninteractive zero-knowledge are equivalent in the `help
model' of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference
string is generated b...