Elette Boyle

Victor I. Kolobov

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Information-Theoretic Distributed Point Functions.

[BibT_eX]

[DOI]

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021

On the Security of Doubly Efficient PIR.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Lightweight Techniques for Private Heavy Hitters.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party.

[BibT_eX]

[DOI]

Ran Cohen

Aarushi Goel

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Sublinear GMW-Style Compiler for MPC with Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement.

[BibT_eX]

[DOI]

Prashant Nalini Vasudevan

Ran Cohen

Aarushi Goel

IACR Cryptol. ePrint Arch., 2020

Topology-Hiding Communication from Minimal Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Cryptography from Information Loss.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Correlated Pseudorandom Functions from Variable-Density LPN.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Efficient Pseudorandom Correlation Generators from Ring-LPN.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Permuted Puzzles and Cryptographic Hardness.

[BibT_eX]

[DOI]

Justin Holmgren

Mor Weiss

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Secure Computation with Preprocessing via Function Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Is Information-Theoretic Topology-Hiding Computation Possible?

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Adversarially Robust Property-Preserving Hash Functions.

[BibT_eX]

[DOI]

Rio LaVigne

Vinod Vaikuntanathan

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Homomorphic Secret Sharing from Lattices Without FHE.

[BibT_eX]

[DOI]

Lisa Kohl

Peter Scholl

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018

Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Foundations of Homomorphic Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

The Bottleneck Complexity of Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Exploring the Boundaries of Topology-Hiding Computation.

[BibT_eX]

[DOI]

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

Limits of Practical Sublinear Secure Computation.

[BibT_eX]

[DOI]

Antigoni Polychroniadou

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Must the Communication Graph of MPC Protocols be an Expander?

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Compressing Vector OLE.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

Can We Access a Database Both Locally and Privately?

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Recent Advances in Function and Homomorphic Secret Sharing - (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2017, 2017

Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Homomorphic Secret Sharing: Optimizations and Applications.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016

Oblivious Parallel RAM and Applications.

[BibT_eX]

[DOI]

Kai-Min Chung

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Is There an Oblivious RAM Lower Bound?

[BibT_eX]

[DOI]

Moni Naor

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Breaking the Circuit Size Barrier for Secure Computation Under DDH.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Function Secret Sharing: Improvements and Extensions.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

Function Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs.

[BibT_eX]

[DOI]

Kai-Min Chung

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Limits of Extractability Assumptions with Distributional Auxiliary Input.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Oblivious Parallel RAM.

[BibT_eX]

[DOI]

Kai-Min Chung

IACR Cryptol. ePrint Arch., 2014

Large-Scale Secure Computation.

[BibT_eX]

[DOI]