Elette Boyle

Orcid: 0009-0002-0360-8129

Affiliations:
  • IDC Herzliya, Herzliya, Israel


According to our database1, Elette Boyle authored at least 69 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party.
J. Cryptol., March, 2024

Locally Verifiable Distributed SNARGs.
IACR Cryptol. ePrint Arch., 2024

Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism.
IACR Cryptol. ePrint Arch., 2024

Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond.
IACR Cryptol. ePrint Arch., 2024

Memory Checking Requires Logarithmic Overhead.
Electron. Colloquium Comput. Complex., 2024

Compressing Unit-Vector Correlations via Sparse Pseudorandom Generators.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018).
SIAM J. Comput., December, 2023

Topology-Hiding Communication from Minimal Assumptions.
J. Cryptol., October, 2023

Must the Communication Graph of MPC Protocols be an Expander?
J. Cryptol., July, 2023

Information-Theoretic Distributed Point Functions.
IACR Cryptol. ePrint Arch., 2023

Sublinear-Communication Secure Multiparty Computation does not require FHE.
IACR Cryptol. ePrint Arch., 2023

Sublinear Secure Computation from New Assumptions.
IACR Cryptol. ePrint Arch., 2023

Oblivious Transfer with Constant Computational Overhead.
IACR Cryptol. ePrint Arch., 2023

Arithmetic Sketching.
IACR Cryptol. ePrint Arch., 2023

Communication Lower Bounds for Cryptographic Broadcast Protocols.
IACR Cryptol. ePrint Arch., 2023

On Low-End Obfuscation and Learning.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Sublinear GMW-Style Compiler for MPC with Preprocessing.
IACR Cryptol. ePrint Arch., 2022

Programmable Distributed Point Functions.
IACR Cryptol. ePrint Arch., 2022

Locality-Preserving Hashing for Shifts with Connections to Cryptography.
IACR Cryptol. ePrint Arch., 2022

Efficient Pseudorandom Correlation Generators from Ring-LPN.
IACR Cryptol. ePrint Arch., 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.
IACR Cryptol. ePrint Arch., 2022

Secure Multiparty Computation with Sublinear Preprocessing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
On the Security of Doubly Efficient PIR.
IACR Cryptol. ePrint Arch., 2021

Lightweight Techniques for Private Heavy Hitters.
IACR Cryptol. ePrint Arch., 2021

Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation.
IACR Cryptol. ePrint Arch., 2021

Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2020

Correlated Pseudorandom Functions from Variable-Density LPN.
IACR Cryptol. ePrint Arch., 2020

Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation.
IACR Cryptol. ePrint Arch., 2020

Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2020

Cryptography from Information Loss.
Electron. Colloquium Comput. Complex., 2020

2019
Homomorphic Secret Sharing from Lattices Without FHE.
IACR Cryptol. ePrint Arch., 2019

Permuted Puzzles and Cryptographic Hardness.
IACR Cryptol. ePrint Arch., 2019

Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2019

Secure Computation with Preprocessing via Function Secret Sharing.
IACR Cryptol. ePrint Arch., 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.
IACR Cryptol. ePrint Arch., 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2019

Compressing Vector OLE.
IACR Cryptol. ePrint Arch., 2019

How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs.
IACR Cryptol. ePrint Arch., 2019

Is Information-Theoretic Topology-Hiding Computation Possible?
IACR Cryptol. ePrint Arch., 2019

Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Adversarially Robust Property Preserving Hash Functions.
IACR Cryptol. ePrint Arch., 2018

Limits of Practical Sublinear Secure Computation.
IACR Cryptol. ePrint Arch., 2018

Function Secret Sharing: Improvements and Extensions.
IACR Cryptol. ePrint Arch., 2018

Homomorphic Secret Sharing: Optimizations and Applications.
IACR Cryptol. ePrint Arch., 2018

The Bottleneck Complexity of Secure Multiparty Computation.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Exploring the Boundaries of Topology-Hiding Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability.
IACR Cryptol. ePrint Arch., 2017

Can We Access a Database Both Locally and Privately?
IACR Cryptol. ePrint Arch., 2017

Foundations of Homomorphic Secret Sharing.
IACR Cryptol. ePrint Arch., 2017

Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation.
IACR Cryptol. ePrint Arch., 2017

Recent Advances in Function and Homomorphic Secret Sharing - (Invited Talk).
Proceedings of the Progress in Cryptology - INDOCRYPT 2017, 2017

2016
Breaking the Circuit Size Barrier for Secure Computation Under DDH.
IACR Cryptol. ePrint Arch., 2016

Oblivious Parallel RAM and Applications.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015
Is There an Oblivious RAM Lower Bound?
Electron. Colloquium Comput. Complex., 2015

Function Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Oblivious Parallel RAM.
IACR Cryptol. ePrint Arch., 2014

Large-Scale Secure Computation.
IACR Cryptol. ePrint Arch., 2014

Leakage-resilient coin tossing.
Distributed Comput., 2014

2013
Fully Leakage-Resilient Signatures.
J. Cryptol., 2013

Limits of Extractability Assumptions with Distributional Auxiliary Input.
IACR Cryptol. ePrint Arch., 2013

Functional Signatures and Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2013

On Extractability Obfuscation.
IACR Cryptol. ePrint Arch., 2013

Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Secure Computation against Adaptive Auxiliary Information.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Multiparty computation secure against continual memory leakage.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2009
Sequential entry in many-to-one matching markets.
Soc. Choice Welf., 2009


  Loading...