Generic Compiler for Publicly Verifiable Covert Multi-Party Computation

Eurocrypt 2021

Blinder: MPC Based Scalable and Robust Anonymous Committed Broadcast

To appear in ACM CCS 2020

PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server

In IEEE S&P 2020

Multi-Clients Verifiable Computation via Conditional Disclosure of Secrets

In the Conference of Security and Cryptography for Networks (SCN), Springer-Verlag (LNCS 12238), pages 150-172, 2020

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography

To appear in PKC 2020.

Gradual GRAM and Secure Computation for RAM Programs

In the Conference of Security and Cryptography for Networks (SCN), Springer-Verlag (LNCS 12238), pages 233-252, 2020

PSI from PaXoS: Fast, Malicious Private Set Intersection

In EUROCRYPT Springer-Verlag (LNCS 12106), pages 739-767, 2020

Towards Scalable Threshold Cryptosystems

In IEEE S&P 2020

Flaw Label: Exploiting IPv6 Flow Label

In IEEE S&P 2020

OptORAMa: Optimal Oblivious RAM

EUROCRYPT 2020

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

To appear in Journal of Cryptography

Oblivious Parallel Tight Compaction

Information Theoretic Cryptography (ITC) 2020

The Price of Active Security in Cryptographic Protocols

In EUROCRYPT Springer-Verlag (LNCS 12106), pages 184-215, 2020

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?

In EUROCRYPT Springer-Verlag (LNCS 12106), pages 599-619, 2020

Going Beyond Dual Execution: MPC for Functions with Efficient Verification

In Public Key Cryptography (PKC) Springer-Verlag (LNCS 12111), pages 328-356, 2020

Fast Actively Secure Five-Party Computation with Security Beyond Abort.

In the ACM Conference on Computer and Communications Security (ACM CCS), pages 1573-1590 2019.

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model

The Journal of Cryptology 32(4): 1144-1199 (2019).

Make Some ROOM for the Zeros: Data Sparsity in Secure Distributed Machine Learning

ACM CCS '2019

On Black-Box Complexity of Universally Composable Security in the CRS model

In the Journal of Cryptology 32(3): 635-689 (2019).

Efficient Circuit-based PSI with Linear Communication

In EUROCRYPT, 2019

DNS Cache-Based User Tracking

In NDSS 2019.

LevioSA: Lightweight Secure Arithmetic Computation

In the ACM Conference on Computer and Communications Security (ACM CCS), pages 327-344 2019.

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension

In CRYPTO, 2019

How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior

In ACM CCS 2019

A Privacy Preserving Collusion Secure DCOP Algorithm

In IJCAI, 2019

Adversarial Examples on Discrete Sequences for Beating Whole-Binary Malware Detection

Manuscript

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting

In the Journal of Cryptology 32(2): 265-323

Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs

In ACM CCS 2019, pages 869-886, 2019.

From IP ID to Device ID and KASLR Bypass

Usenix Security 2019

Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest

In the 26th ACM CCS, pages 1557-1571, 2019

On the Power of Secure Two-Party Computation

In the Journal of Cryptology 32(4): 1200-1262

What Security Can We Achieve within 4 Rounds?

The Journal of Cryptology 32(4): 1200-1262 (2019).

High-Throughput Secure AES Computation

Workshop on Encrypted Computing and Applied Homomorphic Cryptography '2018

Efficient MPC from Syndrome Decoding.

In CRYPTO, Springer-Verlag (LNCS 10993), pages 3-33, 2018.

Efficient Maliciously Secure Multiparty Computation for RAM

In EUROCRYPT, 2018 pages 91-124.

Round-Optimal Secure Multi-Party Computation.

In CRYPTO, Springer-Verlag (LNCS 10993), pages 488-520, 2018.

How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior

Generalizing the SPDZ Compiler For Other Protocols

In the 25th ACM CCS, pages 880-895, 2018

Fast Garbling of Circuits over 3-Valued Logic

In the 21st PKC, Springer (LNCS 10769), pages 620-643, 2018

