with a focus on secure multiparty computation.
I joined Bar-Ilan's faculty in 2019 after spending four years in NY (IBM TJ Watson Center, Cornell Tech, and JP Morgan AI Research), and a year at the Hebrew University. I completed my Ph.D. studies in 2015 at Bar-Ilan University.
2024 |
-
Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC
with Ittai Abraham, Arpita Patra,
Gilad Stern
TCC 2024
[ePrint]
-
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness
with Prabhanjan Ananth, Vipul Goyal, Hadar Kaner, Pratik Soni, and Brent Waters
SCN 2024
[ePrint]
-
Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS
with Anirudh Chandramouli
EUROCRYPT 2024
[ePrint]
-
Perfect Asynchronous MPC with Linear Communication Overhead
with Ittai Abraham, Shravani Patil, and Arpita Patra
EUROCRYPT 2024
[ePrint]
|
2023 |
-
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM
with Ilan Komargodski and Yehuda Michelson
ACM CCS 2023
[ePrint,code]
Distinguished Paper Award
-
Secure Statistical Analysis on Multiple Datasets: Join and Group-By
with Koki Hamada, Ryo Kikuchi, Ariel Nof, Benny Pinkas and Junichi Tomida
ACM CCS 2023
[ePrint]
-
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time
with Ittai Abraham, Shravani Patil, Arpita Patra
EUROCRYPT 2023
[ePrint]
-
Prime Match: A Privacy Preserving Inventory Matching System
with Antigoni Polychroniadou, Benjamin Diamond, Tucker Balch, Hans Buehler,
Richard Hua,
Greg Gimler,
Suwen Gu,
Manuela Veloso
USENIX 2023
[ePrint]
|
2022 |
-
Asymptotically Free Broadcast in Constant Expected Time
via Packed VSS
with Ittai Abraham, Shravani Patil, Arpita Patra
TCC 2022
[ePrint,
video]
-
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters
with Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas,
Katsumi Takahashi, Junichi Tomida
ACM CCS 2022
[ePrint]
-
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
with Ittai Abraham
PODC 2022
[ePrint]
-
Static vs. Adaptive in Perfect MPC: A Separation and the Adaptive Security of BGW
with Ran Cohen and Oren Shochat
ITC 2022: Information Theoretic Cryptography
[ePrint, video]
-
A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss
with Elaine Shi and Ke Wu
EUROCRYPT 2022
[ePrint]
-
Optimal Oblivious Parallel RAM
with Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, and Elaine Shi
SODA 2022
[ePrint, video]
|
2021 |
-
Efficient Perfectly Secure Computation with Optimal Resilience
with Ittai Abraham and Avishay Yanai
TCC 2021
Journal of Cryptology (2022)
[ePrint, video]
-
Oblivious RAM with Worst-Case Logarithmic Overhead
with Ilan Komargodski, Wei-Kai Lin, and Elaine Shi
CRYPTO 2021
Journal of Cryptology (2023)
[ePrint, video]
-
Towards Accountability in CRS Generation
with Prabhanjan Ananth, Hila Dahari and Vipul Goyal
EUROCRYPT 2021
[ePrint]
-
Sorting Short Keys in Circuits of Size o(n log n)
with Wei-Kai Lin and Elaine Shi
SODA 2021
SIAM Journal of Computing (2022)
[arXiv, video]
-
Privacy-Preserving Portfolio Pricing
with Tucker Balch, and Antigoni Polychroniadou
ACM ICAIF 2021
[paper]
|
2020 |
-
Oblivious Parallel Tight Compaction
with Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, and Elaine Shi
ITC 2020: Information Theoretic Cryptography
[ePrint]
-
OptORAMa: Optimal Oblivious RAM
with Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, and Elaine Shi
EUROCRYPT 2020
Journal of the ACM
[ePrint,
video]
-
Privacy-Preserving Dark Pools
with Tucker Balch, Antigoni Polychroniadou and Manuela Veloso
AAMAS 2020 (extended abstract)
[PDF]
-
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort
with T-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren and Elaine Shi
SOSA@SODA 2020
[arXiv, video]
|
2019 |
-
Locality Preserving Oblivious RAM
with T-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren and Elaine Shi
EUROCRYPT 2019
Journal Of Cryptology (2022)
[ePrint]
-
Blind Certificate Authorities
with Liang Wang, Rafael Pass, Thomas Ristenpart and abhi shelat
S&P 2019
[ePrint]
On Perfect Correctness without Derandomization
with Naomi Ephraim, Ilan Komargodski and Rafael Pass
[ePrint]
|
2018 |
-
On the Complexity of Compressing Obfuscation
with Naomi Ephraim, Ilan Komargodski and Rafael Pass
CRYPTO 2018
Journal Of Cryptology (2022)
[ePrint]
-
Tight Tradeoffs in Searchable Symmetric Encryption
with Gil Segev and Ido Shahaf
CRYPTO 2018
Journal Of Cryptology
[ePrint]
-
Privacy-Preserving Search of Similar Patients in Genomic Data
with Shai Halevi, Yehuda Lindell and Tal Rabin
PETS 2018: Proceedings of Privacy Enhanced Technologies
also in "Real World Crypto", 2017
[ePrint, video]
|
2017 |
-
Privacy-Preserving Interdomain Routing at Internet scale
with Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, and Michael Zohner
PETS 2017: Proceedings of Privacy Enhanced Technologies
[ePrint]
-
Secure Centrality Computation Over Multiple Networks
with Francesco Bonchi, David Garcia Soriano and Tamir Tassa
WWW 2017
[PDF]
|
2016 |
-
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations
with Moni Naor, Gil Segev and Ido Shahaf
STOC 2016
SIAM Journal of Computing
[ePrint, slides]
-
On Constructing One-Way Permutations from Indistinguishability Obfuscation
with Gil Segev
TCC 2016-A
Journal of Cryptology (2018)
[ePrint, slides, video]
|
2015 |
-
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
with Gil Segev,
FOCS 2015
SIAM Journal of Computing (2016)
[ePrint, slides,
video]
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
with Yehuda Lindell, Thomas Schneider and Michael Zohner,
EUROCRYPT 2015
Journal of Cryptology (2017. combined with the CCS13 paper and available in ePrint)
[ePrint, slides, video, code]
-
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
with Amos Beimel, Nikolaos Makriyannis and Eran Omri,
TCC 2015
[ePrint]
Foundations of Secure Computation: Perfect Security and Fairness
Ph.D. Dissertation, Bar-Ilan University, 2015
[PDF, hebrew intro]
|
2014 |
-
Towards Characterizing Complete Fairness in Secure Two-Party Computation
TCC 2014
[ePrint, slides,video]
|
2013 |
-
More Efficient Oblivious Transfer and Extensions for Faster Secure Computation
with Yehuda Lindell, Thomas Schneider and Michael Zohner,
ACM CCS 2013
Journal of Cryptology (2017. Combined with the EUROCRYPT'15 paper and available in ePrint)
[ePrint, slides, code]
-
Fair and Efficient Secure Multiparty Computation with Reputation Systems
with Yehuda Lindell and Hila Zarosim,
ASIACRYPT 2013
[ePrint, slides]
-
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
with Yehuda Lindell and Tal Rabin,
TCC 2013
[ePrint, slides]
|
2012 |
-
Calling Out Cheaters: Covert Security with Public Verifiability
with Claudio Orlandi,
ASIACRYPT 2012
[ePrint, slides]
-
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
with Abhishek Jain, Adriana Lo'pez-Alt, Eran Tromer, Vinod Vaikuntanathan and Daniel Wichs,
EUROCRYPT 2012
[ePrint, slides, video]
|
2011 |
-
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation
with Yehuda Lindell,
A book chapter (an abbreviated version, invited): Secure Multi-Party Computation
Journal of Cryptology (2017)
[ePrint]
-
Perfectly-Secure Multiplication for any t < n/3
with Yehuda Lindell and Tal Rabin,
CRYPTO 2011
[PDF, video]
-
Towards a Game Theoretic View of Secure Computation
with Ran Canetti and Carmit Hazay,
EUROCRYPT 2011
Journal of Cryptology (2016)
[ePrint]
|
2009 |
-
Utility Dependence in Correct and Fair Rational Secret Sharing
with Yehuda Lindell,
CRYPTO 2009
Journal of Cryptology (2011)
[ePrint]
|
this year. Please join our mailing list and contact me if you are interested in giving a talk.