Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Elette Boyle
Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism
Paper 2024/192 , Reichman University, NTT Research , Centrum Wiskunde & Informatica , Centrum Wiskunde & Informatica , Aarhus University Function secret sharing (FSS) for a class $\cal{F}$ allows to split a secret function $f \in \cal{F}$ into (succinct) secret shares $f_0,f_1$, such that for all $x\in \{0,1\}^n$ it holds $f_0(x)-f_1(x)=f(x)$.
Memory Checking Requires Logarithmic Overhead
Paper 2024/123 , Reichman University, NTT Research , Hebrew University, NTT Research , Massachusetts Institute of Technology We study the complexity of memory checkers with computational security and prove the first general tight lower bound. Memory checkers, first introduced over 30 years ago by Blum, Evans, Gemmel, Kannan, and Naor (FOCS '91, Algorithmica '94), allow a user to store and maintain a large memory on a remote and unreliable server by using small trusted local storage.
Sublinear-Communication Secure Multiparty Computation does not require FHE
Paper 2023/1802 , Reichman University, NTT Research , Université Paris Cité, CNRS, IRIF , Reichman University, Université Paris Cité, CNRS, IRIF Secure computation enables mutually distrusting parties to jointly compute a function on their secret inputs, while revealing nothing beyond the function output.
Breaking the $O(\sqrt n)$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
Paper 2020/130 , Reichman University and NTT Research , Reichman University , NTT Research 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.
Communication Lower Bounds for Cryptographic Broadcast Protocols
Paper 2023/1316 , University of Maryland, College Park , Reichman University, NTT Research , Reichman University , HSLU, Web3 Foundation Broadcast protocols enable a set of $n$ parties to agree on the input of a designated sender, even facing attacks by malicious parties.
Arithmetic Sketching
Paper 2023/1012 Arithmetic Sketching , Stanford University , Massachusetts Institute of Technology , Massachusetts Institute of Technology , Ben-Gurion University of the Negev , Technion – Israel Institute of Technology Abstract This paper introduces arithmetic sketching, an abstraction of a primitive that several previous works use to achieve lightweight, low-communication zero-knowledge verification of secret-shared vectors.
Oblivious Transfer with Constant Computational Overhead
Paper 2023/817 Oblivious Transfer with Constant Computational Overhead , IDC Herzliya, NTT Research , IRIF , Ben-Gurion University of the Negev , Technion – Israel Institute of Technology , Centrum Wiskunde & Informatica , University of Amsterdam , Aarhus University The computational overhead of a cryptographic task is the asymptotic ratio between the computational cost of securely realizing the task and that of realizing the task with no security at all.
Must the Communication Graph of MPC Protocols be an Expander?
Paper 2018/540 Must the Communication Graph of MPC Protocols be an Expander? Abstract 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 communication graph are determined dynamically as part of the protocol.
Sublinear Secure Computation from New Assumptions
Paper 2023/513 Sublinear Secure Computation from New Assumptions , Reichman University, NTT Research , Université Paris Cité, CNRS, IRIF , Reichman University, Université Paris Cité, CNRS, IRIF Abstract Secure computation enables mutually distrusting parties to jointly compute a function on their secret inputs, while revealing nothing beyond the function output.
Lightweight Techniques for Private Heavy Hitters
Paper 2021/017 Lightweight Techniques for Private Heavy Hitters Abstract 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 all popular strings, without learning anything else about any client’s string.
Can We Access a Database Both Locally and Privately?
Paper 2017/567 Can We Access a Database Both Locally and Privately? Abstract We consider the following strong variant of private information retrieval (PIR). There is a large database x that we want to make publicly available. To this end, we post an encoding X of x together with a short public key pk in a publicly accessible repository.
Information-Theoretic Distributed Point Functions
Paper 2023/028 Information-Theoretic Distributed Point Functions , Interdisciplinary Center Herzliya, NTT Research , Ben-Gurion University of the Negev , Technion – Israel Institute of Technology , Technion – Israel Institute of Technology Abstract 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.
Programmable Distributed Point Functions
Paper 2022/1060 Programmable Distributed Point Functions , Interdisciplinary Center Herzliya, NTT Research , Ben-Gurion University of the Negev , Technion – Israel Institute of Technology , Technion – Israel Institute of Technology Abstract A distributed point function (DPF) is a cryptographic primitive that enables compressed additive sharing of a secret unit vector across two or more parties.
Efficient Pseudorandom Correlation Generators from Ring-LPN
Paper 2022/1035 Efficient Pseudorandom Correlation Generators from Ring-LPN , IDC Herzliya, NTT Research , IRIF , Ben-Gurion University of the Negev , Technion – Israel Institute of Technology , Centrum Wiskunde & Informatica , Aarhus University Abstract Secure multiparty computation can often utilize a trusted source of correlated randomness to achieve better efficiency. A recent line of work, initiated by Boyle et al.
Correlated Pseudorandomness from Expand-Accumulate Codes
Paper 2022/1014 Correlated Pseudorandomness from Expand-Accumulate Codes , IDC Herzliya, NTT Research , IRIF , Ben-Gurion University of the Negev , Technion – Israel Institute of Technology , Centrum Wiskunde & Informatica , Centrum Wiskunde & Informatica , Aarhus University A pseudorandom correlation generator (PCG) is a recent tool for securely generating useful sources of correlated randomness, such as random oblivious transfers (OT) and vector oblivious linear evaluations (VOLE), with low...
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs
Paper 2019/188 Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs Abstract We introduce and study the notion of fully linear probabilistically checkable proof systems. In such a proof system, the verifier can make a small number of linear queries that apply jointly to the input and a proof vector.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Elette
Contact Elette, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack