collagen 发表于 2025-3-26 23:47:15
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting978-0-230-30780-3猛然一拉 发表于 2025-3-27 04:05:59
Impossibility of Black-Box Simulation Against Leakage Attacks978-1-137-55033-0acrimony 发表于 2025-3-27 05:38:43
(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond978-3-031-65786-3BAN 发表于 2025-3-27 11:48:32
http://reply.papertrans.cn/15/1475/147471/147471_34.png保留 发表于 2025-3-27 15:25:01
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assu978-1-4899-7096-1crucial 发表于 2025-3-27 21:29:23
Nina Oelkers,Hans-Uwe Otto,Holger Zieglertwo-party and multiparty computation tasks. Many of the complications of the UC framework exist in order to enable more general tasks than classic secure computation. This generality may be a barrier to entry for those who are used to the stand-alone model of secure computation and wish to work withFlu表流动 发表于 2025-3-27 22:39:44
http://reply.papertrans.cn/15/1475/147471/147471_37.pngextemporaneous 发表于 2025-3-28 04:10:03
Harry Brighouse,Elaine Unterhalterere the simulator is allowed to query the ideal functionality . (as opposed to just once in the standard definition). The model provides a quantitative measure for the degradation in security under concurrent self-composition, where the degradation is measured by the number of ideal queries. Howeverappall 发表于 2025-3-28 06:33:23
http://reply.papertrans.cn/15/1475/147471/147471_39.png受辱 发表于 2025-3-28 13:31:40
https://doi.org/10.1007/978-3-531-90922-6ently, the first . . argument for . was constructed by Orlandi et al. (TCC’14) under the DDH assumption..In this paper, we construct a statistical . argument for . .. The security is proven via black-box simulation, and the round complexity is .. Under the existence of collision-resistant hash funct