Sequential entry in many-to-one matching markets. - Elette Boyle; Federico Echenique (Soc. Choice Welf., 2009)

Multiparty computation secure against continual memory leakage. - Elette Boyle; Shafi Goldwasser; Abhishek Jain 002; Yael Tauman Kalai (STOC, 2012)

Secure Computation against Adaptive Auxiliary Information. - Elette Boyle; Sanjam Garg; Abhishek Jain 002; Yael Tauman Kalai; Amit Sahai (CRYPTO (1), 2013)

Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting. - Elette Boyle; Shafi Goldwasser; Stefano Tessaro (TCC, 2013)

On Extractability Obfuscation. - Elette Boyle; Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2013)

Functional Signatures and Pseudorandom Functions. - Elette Boyle; Shafi Goldwasser; Ioana Ivan (IACR Cryptol. ePrint Arch., 2013)

Limits of Extractability Assumptions with Distributional Auxiliary Input. - Elette Boyle; Rafael Pass (IACR Cryptol. ePrint Arch., 2013)

Fully Leakage-Resilient Signatures. - Elette Boyle; Gil Segev 001; Daniel Wichs (J. Cryptol., 2013)

Leakage-resilient coin tossing. - Elette Boyle; Shafi Goldwasser; Yael Tauman Kalai (Distributed Comput., 2014)

Large-Scale Secure Computation. - Elette Boyle; Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Oblivious Parallel RAM. - Elette Boyle; Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs. - Elette Boyle; Kai-Min Chung; Rafael Pass (CRYPTO (2), 2015)

Function Secret Sharing. - Elette Boyle; Niv Gilboa; Yuval Ishai (EUROCRYPT (2), 2015)

Is There an Oblivious RAM Lower Bound? - Elette Boyle; Moni Naor (Electron. Colloquium Comput. Complex., 2015)

Oblivious Parallel RAM and Applications. - Elette Boyle; Kai-Min Chung; Rafael Pass (TCC (A2), 2016)

Breaking the Circuit Size Barrier for Secure Computation Under DDH. - Elette Boyle; Niv Gilboa; Yuval Ishai (IACR Cryptol. ePrint Arch., 2016)

Recent Advances in Function and Homomorphic Secret Sharing - (Invited Talk). - Elette Boyle (INDOCRYPT, 2017)

Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation. - Elette Boyle; Niv Gilboa; Yuval Ishai (IACR Cryptol. ePrint Arch., 2017)

Foundations of Homomorphic Secret Sharing. - Elette Boyle; Niv Gilboa; Yuval Ishai; Huijia Lin; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2017)

Can We Access a Database Both Locally and Privately? - Elette Boyle; Yuval Ishai; Rafael Pass; Mary Wootters (IACR Cryptol. ePrint Arch., 2017)

Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. - Elette Boyle; Saleet Klein; Alon Rosen; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2017)

Exploring the Boundaries of Topology-Hiding Computation. - Marshall Ball; Elette Boyle; Tal Malkin; Tal Moran (EUROCRYPT (3), 2018)

The Bottleneck Complexity of Secure Multiparty Computation. - Elette Boyle; Abhishek Jain 002; Manoj Prabhakaran 001; Ching-Hua Yu (ICALP, 2018)

Homomorphic Secret Sharing: Optimizations and Applications. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Michele Orrù (IACR Cryptol. ePrint Arch., 2018)

Function Secret Sharing: Improvements and Extensions. - Elette Boyle; Niv Gilboa; Yuval Ishai (IACR Cryptol. ePrint Arch., 2018)

Limits of Practical Sublinear Secure Computation. - Elette Boyle; Yuval Ishai; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2018)

Adversarially Robust Property Preserving Hash Functions. - Elette Boyle; Rio LaVigne; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2018)

Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs. - Dan Boneh; Elette Boyle; Henry Corrigan-Gibbs; Niv Gilboa; Yuval Ishai (CRYPTO (3), 2019)

