animated
发表于 2025-3-26 23:17:23
Marius Cristian Butea-Bocu,Oliver Brock,Ullrich Otton the two-party case (.). We tackle this question in the general case of PSM protocols for . parties. Our motivation is two-fold: On one hand, there are various applications (old and new) of PSM protocols for constructing other cryptographic primitives, where obtaining more efficient PSM protocols i
小隔间
发表于 2025-3-27 03:28:03
http://reply.papertrans.cn/95/9444/944360/944360_32.png
薄荷醇
发表于 2025-3-27 08:59:07
http://reply.papertrans.cn/95/9444/944360/944360_33.png
accordance
发表于 2025-3-27 11:08:47
Ingo Kausch von Schmeling,Markus Hohenfellner,Joachim Böckmann including succinct secure computation, private manipulation of remote databases, and more. While HSS can be viewed as a relaxation of S/FHE, the only constructions from lattice-based assumptions to date build . specific forms of threshold or multi-key S/FHE. In this work, we present new techniques
云状
发表于 2025-3-27 14:59:23
Michèle J. Hoffmann,Helge Taubert,Kerstin Junkerwithout rewinding) black-box reduction needs memory which grows linearly with the number of queries of the adversary it has access to, as long as this reduction treats the underlying group generically. This makes progress towards proving a conjecture by Auerbach . (CRYPTO 2017), and is also the firs
medieval
发表于 2025-3-27 21:35:57
André Scherag,Herbert Hirche,Claudia Ose,Markus Neuhäuser,Karl-Heinz Jöckelobes, the classical ISW countermeasure requires . random bits, where . is the circuit size. However running a True Random Number Generator (TRNG) can be costly in practice and become a bottleneck on embedded devices. In [.] the authors introduced the notion of . pseudo-random number generator (PRG),
激怒
发表于 2025-3-27 22:18:33
http://reply.papertrans.cn/95/9444/944360/944360_37.png
高贵领导
发表于 2025-3-28 02:25:22
http://reply.papertrans.cn/95/9444/944360/944360_38.png
危机
发表于 2025-3-28 06:16:13
Jörg Stattaus,Michael Forsting,Axel Wetterther one can prove that . instances . all belong to . with a statistical zero-knowledge proof whose communication complexity is better than . (which is the complexity of the trivial solution of executing the original protocol independently on each input)..In a recent work, Kaslasi . (TCC, 2020) cons
轻率看法
发表于 2025-3-28 13:50:12
http://reply.papertrans.cn/95/9444/944360/944360_40.png