一起
发表于 2025-3-30 11:09:07
From Fairness to Full Security in Multiparty Computationexity has a super-logarithmic dependency on the number of parties, improving over the protocol of Beimel, Omri, and Orlov (Crypto 2010) that has a linear dependency. A second application is a new fully secure protocol for computing the Boolean OR function, with a super-constant round complexity, imp
使出神
发表于 2025-3-30 15:19:01
Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filtersides semi-honest security. The second construction provides (the slightly weaker) augmented semi-honest security, and is substantially more efficient. Furthermore, in the augmented semi-honest protocol all heavy computations can be performed ahead of time, in an offline phase, before the parties eve