Efficient Construction of the Kite Generator Revisited

CSCML 2018: 6-19

An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants

In the 25th ACM CCS, pages 695-712, 2018

Committed MPC – Maliciously Secure Multiparty Computation from Homomorphic Commitments

PKC '2018

Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody

In the 25th ACM CCS, pages 1837-1854, 2018.

Privacy-Preserving Search of Similar Patients in Genomic Data

To appear at PETS 2018.

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

In the Journal of Cryptology 31(2): 537-586 (2018).

Efficient Distributed SSH Key Management with Proactive RSA Threshold Signatures

ACNS '2018

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

In CRYPTO 2018, Springer (LNCS 10993), pages 34-64, 2018.

Outsourced Pattern Matching.

In the International Journal of Information Security 17(3): 327-346 (2018)

Efficient Circuit-based PSI via Cuckoo Hashing

Eurocrypt '2018

Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries

In CRYPTO 2018, Springer (LNCS 10992), pages 331-361, 2018

Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring

Usenix Security '2018

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)

In ASIACRYPT, Springer-Verlag (LNCS 11274), pages 86-117, 2018.

Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries

Crypto '2018

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations

In TCC, Springer-Verlag (LNCS 11239), pages 263-285, 2018.

Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters

SCN '2018

Private Set Intersection for Unequal Set Sizes with Mobile Applications

High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

In EUROCRYPT 2017, Springer (LNCS 10211), pages 225-255, 2017

Cryptanalysis of GOST2

IACR Trans. Symmetric Cryptol. 2017(1): 203-214 (2017)

Faster Secure Cloud Computations with a Trusted Proxy

Optimized Honest-Majority MPC for Malicious Adversaries – Breaking the 1 Billion-Gate Per Second Barrier.

In the 38th IEEE Security and Privacy Conference

Optimal Backup Strategies Against Cyber Attacks

CoRR abs/1704.02659 (2017)

The Circle Game: Scalable Private Membership Test Using Trusted Hardware

Asia CCS '2017

Efficient Construction of Diamond Structures

INDOCRYPT 2017: 166-185

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup

PKC 2017

Scalable Private Set Intersection Based on OT Extension

Submitted to the ACM Transactions on Privacy and Security

Fast Secure Two-Party ECDSA Signing.

In CRYPTO 2017, Springer (LNCS 10402), pages 613-644, 2017.

One-Sided Adaptively Secure Two-Party Computation.

In the Journal of Cryptology 30(1): 321-371 (2017).

Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation

In the 24th ACM CCS, pages 1019-1036, 2017. Recipient of the best-paper award.

Scalable Multi-Party Private Set-Intersection

In Public Key Cryptography (PKC), Springer-Verlag (LNCS 10174), pages 175-203, 2017.

A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority

In the 24th ACM CCS, pages 259-276, 2017.

Constant-Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.

In Public Key Cryptography (PKC), Springer-Verlag (LNCS 10175), pages 428-460, 2017.

Efficient Scalable Constant-Round MPC via Garbled Circuits

In ASIACRYPT 2017, Springer (LNCS 10625), pages 471-498, 2017.

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

In the ACM Conference on Computer and Communications Security (ACM CCS), pages 2087-2104 2017.

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques

Secure Two-Party Computation with Fairness – A Necessary Design Principle

In TCC 2017, Springer (LNCS 10677), pages 565-580, 2017.

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.

In ASIACRYPT, Springer-Verlag (LNCS 10624), pages 598-628, 2017.

Securely Computing a Ground Speed Model

Efficient Slide Attacks

. IACR Cryptology ePrint Archive 2016: 1177 (2016)

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.

In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 10678), pages 3-39, 2017.

Efficient Set Intersection with Simulation-Based Security

In the Journal of Cryptology 29(1): 115-155 (2016)

Composable Adaptive Secure Protocols without Setup under Polytime Assumptions

In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 400-432, 2016

Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity

In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 367-399, 2016

Efficient Maliciously Secure Multiparty Computation for RAM

What Security Can We Achieve within 4 Rounds?

