搜索结果: 1-2 共查到“军事学 Hunting”相关记录2条 . 查询时间(0.062 秒)
Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs
public-key cryptography verifiable random functions
2019/1/18
A verifiable random function (VRF) is a pseudorandom function, where outputs can be publicly verified. That is, given an output value together with a proof, one can check that the function was indeed ...
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationallysound
proofs where the verifier’s work is essentially independent of the complexity of the NP nondeter...