搜索结果: 1-3 共查到“军事学 Optimal S-box”相关记录3条 . 查询时间(0.046 秒)
Motivatedbytheoreticalandpracticalconsiderations,anim- portant line of research is to design secure computation protocols that only make black-box use of cryptography. An important component in nearly...
Round-Optimal Black-Box Two-Party Computation
Round-optimal two-party computation black-box protocols general assumptions
2015/12/29
In [Eurocrypt 2004] Katz and Ostrovsky establish the exact round complexity of secure two-party computation with respect to black-box proofs of security. They prove that 5 rounds are necessary for sec...
(Nearly) optimal black-box constructions of commitments secure against selective opening attacks
commitments black-box lower bounds zero knowledge
2009/11/18
Selective opening attacks against commitment schemes occur when the commitment
scheme is repeated in parallel (or concurrently) and an adversary can choose depending on
the commit-phase transcript t...