Elette Boyle

Ran Cohen

Aarushi Goel

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]$.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Correlated Pseudorandom Functions from Variable-Density LPN.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement.

[BibT_eX]

[DOI]

Prashant Nalini Vasudevan

Ran Cohen

Aarushi Goel

IACR Cryptol. ePrint Arch., 2020

Cryptography from Information Loss.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

2019

Homomorphic Secret Sharing from Lattices Without FHE.

[BibT_eX]

[DOI]

Lisa Kohl

Peter Scholl

IACR Cryptol. ePrint Arch., 2019

Permuted Puzzles and Cryptographic Hardness.

[BibT_eX]

[DOI]

Justin Holmgren

Mor Weiss

IACR Cryptol. ePrint Arch., 2019

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Secure Computation with Preprocessing via Function Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Compressing Vector OLE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Is Information-Theoretic Topology-Hiding Computation Possible?

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Adversarially Robust Property Preserving Hash Functions.

[BibT_eX]

[DOI]

Rio LaVigne

Vinod Vaikuntanathan

IACR Cryptol. ePrint Arch., 2018

Limits of Practical Sublinear Secure Computation.

[BibT_eX]

[DOI]

Antigoni Polychroniadou

IACR Cryptol. ePrint Arch., 2018

Function Secret Sharing: Improvements and Extensions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Homomorphic Secret Sharing: Optimizations and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 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

2017

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Can We Access a Database Both Locally and Privately?

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Foundations of Homomorphic Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

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

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2017, 2017

2016

Breaking the Circuit Size Barrier for Secure Computation Under DDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Oblivious Parallel RAM and Applications.

[BibT_eX]

[DOI]

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

2015

Is There an Oblivious RAM Lower Bound?

[BibT_eX]

[DOI]

Moni Naor

Electron. Colloquium Comput. Complex., 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]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Oblivious Parallel RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Large-Scale Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Leakage-resilient coin tossing.

[BibT_eX]

[DOI]

Shafi Goldwasser

Yael Tauman Kalai

Distributed Comput., 2014

2013

Fully Leakage-Resilient Signatures.

[BibT_eX]

[DOI]

Gil Segev

Daniel Wichs

J. Cryptol., 2013

Limits of Extractability Assumptions with Distributional Auxiliary Input.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Functional Signatures and Pseudorandom Functions.

[BibT_eX]

[DOI]

Shafi Goldwasser

Ioana Ivan

IACR Cryptol. ePrint Arch., 2013

On Extractability Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting.

[BibT_eX]

[DOI]

Shafi Goldwasser

Stefano Tessaro

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Secure Computation against Adaptive Auxiliary Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Multiparty computation secure against continual memory leakage.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2009

Sequential entry in many-to-one matching markets.

[BibT_eX]

[DOI]