搜索结果: 1-2 共查到“密码学 switching lemma”相关记录2条 . 查询时间(0.052 秒)
Switching Lemma for Bilinear Tests and Constant-size NIZK Proofs for Linear Subspaces
bilinear pairings quasi-adaptive
2014/3/6
We state a switching lemma for tests on adversarial inputs involving bilinear pairings in hard groups, where the tester can effectively switch the randomness used in the test from being given to the a...
In Eurocrypt 2006, Bellare and Rogaway [2] gave a proof of
the PRP/PRF switching Lemma using their game-based proof technique.
In the appendix of the same paper, they also gave an proof without
gam...