flimsy
发表于 2025-3-30 10:20:37
Black-Box Constructions of Bounded-Concurrent Secure Computation security guarantees..Our protocol has a constant number of rounds and relies on standard polynomial-hardness assumptions, namely, the existence of semi-honest oblivious transfers and collision-resistant hash functions. Previously, such protocols were not known even under sub-exponential assumptions.
aspersion
发表于 2025-3-30 15:58:13
0302-9743 ns; symmetric crypto; theory and lower bounds ; zero-knowledge. .*The conference was held virtually due to the COVID-19 pandemic..978-3-030-57989-0978-3-030-57990-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
结果
发表于 2025-3-30 19:17:10
http://reply.papertrans.cn/87/8635/863450/863450_53.png
Emg827
发表于 2025-3-30 22:55:53
http://reply.papertrans.cn/87/8635/863450/863450_54.png
谷类
发表于 2025-3-31 01:17:12
http://reply.papertrans.cn/87/8635/863450/863450_55.png
Externalize
发表于 2025-3-31 07:25:40
978-3-030-57989-0Springer Nature Switzerland AG 2020
晚来的提名
发表于 2025-3-31 09:59:24
Security and Cryptography for Networks978-3-030-57990-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
朦胧
发表于 2025-3-31 15:17:28
http://reply.papertrans.cn/87/8635/863450/863450_58.png