activity
20202026
most citedMust the Communication Graph of MPC Protocols be an Expander?

1 citations · 1 across the 5 of their papers we have counts for

collaborators

7 papers

cs.CR2026

Distributed Point Functions and Function Secret Sharing

Elette Boyle, Niv Gilboa, Yuval Ishai +1

A distributed point function (DPF) is a cryptographic primitive that enables compressed additive sharing of a secret weight-1 vector (equivalently, a point function) across two or…

cs.CR2026

Can Watermarking Techniques Help Prevent LLM Model Stealing?

Elette Boyle, MohammadTaghi Hajiaghayi, Keivan Rezaei +2

Model stealing attacks have recently been introduced, enabling the extraction of precise information from black-box commercial language models. In this work, we propose defense met…

cs.CR2023

Communication Lower Bounds for Cryptographic Broadcast Protocols

Erica Blum, Elette Boyle, Ran Cohen +1

Broadcast protocols enable a set of parties to agree on the input of a designated sender, even facing attacks by malicious parties. In the honest-majority setting, randomizatio…

cs.CR2023★ 1 cited

Must the Communication Graph of MPC Protocols be an Expander?

Elette Boyle, Ran Cohen, Deepesh Data +1

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 corrupt…

cs.DS2022

Locality-Preserving Hashing for Shifts with Connections to Cryptography

Elette Boyle, Itai Dinur, Niv Gilboa +3

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 clos…

cs.CR2020

Lightweight Techniques for Private Heavy Hitters

Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs +2

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 cli…

cs.CR2020

Breaking the -Bit Barrier: Byzantine Agreement with Polylog Bits Per Party

Elette Boyle, Ran Cohen, Aarushi Goel

Byzantine agreement (BA), the task of 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…