Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Boyle, Elette"'
Broadcast protocols enable a set of $n$ parties to agree on the input of a designated sender, even facing attacks by malicious parties. In the honest-majority setting, randomization and cryptography were harnessed to achieve low-communication broadca
Externí odkaz:
http://arxiv.org/abs/2309.01466
Publikováno v:
Journal of Cryptology 36, 20 (2023)
Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corruptions can occur dependent on its structure, and (2) Where edges in the
Externí odkaz:
http://arxiv.org/abs/2305.11428
Publikováno v:
ITCS 2022
Can we sense our location in an unfamiliar environment by taking a sublinear-size sample of our surroundings? Can we efficiently encrypt a message that only someone physically close to us can decrypt? To solve this kind of problems, we introduce and
Externí odkaz:
http://arxiv.org/abs/2201.03041
This paper presents Poplar, a new system for solving the private heavy-hitters problem. In this problem, there are many clients and a small set of data-collection servers. Each client holds a private bitstring. The servers want to recover the set of
Externí odkaz:
http://arxiv.org/abs/2012.14884
Byzantine agreement (BA), the task of $n$ parties to agree on one of their input bits in the face of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed protocols. Interestingly, in protocols with the best o
Externí odkaz:
http://arxiv.org/abs/2002.02516
Autor:
Boyle, Elette Chantae
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 263-272).
A secure multi-party computation (MPC) protocol for computing a
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 263-272).
A secure multi-party computation (MPC) protocol for computing a
Externí odkaz:
http://hdl.handle.net/1721.1/82436
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ball, Marshall, Boyle, Elette, Cohen, Ran, Kohl, Lisa, Malkin, Tal, Meyer, Pierre, Moran, Tal
Publikováno v:
Journal of Cryptology; Oct2023, Vol. 36 Issue 4, p1-83, 83p
Most recent works on cryptographic obfuscation focus on the high-end regime of obfuscating general circuits while guaranteeing computational indistinguishability between functionally equivalent circuits. Motivated by the goals of simplicity and effic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa7588cc23cf4bd2af864bf99f30edf7
A distributed point function (DPF) (Gilboa-Ishai, Eurocrypt 2014) is a cryptographic primitive that enables compressed additive secret-sharing of a secret weight-1 vector across two or more servers. DPFs support a wide range of cryptographic applicat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eee71198dd08531c27dbc5a53b6d0a5e