In SCN, pages 486-505, 2016

Maturity and Performance of Programmable Secure Computation

IEEE Security and Privacy Journal, Vol. 14, Issue 5, 2016.

The Feasibility of Outsourced Database Search in the Plain Model

In SCN, pages 313-332, 2016

On the Power of Secure Two-Party Computation

In CRYPTO, Springer-Verlag (LNCS 9815), pages 397-429, 2016

On Adaptively Secure Multiparty Computation with a Short CRS

In Security and Cryptography for Networks, SCN 2016, Springer (LNCS 9841), pages 129–146, 2016.

Probabilistic Termination and Composability of Cryptographic Protocols

In Advances of Cryptology, CRYPTO 2016, Part III, Springer (LNCS 9816), pages 240–269, 2016.

Asynchronous Secure Multiparty Computation in Constant Time

In Public-Key Cryptography, PKC 2016, Part II, Springer (LNCS 9615), pages 183–207, 2016.

Towards a Game Theoretic View of Secure Computation

In the Journal of Cryptology 29(4): 879-926 (2016)

Characterization of Secure Multiparty Computation without Broadcast

In Theory of Cryptography, TCC 2016-A, Part I, Springer (LNCS 9562), pages 596–616, 2016.

Signature Schemes Secure against Hard-to-Invert Leakage

In the Journal of Cryptology 29(2): 422-455 (2016)

Leakage-Resilient Cryptography from Minimal Assumptions

In the Journal of Cryptology 29(3): 514-551 (2016).

How To Simulate It – A Tutorial on the Simulation Proof Technique

Cryptology ePrint Archive: Report 2016/046, 2016.

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model

In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 521-553, 2016

Attribute-based Key Exchange with General Policies

In the 23rd ACM CCS, pages 1451-1463, 2016.

High-Throughput Semi-Honest Secure Three- Party Computation with an Honest Majority

The 23rd ACM CCS, 2016

More Efficient Constant-Round Multi-Party Computation from BMR and SHE

In TCC 2016-B, Springer (LNCS 9985), pages 554-581, 2016

Optimizing Semi-Honest Secure Multiparty Computation for the Internet.

In the 23rd ACM CCS, pages 578-590, 2016

Phasing: Private Set Intersection Using Permutation-baSED Hashing