Is Information-Theoretic Topology-Hiding Computation Possible? - Marshall Ball; Elette Boyle; Ran Cohen; Tal Malkin; Tal Moran (IACR Cryptol. ePrint Arch., 2019)

How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs. - Dan Boneh; Elette Boyle; Henry Corrigan-Gibbs; Niv Gilboa; Yuval Ishai (IACR Cryptol. ePrint Arch., 2019)

Compressing Vector OLE. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai (IACR Cryptol. ePrint Arch., 2019)

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Rindal; Peter Scholl (IACR Cryptol. ePrint Arch., 2019)

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2019)

Secure Computation with Preprocessing via Function Secret Sharing. - Elette Boyle; Niv Gilboa; Yuval Ishai (IACR Cryptol. ePrint Arch., 2019)

Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. - Elette Boyle; Niv Gilboa; Yuval Ishai; Ariel Nof (IACR Cryptol. ePrint Arch., 2019)

Permuted Puzzles and Cryptographic Hardness. - Elette Boyle; Justin Holmgren; Mor Weiss (IACR Cryptol. ePrint Arch., 2019)

Homomorphic Secret Sharing from Lattices Without FHE. - Elette Boyle; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2019)

Cryptography from Information Loss. - Marshall Ball; Elette Boyle; Akshay Degwekar; Apoorvaa Deshpande; Alon Rosen; Vinod Vaikuntanathan; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2020)

Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. - Elette Boyle; Ran Cohen; Aarushi Goel (IACR Cryptol. ePrint Arch., 2020)

Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation. - Elette Boyle; Nishanth Chandran; Niv Gilboa; Divya Gupta 001; Yuval Ishai; Nishant Kumar 001; Mayank Rathee (IACR Cryptol. ePrint Arch., 2020)

Correlated Pseudorandom Functions from Variable-Density LPN. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2020)

Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. - Elette Boyle; Niv Gilboa; Yuval Ishai; Ariel Nof (IACR Cryptol. ePrint Arch., 2020)

Low-Complexity Weak Pseudorandom Functions in $ mathtt {AC}0[ mathtt {MOD}2]$. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (CRYPTO (4), 2021)

Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. - Elette Boyle; Ran Cohen; Aarushi Goel (PODC, 2021)

Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. - Fabrice Benhamouda; Elette Boyle; Niv Gilboa; Shai Halevi; Yuval Ishai; Ariel Nof (IACR Cryptol. ePrint Arch., 2021)

Lightweight Techniques for Private Heavy Hitters. - Dan Boneh; Elette Boyle; Henry Corrigan-Gibbs; Niv Gilboa; Yuval Ishai (IACR Cryptol. ePrint Arch., 2021)

On the Security of Doubly Efficient PIR. - Elette Boyle; Justin Holmgren; Fermi Ma; Mor Weiss (IACR Cryptol. ePrint Arch., 2021)

Secure Multiparty Computation with Sublinear Preprocessing. - Elette Boyle; Niv Gilboa; Yuval Ishai; Ariel Nof (EUROCRYPT (1), 2022)

Correlated Pseudorandomness from Expand-Accumulate Codes. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Nicolas Resch; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Efficient Pseudorandom Correlation Generators from Ring-LPN. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Locality-Preserving Hashing for Shifts with Connections to Cryptography. - Elette Boyle; Itai Dinur; Niv Gilboa; Yuval Ishai; Nathan Keller; Ohad Klein (IACR Cryptol. ePrint Arch., 2022)

Programmable Distributed Point Functions. - Elette Boyle; Niv Gilboa; Yuval Ishai; Victor I. Kolobov (IACR Cryptol. ePrint Arch., 2022)

Sublinear GMW-Style Compiler for MPC with Preprocessing. - Elette Boyle; Niv Gilboa; Yuval Ishai; Ariel Nof (IACR Cryptol. ePrint Arch., 2022)

