Gilad Asharov

Ran Cohen

Oren Shochat

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

Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters.

[BibT_eX]

[DOI]

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

2021

Efficient Perfectly Secure Computation with Optimal Resilience.

[BibT_eX]

[DOI]

Ittai Abraham

Avishay Yanai

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

Sorting Short Keys in Circuits of Size o(n log n).

[BibT_eX]

[DOI]

Wei-Kai Lin

Elaine Shi

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Privacy-preserving portfolio pricing.

[BibT_eX]

[DOI]

Tucker Balch

Antigoni Polychroniadou

Proceedings of the ICAIF'21: 2nd ACM International Conference on AI in Finance, Virtual Event, November 3, 2021

Towards Accountability in CRS Generation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Oblivious RAM with Worst-Case Logarithmic Overhead.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.

[BibT_eX]

[DOI]

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Oblivious Parallel Tight Compaction.

[BibT_eX]

[DOI]

Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

OptORAMa: Optimal Oblivious RAM.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Privacy-Preserving Dark Pools.

[BibT_eX]

[DOI]

Tucker Hybinette Balch

Antigoni Polychroniadou

Manuela Veloso

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

On Perfect Correctness without Derandomization.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Blind Certificate Authorities.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Locality-Preserving Oblivious RAM.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018

OptORAMa: Optimal Oblivious RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Tight Tradeoffs in Searchable Symmetric Encryption.

[BibT_eX]

[DOI]

Ido Shahaf

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

On the Complexity of Compressing Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Privacy-Preserving Search of Similar Patients in Genomic Data.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Privacy-Preserving Interdomain Routing at Internet Scale.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Oblivious Computation with Data Locality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Secure Centrality Computation Over Multiple Networks.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on World Wide Web, 2017

2016

Toward a Game Theoretic View of Secure Computation.

[BibT_eX]

[DOI]

Ran Canetti

Carmit Hazay

J. Cryptol., 2016

More Efficient Oblivious Transfer Extensions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Indistinguishability Obfuscation Does Not Reduce to Structured Languages.

[BibT_eX]

[DOI]

Alon Rosen

Electron. Colloquium Comput. Complex., 2016

On Constructing One-Way Permutations from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

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

Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014

Towards Characterizing Complete Fairness in Secure Two-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

2013

The BGW Protocol for Perfectly-Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Secure Multi-Party Computation, 2013

A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.

[BibT_eX]

[DOI]

Tal Rabin

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

More efficient oblivious transfer and extensions for faster secure computation.

[BibT_eX]

[DOI]

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

Fair and Efficient Secure Multiparty Computation with Reputation Systems.

[BibT_eX]

[DOI]

Hila Zarosim

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Calling Out Cheaters: Covert Security with Public Verifiability.

[BibT_eX]

[DOI]

Claudio Orlandi

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.

[BibT_eX]

[DOI]

Abhishek Jain

Daniel Wichs

IACR Cryptol. ePrint Arch., 2011

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Towards a Game Theoretic View of Secure Computation.

[BibT_eX]

[DOI]

Ran Canetti

Carmit Hazay

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Perfectly-Secure Multiplication for Any t < n/3.

[BibT_eX]

[DOI]

Tal Rabin

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2009

Utility Dependence in Correct and Fair Rational Secret Sharing.

[BibT_eX]

[DOI]