BLOT
发表于 2025-3-28 16:38:18
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and d on threshold constraints, but rather based on other technical or organizational characteristics. This means that the corruption patterns (and thus protection guarantees) are based on the adversary being limited by what can be captured by a .. We consider efficient secure multiparty computation (MP
Detoxification
发表于 2025-3-28 19:50:49
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWEnd a receiver inputs . and learns .(.). OLE can be used to build secret-shared multiplication, and is an essential component of many secure computation applications including general-purpose multi-party computation, private set intersection and more..In this work, we present several efficient OLE pr
少量
发表于 2025-3-29 01:01:40
Multi-clients Verifiable Computation via Conditional Disclosure of Secretshanism underlying CDS is leveraged to ensure two-clients verifiable computation, where the computation is outsourced to an external server by two clients that share the input to the function. Basing integrity on CDS enjoys several significant advantages such as non-interactivity, constant rate commu
Bureaucracy
发表于 2025-3-29 06:52:05
http://reply.papertrans.cn/87/8635/863450/863450_44.png
清楚说话
发表于 2025-3-29 11:10:30
UC-Secure OT from LWE, Revisited(LWE) with super-polynomial modulus-to-noise ratio. We do so by instantiating the dual-mode encryption framework of Peikert, Vaikuntanathan and Waters (CRYPTO’08). The resulting OT can be instantiated in either one of two modes: one providing statistical sender security, and the other statistical re
罐里有戒指
发表于 2025-3-29 14:05:06
http://reply.papertrans.cn/87/8635/863450/863450_46.png
Sinus-Node
发表于 2025-3-29 16:07:27
http://reply.papertrans.cn/87/8635/863450/863450_47.png
Duodenitis
发表于 2025-3-29 19:59:10
http://reply.papertrans.cn/87/8635/863450/863450_48.png
衰老
发表于 2025-3-30 02:21:16
Anonymity and Rewards in Peer Rating Systemsreputation server incentivise accurate ratings with a reward. However, assigning rewards becomes challenging when ratings are anonymous, since the reputation server cannot tell which peers to reward for rating accurately. To address this, we propose an anonymous peer rating system in which users can
heirloom
发表于 2025-3-30 06:11:57
http://reply.papertrans.cn/87/8635/863450/863450_50.png