default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Dov Gordon
Person information
- affiliation: George Mason University, Fairfax, VA, USA
- affiliation (PhD 2010): University of Maryland, College Park, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Ojaswi Acharya, Foteini Baldimtsi
, Samuel Dov Gordon, Daniel McVicker, Aayush Yadav:
Universal Vector Commitments. SCN (1) 2024: 161-181- [i28]Ojaswi Acharya, Foteini Baldimtsi, Samuel Dov Gordon, Daniel McVicker, Aayush Yadav:
Universal Vector Commitments. IACR Cryptol. ePrint Arch. 2024: 680 (2024) - 2023
- [c28]S. Dov Gordon, Phi Hung Le, Daniel McVicker:
Linear Communication in Malicious Majority MPC. CCS 2023: 2173-2187 - 2022
- [j7]Mingyu Liang, Ioanna Karantaidou, Foteini Baldimtsi, S. Dov Gordon, Mayank Varia:
(∈, δ)-Indistinguishable Mixing for Cryptocurrencies. Proc. Priv. Enhancing Technol. 2022(1): 49-74 (2022) - [j6]S. Dov Gordon, Carmit Hazay, Phi Hung Le:
Fully Secure PSI via MPC-in-the-Head. Proc. Priv. Enhancing Technol. 2022(3): 291-313 (2022) - [j5]Foteini Baldimtsi, Panagiotis Chatzigiannis, S. Dov Gordon, Phi Hung Le, Daniel McVicker:
gOTzilla: Efficient Disjunctive Zero-Knowledge Proofs from MPC in the Head, with Application to Proofs of Assets in Cryptocurrencies. Proc. Priv. Enhancing Technol. 2022(4): 229-249 (2022) - [c27]S. Dov Gordon, Jonathan Katz, Mingyu Liang, Jiayu Xu:
Spreading the Privacy Blanket: - Differentially Oblivious Shuffling for Differential Privacy. ACNS 2022: 501-520 - [c26]Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Secure Sampling with Sublinear Communication. TCC (2) 2022: 348-377 - [i27]Foteini Baldimtsi, Panagiotis Chatzigiannis, S. Dov Gordon, Phi Hung Le, Daniel McVicker:
gOTzilla: Efficient Disjunctive Zero-Knowledge Proofs from MPC in the Head, with Application to Proofs of Assets in Cryptocurrencies. IACR Cryptol. ePrint Arch. 2022: 170 (2022) - [i26]S. Dov Gordon, Carmit Hazay, Phi Hung Le:
Fully Secure PSI via MPC-in-the-Head. IACR Cryptol. ePrint Arch. 2022: 379 (2022) - [i25]Dana Dachman-Soled, Seung Geol Choi, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Secure Sampling with Sublinear Communication. IACR Cryptol. ePrint Arch. 2022: 660 (2022) - [i24]S. Dov Gordon, Carmit Hazay, Phi Hung Le, Mingyu Liang:
More Efficient (Reusable) Private Set Union. IACR Cryptol. ePrint Arch. 2022: 713 (2022) - [i23]S. Dov Gordon, Phi Hung Le, Daniel McVicker:
Linear Communication in Malicious Majority MPC. IACR Cryptol. ePrint Arch. 2022: 781 (2022) - 2021
- [c25]Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Compressed Oblivious Encoding for Homomorphically Encrypted Search. CCS 2021: 2277-2291 - [c24]S. Dov Gordon, Daniel Starin, Arkady Yerukhimovich:
The More the Merrier: Reducing the Cost of Large Scale MPC. EUROCRYPT (2) 2021: 694-723 - [i22]Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Compressed Oblivious Encoding for Homomorphically Encrypted Search. CoRR abs/2109.07708 (2021) - [i21]S. Dov Gordon, Daniel Starin, Arkady Yerukhimovich:
The More The Merrier: Reducing the Cost of Large Scale MPC. IACR Cryptol. ePrint Arch. 2021: 303 (2021) - [i20]Mingyu Liang, Ioanna Karantaidou, Foteini Baldimtsi, S. Dov Gordon, Mayank Varia:
(ε, δ)-indistinguishable Mixing for Cryptocurrencies. IACR Cryptol. ePrint Arch. 2021: 1197 (2021) - [i19]Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Compressed Oblivious Encoding for Homomorphically Encrypted Search. IACR Cryptol. ePrint Arch. 2021: 1199 (2021) - [i18]S. Dov Gordon, Jonathan Katz, Mingyu Liang, Jiayu Xu:
Spreading the Privacy Blanket: Differentially Oblivious Shuffling for Differential Privacy. IACR Cryptol. ePrint Arch. 2021: 1257 (2021) - 2020
- [c23]Sahar Mazloom, Phi Hung Le, Samuel Ranellucci, S. Dov Gordon:
Secure parallel computation on national scale volumes of data. USENIX Security Symposium 2020: 2487-2504
2010 – 2019
- 2019
- [j4]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage Resilience from Program Obfuscation. J. Cryptol. 32(3): 742-824 (2019) - [c22]Ryan Wails, Aaron Johnson, Daniel Starin, Arkady Yerukhimovich, S. Dov Gordon:
Stormy: Statistics in Tor by Measuring Securely. CCS 2019: 615-632 - [c21]Phi Hung Le, Samuel Ranellucci, S. Dov Gordon:
Two-party Private Set Intersection with an Untrusted Third Party. CCS 2019: 2403-2420 - [i17]Phi Hung Le, Samuel Ranellucci, S. Dov Gordon:
Two-party Private Set Intersection with an Untrusted Third Party. IACR Cryptol. ePrint Arch. 2019: 1338 (2019) - 2018
- [c20]Daniel Genkin, S. Dov Gordon, Samuel Ranellucci:
Best of Both Worlds in Secure Computation, with Low Communication Overhead. ACNS 2018: 340-359 - [c19]S. Dov Gordon, Samuel Ranellucci, Xiao Wang:
Secure Computation with Low Communication from Cross-Checking. ASIACRYPT (3) 2018: 59-85 - [c18]S. Dov Gordon, Jonathan Katz, Xiao Wang:
Simple and Efficient Two-Server ORAM. ASIACRYPT (3) 2018: 141-157 - [c17]Sahar Mazloom, S. Dov Gordon:
Secure Computation with Differentially Private Access Patterns. CCS 2018: 490-507 - [i16]Xiao Wang, S. Dov Gordon, Jonathan Katz:
Simple and Efficient Two-Server ORAM. IACR Cryptol. ePrint Arch. 2018: 5 (2018) - [i15]S. Dov Gordon, Samuel Ranellucci, Xiao Wang:
Secure Computation with Low Communication from Cross-checking. IACR Cryptol. ePrint Arch. 2018: 216 (2018) - 2017
- [i14]Sahar Mazloom, S. Dov Gordon:
Differentially Private Access Patterns in Secure Computation. IACR Cryptol. ePrint Arch. 2017: 1016 (2017) - 2016
- [c16]Xiao Wang, S. Dov Gordon, Allen McIntosh, Jonathan Katz:
Secure Computation of MIPS Machine Code. ESORICS (2) 2016: 99-117 - [c15]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage-Resilient Public-Key Encryption from Obfuscation. Public Key Cryptography (2) 2016: 101-128 - [i13]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage-Resilient Public-Key Encryption from Obfuscation. IACR Cryptol. ePrint Arch. 2016: 730 (2016) - 2015
- [c14]S. Dov Gordon, Feng-Hao Liu, Elaine Shi:
Constant-Round MPC with Fairness and Guarantee of Output Delivery. CRYPTO (2) 2015: 63-82 - [c13]S. Dov Gordon, Jonathan Katz, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Multi-Client Verifiable Computation with Stronger Security Guarantees. TCC (2) 2015: 144-168 - [i12]S. Dov Gordon, Jonathan Katz, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Multi-Client Verifiable Computation with Stronger Security Guarantees. IACR Cryptol. ePrint Arch. 2015: 142 (2015) - [i11]S. Dov Gordon, Feng-Hao Liu, Elaine Shi:
Constant-Round MPC with Fairness and Guarantee of Output Delivery. IACR Cryptol. ePrint Arch. 2015: 371 (2015) - [i10]Xiao Wang, S. Dov Gordon, Allen McIntosh, Jonathan Katz:
Secure Computation of MIPS Machine Code. IACR Cryptol. ePrint Arch. 2015: 547 (2015) - 2014
- [j3]S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich:
Authenticated broadcast with a partially compromised public-key infrastructure. Inf. Comput. 234: 17-25 (2014) - [c12]Shafi Goldwasser, S. Dov Gordon, Vipul Goyal, Abhishek Jain, Jonathan Katz, Feng-Hao Liu, Amit Sahai, Elaine Shi, Hong-Sheng Zhou:
Multi-input Functional Encryption. EUROCRYPT 2014: 578-602 - 2013
- [c11]S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee:
Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction. EUROCRYPT 2013: 575-591 - [c10]Joël Alwen, Manuel Barbosa, Pooya Farshim, Rosario Gennaro, S. Dov Gordon, Stefano Tessaro, David A. Wilson:
On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption. IMACC 2013: 65-84 - [i9]S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee:
Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction. IACR Cryptol. ePrint Arch. 2013: 267 (2013) - [i8]S. Dov Gordon, Jonathan Katz, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Multi-Input Functional Encryption. IACR Cryptol. ePrint Arch. 2013: 774 (2013) - 2012
- [j2]S. Dov Gordon, Jonathan Katz:
Partial Fairness in Secure Two-Party Computation. J. Cryptol. 25(1): 14-40 (2012) - [c9]S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Fernando Krell, Tal Malkin, Mariana Raykova, Yevgeniy Vahlis:
Secure two-party computation in sublinear (amortized) time. CCS 2012: 513-524 - 2011
- [j1]S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
Complete Fairness in Secure Two-Party Computation. J. ACM 58(6): 24:1-24:37 (2011) - [i7]S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan:
A Group Signature Scheme from Lattice Assumptions. IACR Cryptol. ePrint Arch. 2011: 60 (2011) - [i6]S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Tal Malkin, Mariana Raykova, Yevgeniy Vahlis:
Secure Computation with Sublinear Amortized Work. IACR Cryptol. ePrint Arch. 2011: 482 (2011) - 2010
- [b1]Samuel Dov Gordon:
On Fairness in Secure Computation. University of Maryland, College Park, MD, USA, 2010 - [c8]S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan:
A Group Signature Scheme from Lattice Assumptions. ASIACRYPT 2010: 395-412 - [c7]S. Dov Gordon, Jonathan Katz:
Partial Fairness in Secure Two-Party Computation. EUROCRYPT 2010: 157-176 - [c6]S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich:
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations. LATINCRYPT 2010: 189-204 - [c5]S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich:
Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. SSS 2010: 144-158 - [c4]S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai:
On Complete Primitives for Fairness. TCC 2010: 91-108
2000 – 2009
- 2009
- [c3]S. Dov Gordon, Jonathan Katz:
Complete Fairness in Multi-party Computation without an Honest Majority. TCC 2009: 19-35 - [i5]S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich:
Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. IACR Cryptol. ePrint Arch. 2009: 410 (2009) - 2008
- [c2]S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
Complete fairness in secure two-party computation. STOC 2008: 413-422 - [i4]S. Dov Gordon, Jonathan Katz:
Partial Fairness in Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2008: 206 (2008) - [i3]S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
Complete Fairness in Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2008: 303 (2008) - [i2]S. Dov Gordon, Jonathan Katz:
Complete Fairness in Multi-Party Computation Without an Honest Majority. IACR Cryptol. ePrint Arch. 2008: 458 (2008) - 2006
- [c1]S. Dov Gordon, Jonathan Katz:
Rational Secret Sharing, Revisited. SCN 2006: 229-241 - [i1]S. Dov Gordon, Jonathan Katz:
Rational Secret Sharing, Revisited. IACR Cryptol. ePrint Arch. 2006: 142 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
