Adaptively Secure Multi-party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries (i.e., adversaries that may choose the corrupted parties during the course of the computation), in a setting where the channels are insecure and secur
Main Authors: | Canetti, Ran, Feige, Uri, Goldreich, Oded, Naor, Moni |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149820 |
Similar Items
-
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
by: Canetti, Ran, et al.
Published: (2021) -
Communication Locality in Secure Multi-party Computation
by: Boyle, Elette Chantae, et al.
Published: (2019) -
On the Numbers of Close-and-equal Pairs of Bits in a String (with Implications on the Security of RSA'S L.S.B.)
by: Goldreich, Oded
Published: (2023) -
RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure
by: Chor, Benny, et al.
Published: (2023) -
Multi-party quantum computation
by: Smith, Adam (Adam Davidson), 1977-
Published: (2014)