activity
20122026
collaborators

6 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.CL2025

Token-Level Privacy in Large Language Models

Re'em Harel, Niv Gilboa, Yuval Pinter

The use of language models as remote services requires transmitting private information to external providers, raising significant privacy concerns. This process not only risks exp…

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.CR2019

Cross-Router Covert Channels

Adar Ovadya, Rom Ogen, Yakov Mallah +2

Many organizations protect secure networked devices from non-secure networked devices by assigning each class of devices to a different logical network. These two logical networks,…

cs.DC2012

Efficient Private Distributed Computation on Unbounded Input Streams

Shlomi Dolev, Juan Garay, Niv Gilboa +2

In the problem of swarm computing, agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of s…