Proceedings of the 24th USENIX Conference on Security Symposium (SEC'15), Jaeyeon Jung (Ed.). USENIX Association, Berkeley, CA, USA, 515-530.

Selective Opening Security for Receivers

In ASIACRYPT, Springer-Verlag (LNCS 9453), pages 443-469, 2015

On Black-Box Complexity of Universally Composable Security in the CRS Model

In ASIACRYPT, Springer-Verlag (LNCS 9453), pages 183-209, 2015

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.

In CRYPTO 2015, Springer (LNCS 9216), pages 3-22, 2015.

Adaptively Secure Computation with Partial Erasures.

In ACM PODC 2015, pages 291-300, 2015.

An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle.

In TCC 2015, Springer (LNCS 9014), pages 93-109, 2015

Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries

In 22nd ACM CCS, pages 579-590, 2015

Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ.

In CRYPTO 2015, Springer (LNCS 9216), pages 319-338, 2015.

Fast Garbling of Circuits Under Standard Assumptions.

In 22nd ACM CCS, pages 567-578, 2015

GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte

In 22nd ACM CCS, pages 109-119, 2015.

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

In EUROCRYPT 2015, Springer(LNCS 9056), pages 673-701, 2015

Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation

In Advances in Cryptology, ASIACRYPT 2014, Part II, Springer (LNCS 8873), pages 466–485, 2014

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

To appear in the Journal of Cryptology.

A Simple Recursive Tree Oblivious RAM

Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings

In CRYPTO 2014, Springer (LNCS 8617), pages 476-494, 2014

Faster Private Set Intersection based on OT Extension

Towards Characterizing Complete Fairness in Secure Two-Party Computation

In the 11th TCC, Springer (LNCS 8349), pages 291-316, 2014

A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness

In the 10th TCC, Springer (LNCS 7785), pages 243-262, 2013

A Note on Constant-Round Zero-Knowledge Proofs of Knowledge

In the Journal of Cryptology, 26(4), pages 638-654, 2013

Canon-MPC, a System for Casual Non-Interactive Secure Multi-Party Computation Using Native Client

In the Proceedings of the 12th ACM Workshop on Privacy in the Electronic Society, pages 155-166, 2013.

Fair and Efficient Secure Multiparty Computation with Reputation Systems

In ASIACRYPT 2013, Springer (LNCS 8270), pages 201-220, 2013

Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries

In CRYPTO 2013, Springer (LNCS 8043), pages 1-17, 2013

Hiding the Input-Size in Secure Two-Party Computation

In ASIACRYPT 2013, Springer (LNCS 8270), pages 421-440, 2013.

Limits on the Usefulness of Random Oracles

In the 10th TCC, Springer (LNCS 7785), pages 437-456, 2013

More Efficient Oblivious Transfer and Extensions for Faster Secure Computation

In the 20th ACM Conference on Computer and Communications security (ACM CCS), pages 535-548, 2013

On the Feasibility of Extending Oblivious Transfer

In the 10th TCC, Springer (LNCS 7785), pages 519-538, 2013

Secure Computation of Functionalities Based on Hamming Distance and its Application to Computing Document Similarity

International Journal of Applied Cryptography 3(1), pages 21-46, 2013

Calling Out Cheaters: Covert Security with Public Verifiability

In ASIACRYPT 2012, Springer (LNCS 7658), pages 681-698, 2012

Completeness for Symmetric Two-Party Functionalities – Revisited

In ASIACRYPT 2012, Springer (LNCS 7658), pages 116-133, 2012

Firm Grip Handshakes: A Tool for Bidirectional Vouching

Cryptology and Network Security, (LNCS 7712) pages 142-157  

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

In EUROCRYPT 2012, Springer (LNCS 7237), pages 483-501, 2012

SCAPI: The Secure Computation Application Programming Interface

Technical Report

Secure Computing in the Cloud

Dagstuhl Reports, Vol. 1 Issue 12 pages 1-11, 2012

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

Journal of Cryptology 25(4), pages 680-722, 2012

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds

In CRYPTO 2011, Springer (LNCS 6841), pages 277-296, 2011

Highly-Efficient Universally Composable Commitments based on the DDH Assumption

In EUROCRYPT 2011, Springer (LNCS 6632), pages 446-466, 2011.

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

In the Journal of Cryptology, 24(3):517-544, 2011

On the Black-Box Complexity of Optimally-Fair Coin Tossing

In the 8th TCC, Springer (LNCS 6597), pages 450-467, 2011

Perfectly-Secure Multiplication for any n/3

In CRYPTO 2011, Springer (LNCS 6841), pages 240-258, 2011

Proofs of Ownership in Remote Storage Systems

Proceedings of the 18th ACM Conference on Computer and Communications Security, pages 491-500, 2011

Secure Computation on the Web: Computing without Simultaneous Interaction

In CRYPTO 2011, Springer (LNCS 6841), pages 132-150, 2011

The IPS Compiler: Optimizations, Variants and Concrete Efficiency

In CRYPTO 2011, Springer (LNCS 6841), pages 259-276, 2011. This is the preliminary full version

Towards a Game Theoretic View of Secure Computation

In EUROCRYPT 2011, Springer (LNCS 6632), pages 426-445, 2011

Private Web Search with Malicious Adversaries

In the 10th Privacy Enhancing Technologies Symposium (PETS), 2010. The conference version of this paper contained a serious error which is fixed in this draft of the full version

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

In the Journal of Cryptology, 24(4):761-799, 2011. An extended abstract appeared in the 6th TCC, Springer (LNCS 5444), pages 183-201, 2009  

Adaptively Secure Two-Party Computation with Erasures

In CT-RSA, Springer (LNCS 5473), pages 117-132, 2009. Full version available

Collusion-Free Multiparty Computation in the Mediated Model

In CRYPTO 2009, Springer-Verlag (LNCS 5677), pages 524-540, 2009

Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1

Secure Multiparty Computation for Privacy-Preserving Data Mining

In the Journal of Privacy and Confidentiality, 1(1):59-98, 2009

Utility Dependence in Correct and Fair Rational Secret Sharing

In the Journal of Cryptology, 24(1):157-202, 2011. An extended abstract appeared in CRYPTO 2009, Springer-Verlag (LNCS 5677), pages 559-576, 2009

Aggregate Message Authentication Codes

In CT-RSA, Springer (LNCS 4964), pages 155-169, 2008

Complete Fairness in Secure Two-Party Computation

To appear in the Journal of the ACM. An extended abstract appeared in the 40th STOC, pages 413-422, 2008

Constructions of Truly Practical Secure Protocols using Standard Smartcards

In the 15th ACM Conference on Computer and Communications Security (ACM CCS), pages 491-500, 2008. Full version available

Efficient Fully-Simulatable Oblivious Transfer

In the Chicago Journal of Theoretical Computer Science, 2008. Preliminary version appeared in CT-RSA, Springer (LNCS 4964), pages 52-70, 2008.

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

In the Journal of Cryptology, 23(3):422-456, 2010. An extended abstract appeared in TCC 2008, Springer (LNCS 4948) pages 155-175, 2008

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

In the Journal of Cryptology, 23(3):422-456, 2010. An extended abstract appeared in TCC 2008, Springer (LNCS 4948) pages 155-175, 2008  

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

In the 6th Conference on Security and Cryptography for Networks, Springer (LNCS 5229), pages 2-20, 2008

Legally Enforceable Fairness in Secure Two-Party Computation

In CT-RSA, Springer (LNCS 4964), pages 121-137, 2008

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

In Eurocrypt 2007, Springer-Verlag (LNCS 4515), pages 52-78, 2007. Full version available

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions

In TCC 2007, Springer-Verlag (LNCS 4392), pages 323-341, 2007.

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

In the Journal of Cryptology, 23(2):281-343, 2010. An extended abstract appeared in TCC 2007, Springer-Verlag (LNCS 4392), pages 137-156, 2007.

A Proof of Security of Yao’s Protocol for Two-Party Computation

In the Journal of Cryptology, 22(2):161-188, 2009

Black-Box Constructions for Secure Computation

In the 38th STOC, pages 99-108, 2006

Black-Box Constructions of Protocols for Secure Computation

In the SIAM Journal on Computing, 40(2):225-266, 2011.

Information-Theoretically Secure Protocols and Security Under Composition

In the SIAM Journal on Computing, 39(4):2090-2112, 2010. An extended abstract appeared in the 38th STOC, pages 109-118, 2006.

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation

In CRYPTO 2006, Springer-Verlag (LNCS 4117), pages 483-500, 2006 The full version appears

Concurrent Composition of Secure Protocols in the Timing Model

In the Journal of Cryptology, 20(4):431-492, 2007. An extended abstract appeared in the 37th STOC, pages 644-653, 2005

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.

In the Journal of Cryptology, 21(3):303-349, 2008. An extended abstract appeared in the 2nd Annual Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 3378), pages 128-149, 2005.

Secure Computation Without Authentication

In the Journal of Cryptology, 24(4):720-760, 2011. An extended abstract appeared in CRYPTO 2005, Springer-Verlag (LNCS 3621), pages 361-377, 2005

Universally Composable Password-Based Key Exchange

In EUROCRYPT 2005, Springer-Verlag (LNCS 3494), pages 404-421, 2005

Lower Bounds and Impossibility Results for Concurrent Self Composition

In the Journal of Cryptology, 21(2):200-249, 2008. This version combines the results of the paper Lower Bounds for Concurrent Self Composition at TCC 2004 together with the lower bound from the paper Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions at STOC 2003.

Lower Bounds for Concurrent Self Composition

In the 1st Annual Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 2951), pages 203-222, 2004. See above for the full version of this paper.

Protocol Initialization for the Framework of Universal Composability