On Low-End Obfuscation and Learning. - Elette Boyle; Yuval Ishai; Pierre Meyer; Robert Robere; Gal Yehuda (ITCS, 2023)

Arithmetic Sketching. - Dan Boneh; Elette Boyle; Henry Corrigan-Gibbs; Niv Gilboa; Yuval Ishai (IACR Cryptol. ePrint Arch., 2023)

Oblivious Transfer with Constant Computational Overhead. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Nicolas Resch; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

Sublinear Secure Computation from New Assumptions. - Elette Boyle; Geoffroy Couteau; Pierre Meyer (IACR Cryptol. ePrint Arch., 2023)

Sublinear-Communication Secure Multiparty Computation does not require FHE. - Elette Boyle; Geoffroy Couteau; Pierre Meyer (IACR Cryptol. ePrint Arch., 2023)

Information-Theoretic Distributed Point Functions. - Elette Boyle; Niv Gilboa; Yuval Ishai; Victor I. Kolobov (IACR Cryptol. ePrint Arch., 2023)

Must the Communication Graph of MPC Protocols be an Expander? - Elette Boyle; Ran Cohen; Deepesh Data; Pavel Hubácek (J. Cryptol., 2023)

Topology-Hiding Communication from Minimal Assumptions. - Marshall Ball; Elette Boyle; Ran Cohen; Lisa Kohl; Tal Malkin; Pierre Meyer; Tal Moran (J. Cryptol., 2023)

Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018). - Elette Boyle; Vincent Cohen-Addad; Alexandra Kolla; Mikkel Thorup (SIAM J. Comput., 2023)

Secure Sorting and Selection via Function Secret Sharing. - Amit Agarwal; Elette Boyle; Nishanth Chandran; Niv Gilboa; Divya Gupta 001; Yuval Ishai; Mahimna Kelkar; Yiping Ma 001 (CCS, 2024)

Compressing Unit-Vector Correlations via Sparse Pseudorandom Generators. - Amit Agarwal; Elette Boyle; Niv Gilboa; Yuval Ishai; Mahimna Kelkar; Yiping Ma 001 (CRYPTO (8), 2024)

Memory Checking Requires Logarithmic Overhead. - Elette Boyle; Ilan Komargodski; Neekon Vafa (Electron. Colloquium Comput. Complex., 2024)

Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. - D'or Banoun; Elette Boyle; Ran Cohen (IACR Cryptol. ePrint Arch., 2024)

Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. - Elette Boyle; Lisa Kohl; Zhe Li; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

Locally Verifiable Distributed SNARGs. - Eden Aldema Tshuva; Elette Boyle; Ran Cohen; Tal Moran; Rotem Oshman (IACR Cryptol. ePrint Arch., 2024)

Breaking the $O( sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. - Elette Boyle; Ran Cohen; Aarushi Goel (J. Cryptol., 2024)

Improved Constructions for Distributed Multi-Point Functions. - Elette Boyle; Niv Gilboa; Matan Hamilis; Yuval Ishai; Yaxin Tu (SP, 2025)

Non-Interactive Distributed Point Functions. - Elette Boyle; Lalita Devadas; Sacha Servan-Schreiber (IACR Cryptol. ePrint Arch., 2025)

Preprocessing for Life: Dishonest-Majority MPC with a Trusted or Untrusted Dealer. - Elette Boyle; Niv Gilboa; Matan Hamilis; Yuval Ishai; Ariel Nof (IACR Cryptol. ePrint Arch., 2025)

Simultaneous-Message and Succinct Secure Computation. - Elette Boyle; Abhishek Jain 002; Sacha Servan-Schreiber; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2025)

The Complexity of Memory Checking with Covert Security. - Elette Boyle; Ilan Komargodski; Neekon Vafa (IACR Cryptol. ePrint Arch., 2025)

Communication lower bounds for cryptographic broadcast protocols. - Erica Blum; Elette Boyle; Ran Cohen; Chen-Da Liu-Zhang (Distributed Comput., 2025)