Elette Boyle

According to our database1, Elette Boyle authored at least 41 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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

Efficient Pseudorandom Correlation Generators from Ring-LPN.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 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

Must the Communication Graph of MPC Protocols be an Expander?
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...