S. Dov Gordon

Orcid: 0009-0001-6490-1786

Affiliations:
  • George Mason University, Fairfax, VA, USA
  • University of Maryland, College Park, MD, USA (PhD 2010)


According to our database1, S. Dov Gordon authored at least 40 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Universal Vector Commitments.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Fast Two-party Threshold ECDSA with Proactive Security.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Linear Communication in Malicious Majority MPC.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
(∈, δ)-Indistinguishable Mixing for Cryptocurrencies.
Proc. Priv. Enhancing Technol., 2022

More Efficient (Reusable) Private Set Union.
IACR Cryptol. ePrint Arch., 2022

Fully Secure PSI via MPC-in-the-Head.
IACR Cryptol. ePrint Arch., 2022

gOTzilla: Efficient Disjunctive Zero-Knowledge Proofs from MPC in the Head, with Application to Proofs of Assets in Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2022

Secure Sampling with Sublinear Communication.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Spreading the Privacy Blanket: - Differentially Oblivious Shuffling for Differential Privacy.
Proceedings of the Applied Cryptography and Network Security, 2022

2021
(ε, δ)-indistinguishable Mixing for Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2021

The More the Merrier: Reducing the Cost of Large Scale MPC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Compressed Oblivious Encoding for Homomorphically Encrypted Search.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Secure parallel computation on national scale volumes of data.
Proceedings of the 29th USENIX Security Symposium, 2020

2019
Leakage Resilience from Program Obfuscation.
J. Cryptol., 2019

Stormy: Statistics in Tor by Measuring Securely.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Two-party Private Set Intersection with an Untrusted Third Party.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Secure Computation with Differentially Private Access Patterns.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

Secure Computation with Low Communication from Cross-Checking.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

Simple and Efficient Two-Server ORAM.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

Best of Both Worlds in Secure Computation, with Low Communication Overhead.
Proceedings of the Applied Cryptography and Network Security, 2018

2017
Differentially Private Access Patterns in Secure Computation.
IACR Cryptol. ePrint Arch., 2017

2016
Leakage-Resilient Public-Key Encryption from Obfuscation.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Secure Computation of MIPS Machine Code.
Proceedings of the Computer Security - ESORICS 2016, 2016

2015
Multi-Client Verifiable Computation with Stronger Security Guarantees.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Constant-Round MPC with Fairness and Guarantee of Output Delivery.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Multi-input Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Multi-Input Functional Encryption.
IACR Cryptol. ePrint Arch., 2013

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption.
Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction.
Proceedings of the Advances in Cryptology, 2013

2012
Secure two-party computation in sublinear (amortized) time.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Secure Computation with Sublinear Amortized Work.
IACR Cryptol. ePrint Arch., 2011

2010
On Fairness in Secure Computation.
PhD thesis, 2010

On Complete Primitives for Fairness.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations.
Proceedings of the Progress in Cryptology, 2010

Partial Fairness in Secure Two-Party Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

A Group Signature Scheme from Lattice Assumptions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Complete Fairness in Multi-party Computation without an Honest Majority.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008
Complete fairness in secure two-party computation.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2006
Rational Secret Sharing, Revisited.
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006


  Loading...