搜索结果: 1-2 共查到“军事学 progression-free sets”相关记录2条 . 查询时间(0.093 秒)
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Bilinear pairings circuit satisfiability non-interactive zero-knowledge progression-free sets
2011/1/12
In 2010, Groth constructed a non-interactive zero-knowledge (NIZK) argument for circuit satisfiability with communication $\Theta (1)$, verifier's computation $\Theta (|C|)$, and common reference stri...
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Additive combinatorics bilinear pairings circuit satisfiability non-interactive zero-knowledge progression-free sets
2012/3/30
In 2010, Groth constructed the only previously known sublinear-communication NIZK circuit satisfiability argument in the common reference string model. We optimize Groth's argument by, in particular, ...