Adaptively secure MPC with sublinear communication complexity
A central challenge in the study of MPC is to balance between security guarantees,
hardness assumptions, and resources required for the protocol. In this work, we study the …
hardness assumptions, and resources required for the protocol. In this work, we study the …
Broadcast-optimal two-round MPC
An intensive effort by the cryptographic community to minimize the round complexity of
secure multi-party computation (MPC) has recently led to optimal two-round protocols from …
secure multi-party computation (MPC) has recently led to optimal two-round protocols from …
MPC with friends and foes
Classical definitions for secure multiparty computation assume the existence of a single
adversarial entity controlling the set of corrupted parties. Intuitively, the definition requires …
adversarial entity controlling the set of corrupted parties. Intuitively, the definition requires …
Efficient and round-optimal oblivious transfer and commitment with adaptive security
We construct the most efficient two-round adaptively secure bit-OT in the Common Random
String (CRS CRS) model. The scheme is UC secure under the Decisional Diffie-Hellman …
String (CRS CRS) model. The scheme is UC secure under the Decisional Diffie-Hellman …
[图书][B] Advances in Cryptology–ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore …
M Tibouchi, H Wang - 2021 - books.google.com
The four-volume proceedings LNCS 13090, 13091, 13092, and 13093 constitutes the
proceedings of the 27th International Conference on the Theory and Application of …
proceedings of the 27th International Conference on the Theory and Application of …
Reverse firewalls for adaptively secure MPC without setup
We study Multi-party computation (MPC) in the setting of subversion, where the adversary
tampers with the machines of honest parties. Our goal is to construct actively secure MPC …
tampers with the machines of honest parties. Our goal is to construct actively secure MPC …
Two-round adaptively secure MPC from isogenies, LPN, or CDH
N Alamati, H Montgomery, S Patranabis… - … Conference on the Theory …, 2021 - Springer
We present a new framework for building round-optimal (two-round) adaptively secure MPC.
We show that a relatively weak notion of OT that we call indistinguishability OT with receiver …
We show that a relatively weak notion of OT that we call indistinguishability OT with receiver …
Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
We present simpler and improved constructions of 2-round protocols for secure multi-party
computation (MPC) in the semi-honest setting. Our main results are new information …
computation (MPC) in the semi-honest setting. Our main results are new information …
Is information-theoretic topology-hiding computation possible?
Topology-hiding computation (THC) is a form of multi-party computation over an incomplete
communication graph that maintains the privacy of the underlying graph topology. Existing …
communication graph that maintains the privacy of the underlying graph topology. Existing …
On the round complexity of fully secure solitary MPC with honest majority
We study the problem of secure multiparty computation for functionalities where only one
party receives the output, to which we refer as solitary MPC. Recently, Halevi et al.(TCC …
party receives the output, to which we refer as solitary MPC. Recently, Halevi et al.(TCC …