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 38 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Fully Secure PSI via MPC-in-the-Head.
Proc. Priv. Enhancing Technol., 2022

gOTzilla: Efficient Disjunctive Zero-Knowledge Proofs from MPC in the Head, with Application to Proofs of Assets in Cryptocurrencies.
Proc. Priv. Enhancing Technol., 2022

Linear Communication in Malicious Majority MPC.
IACR Cryptol. ePrint Arch., 2022

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

Secure Sampling with Sublinear Communication.
IACR Cryptol. ePrint Arch., 2022

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

The More The Merrier: Reducing the Cost of Large Scale MPC.
IACR Cryptol. ePrint Arch., 2021

Spreading the Privacy Blanket: Differentially Oblivious Shuffling for Differential Privacy.
IACR Cryptol. ePrint Arch., 2021

Compressed Oblivious Encoding for Homomorphically Encrypted Search.
IACR Cryptol. ePrint Arch., 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

Two-party Private Set Intersection with an Untrusted Third Party.
IACR Cryptol. ePrint Arch., 2019

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

2018
Secure Computation with Low Communication from Cross-checking.
IACR Cryptol. ePrint Arch., 2018

Simple and Efficient Two-Server ORAM.
IACR Cryptol. ePrint Arch., 2018

Secure Computation with Differentially Private Access Patterns.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 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.
IACR Cryptol. ePrint Arch., 2016

2015
Secure Computation of MIPS Machine Code.
IACR Cryptol. ePrint Arch., 2015

Constant-Round MPC with Fairness and Guarantee of Output Delivery.
IACR Cryptol. ePrint Arch., 2015

Multi-Client Verifiable Computation with Stronger Security Guarantees.
IACR Cryptol. ePrint Arch., 2015

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

2013
Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction.
IACR Cryptol. ePrint Arch., 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

2012
Partial Fairness in Secure Two-Party Computation.
J. Cryptol., 2012

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

2011
Complete Fairness in Secure Two-Party Computation.
J. ACM, 2011

A Group Signature Scheme from Lattice Assumptions.
IACR Cryptol. ePrint Arch., 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

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

2009
Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure.
IACR Cryptol. ePrint Arch., 2009

2008
Complete Fairness in Multi-Party Computation Without an Honest Majority.
IACR Cryptol. ePrint Arch., 2008

2006
Rational Secret Sharing, Revisited.
IACR Cryptol. ePrint Arch., 2006


  Loading...