抛媚眼
发表于 2025-3-28 18:06:30
http://reply.papertrans.cn/43/4235/423423/423423_41.png
逢迎白雪
发表于 2025-3-28 21:57:42
http://reply.papertrans.cn/43/4235/423423/423423_42.png
reception
发表于 2025-3-28 23:15:25
http://reply.papertrans.cn/43/4235/423423/423423_43.png
专横
发表于 2025-3-29 06:36:23
http://reply.papertrans.cn/43/4235/423423/423423_44.png
失望昨天
发表于 2025-3-29 07:13:26
http://reply.papertrans.cn/43/4235/423423/423423_45.png
男学院
发表于 2025-3-29 12:39:29
http://reply.papertrans.cn/43/4235/423423/423423_46.png
chronology
发表于 2025-3-29 17:54:45
http://reply.papertrans.cn/43/4235/423423/423423_47.png
Acetaminophen
发表于 2025-3-29 21:25:27
-party tasks. Along the way we establish a communication complexity lower bound for set-intersection for cryptographically relevant ranges of parameters and distributions and where set-disjointness can be easy.
leniency
发表于 2025-3-30 02:14:58
SW assumptions, are equivalent to the Discrete Logarithm (DLog) assumption in the AGM. On the more practical side, we prove tight security reductions for two important schemes in the AGM to DLog or a variant thereof: the BLS signature scheme and Groth’s zero-knowledge SNARK (EUROCRYPT 2016), which i
delegate
发表于 2025-3-30 06:25:26
http://reply.papertrans.cn/43/4235/423423/423423_50.png