2019 |
-
Blind Certificate Authorities
with Liang Wang, Rafael Pass, Thomas Ristenpart and abhi shelat
IEEE Symposium on Security & Privacy (S&P) 2019
[ePrint, bibtex, slides]
|
2018 |
-
On the Complexity of Compressing Obfuscation
with Naomi Ephraim, Ilan Komargodski and Rafael Pass
CRYPTO 2018
[ePrint, bibtex, slides]
-
Tight Tradeoffs in Searchable Symmetric Encryption
with Gil Segev and Ido Shahaf
CRYPTO 2018
[ePrint, bibtex, slides]
-
Privacy-Preserving Search of Similar Patients in Genomic Data
with Shai Halevi, Yehuda Lindell and Tal Rabin
Proceedings of Privacy Enhanced Technologies (PETS) 2018
[ePrint, bibtex, slides]
|
2017 |
-
Privacy-Preserving Interdomain Routing at Internet scale
with Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, and Michael Zohner
Proceedings of Privacy Enhanced Technologies (PETS) 2017
[ePrint, bibtex, slides]
-
Secure Centrality Computation Over Multiple Networks
with Francesco Bonchi, David Garcia Soriano and Tamir Tassa
WWW 2017
[PDF, bibtex, slides]
|
2016 |
-
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations
with Moni Naor, Gil Segev and Ido Shahaf
STOC 2016
[ePrint, bibtex, slides]
-
On Constructing One-Way Permutations from Indistinguishability Obfuscation
with Gil Segev
TCC 2016-A
Journal of Cryptology (2018)
[ePrint, bibtex, slides]
|
2015 |
-
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
with Gil Segev,
FOCS 2015
SIAM Journal of Computing (2016)
[ePrint, bibtex, slides]
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, bibtex, slides, code]
-
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
with Amos Beimel, Nikolaos Makriyannis and Eran Omri,
TCC 2015
[ePrint, bibtex, slides]
|
2014 |
-
Towards Characterizing Complete Fairness in Secure Two-Party Computation
TCC 2014
[ePrint, bibtex, slides]
|
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, bibtex, slides, code]
-
Fair and Efficient Secure Multiparty Computation with Reputation Systems
with Yehuda Lindell and Hila Zarosim,
ASIACRYPT 2013
[ePrint, bibtex, slides]
-
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
with Yehuda Lindell and Tal Rabin,
TCC 2013
[ePrint, bibtex, slides]
|
2012 |
-
Calling Out Cheaters: Covert Security with Public Verifiability
with Claudio Orlandi,
ASIACRYPT 2012
[ePrint, bibtex, 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, bibtex, slides]
|
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, bibtex, slides]
-
Perfectly-Secure Multiplication for any t < n/3
with Yehuda Lindell and Tal Rabin,
CRYPTO 2011
[PDF, bibtex, slides]
-
Towards a Game Theoretic View of Secure Computation
with Ran Canetti and Carmit Hazay,
EUROCRYPT 2011
Journal of Cryptology (2016)
[ePrint, bibtex, slides]
|
2009 |
-
Utility Dependence in Correct and Fair Rational Secret Sharing
with Yehuda Lindell,
CRYPTO 2009
Journal of Cryptology (2011)
[ePrint, bibtex, slides]
|