We stand with Ukraine

We stand with Ukraine

Xiao Wang

Orcid: 0000-0002-5991-7417

Affiliations:

Northwestern University, Department of Computer Science, Evanston, IL, USA
Boston University, Department of Computer Science, MA, USA
Massachusetts Institute of Technology, CSAIL, Cambridge, MA, USA
University of Maryland, College Park, MD, USA (former)

According to our database¹, Xiao Wang authored at least 66 papers between 2014 and 2023.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2023

Sok: vector OLE-based zero-knowledge protocols.

[BibT_eX]

[DOI]

,

,

,

Des. Codes Cryptogr., November, 2023

The Multi-User Constrained Pseudorandom Function Security of Generalized GGM Trees for MPC and Hierarchical Wallets.

[BibT_eX]

[DOI]

,

,

,

ACM Trans. Priv. Secur., August, 2023

Private Multi-Winner Voting for Machine Learning.

[BibT_eX]

[DOI]

,

Christopher A. Choquette-Choo

,

Natalie Dullerud

,

Vinith M. Suriyakumar

,

Ali Shahin Shamsabadi

,

Muhammad Ahmad Kaleem

,

,

Nicolas Papernot

,

Proc. Priv. Enhancing Technol., January, 2023

Efficient and Secure Quantile Aggregation of Private Data Streams.

[BibT_eX]

[DOI]

,

,

,

IEEE Trans. Inf. Forensics Secur., 2023

ZKSQL: Verifiable and Efficient Query Evaluation with Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

,

,

,

,

Proc. VLDB Endow., 2023

RESCU-SQL: Oblivious Querying for the Zero Trust Cloud.

[BibT_eX]

[DOI]

,

,

,

,

Proc. VLDB Endow., 2023

Ou: Automating the Parallelization of Zero-Knowledge Protocols.

[BibT_eX]

[DOI]

,

,

,

,

Timos Antonopoulos

,

,

,

IACR Cryptol. ePrint Arch., 2023

Scalable Mixed-Mode MPC.

[BibT_eX]

[DOI]

,

,

,

IACR Cryptol. ePrint Arch., 2023

Robust and Actively Secure Serverless Collaborative Learning.

[BibT_eX]

[DOI]

,

,

Christopher A. Choquette-Choo

,

,

Muhammad Ahmad Kaleem

,

Stephan Rabanser

,

,

,

Nicolas Papernot

,

CoRR, 2023

Robust and Actively Secure Serverless Collaborative Learning.

[BibT_eX]

[DOI]

Nicholas Franzese

,

,

Christopher A. Choquette-Choo

,

,

Muhammad Ahmad Kaleem

,

Stephan Rabanser

,

,

,

Nicolas Papernot

,

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Confidential-PROFITT: Confidential PROof of FaIr Training of Trees.

[BibT_eX]

[DOI]

Ali Shahin Shamsabadi

,

Sierra Calanda Wyllie

,

Nicholas Franzese

,

Natalie Dullerud

,

Sébastien Gambs

,

Nicolas Papernot

,

,

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Deja Vu: Continual Model Generalization for Unseen Domains.

[BibT_eX]

[DOI]

,

,

,

,

,

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Half-Tree: Halving the Cost of Tree Expansion in COT and DPF.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Actively Secure Half-Gates with Minimum Overhead Under Duplex Networks.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022

Non-Interactive Zero-Knowledge Proofs to Multiple Verifiers.

[BibT_eX]

[DOI]

,

IACR Cryptol. ePrint Arch., 2022

AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication.

[BibT_eX]

[DOI]

,

,

,

,

IACR Cryptol. ePrint Arch., 2022

Proving UNSAT in Zero Knowledge.

[BibT_eX]

[DOI]

,

Timos Antonopoulos

,

William R. Harris

,

,

,

IACR Cryptol. ePrint Arch., 2022

The Hardness of LPN over Any Integer Ring and Field for PCG Applications.

[BibT_eX]

[DOI]

,

,

,

IACR Cryptol. ePrint Arch., 2022

Half-Tree: Halving the Cost of Tree Expansion in COT and DPF.

[BibT_eX]

[DOI]

,

,

,

,

,

,

IACR Cryptol. ePrint Arch., 2022

VaultDB: A Real-World Pilot of Secure Multi-Party Computation within a Clinical Research Network.

[BibT_eX]

[DOI]

,

Elizabeth Adetoro

,

,

,

,

Andrew Hamilton

,

,

Ashley Martinez

,

Erick Michalski

,

,

Fred D. Rachman

,

,

,

,

Theresa L. Walunas

,

,

CoRR, 2022

Non-Transferable Learning: A New Approach for Model Ownership Verification and Applicability Authorization.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Tenth International Conference on Learning Representations, 2022

Federated Class-Incremental Learning.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021

Provable Security of SP Networks with Partial Non-Linear Layers.

[BibT_eX]

[DOI]

,

François-Xavier Standaert

,

,

,

IACR Trans. Symmetric Cryptol., 2021

QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field.

[BibT_eX]

[DOI]

,

,

,

IACR Cryptol. ePrint Arch., 2021

Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning.

[BibT_eX]

[DOI]

,

,

,

,

IACR Cryptol. ePrint Arch., 2021

ppSAT: Towards Two-Party Private SAT Solving.

[BibT_eX]

[DOI]

,

,

Timos Antonopoulos

,

,

IACR Cryptol. ePrint Arch., 2021

Constant-Overhead Zero-Knowledge for RAM Programs.

[BibT_eX]

[DOI]

Nicholas Franzese

,

,

,

Rafail Ostrovsky

,

,

IACR Cryptol. ePrint Arch., 2021

Non-Transferable Learning: A New Approach for Model Verification and Authorization.

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2021

Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Practical Security and Privacy for Database Systems.

[BibT_eX]

[DOI]

,

,

,

Ashwin Machanavajjhala

,

,

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

CaPC Learning: Confidential and Private Collaborative Learning.

[BibT_eX]

[DOI]

Christopher A. Choquette-Choo

,

Natalie Dullerud

,

,

,

,

Nicolas Papernot

,

Proceedings of the 9th International Conference on Learning Representations, 2021

Addressing Class Imbalance in Federated Learning.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

SAQE: Practical Privacy-Preserving Approximate Query Processing for Data Federations.

[BibT_eX]

[DOI]

,

,

,

,

Proc. VLDB Endow., 2020

Ferret: Fast Extension for coRRElated oT with small communication.

[BibT_eX]

[DOI]

,

,

,

,

IACR Cryptol. ePrint Arch., 2020

Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits.

[BibT_eX]

[DOI]

,

,

,

IACR Cryptol. ePrint Arch., 2020

Triply Adaptive UC NIZK.

[BibT_eX]

[DOI]

,

,

IACR Cryptol. ePrint Arch., 2020

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security.

[BibT_eX]

[DOI]

,

,

IACR Cryptol. ePrint Arch., 2020

Blazing Fast OT for Three-Round UC OT Extension.

[BibT_eX]

[DOI]

,

,

IACR Cryptol. ePrint Arch., 2020

2019

More Efficient MPC from Improved Triple Generation and Authenticated Garbling.

[BibT_eX]

[DOI]

,

,

IACR Cryptol. ePrint Arch., 2019

Scalable Private Set Union from Symmetric-Key Techniques.

[BibT_eX]

[DOI]

Vladimir Kolesnikov

,

,

,

IACR Cryptol. ePrint Arch., 2019

Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting).

[BibT_eX]

[DOI]

,

,

,

,

IACR Cryptol. ePrint Arch., 2019

Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers.

[BibT_eX]

[DOI]

,

,

,

IACR Cryptol. ePrint Arch., 2019

Privacy Changes Everything.

[BibT_eX]

[DOI]

,

,

,

Ashwin Machanavajjhala

,

,

Proceedings of the Heterogeneous Data Management, Polystores, and Analytics for Healthcare, 2019

2018

A New Paradigm for Practical Maliciously Secure Multi-Party Computation.

[BibT_eX]

[DOI]

PhD thesis, 2018

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.

[BibT_eX]

[DOI]

,

Samuel Ranellucci

,

,

IACR Cryptol. ePrint Arch., 2018

Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures.

[BibT_eX]

[DOI]

,

Vladimir Kolesnikov

,

IACR Cryptol. ePrint Arch., 2018

Covert Security with Public Verifiability: Faster, Leaner, and Simpler.

[BibT_eX]

[DOI]

,

,

Vladimir Kolesnikov

,

,

IACR Cryptol. ePrint Arch., 2018

Secure Computation with Low Communication from Cross-checking.

[BibT_eX]

[DOI]

,

Samuel Ranellucci

,

IACR Cryptol. ePrint Arch., 2018

Simple and Efficient Two-Server ORAM.

[BibT_eX]

[DOI]

,

,

IACR Cryptol. ePrint Arch., 2018

2017

Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation.

[BibT_eX]

[DOI]

,

Samuel Ranellucci

,

IACR Cryptol. ePrint Arch., 2017

Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.

[BibT_eX]

[DOI]

,

Samuel Ranellucci

,

IACR Cryptol. ePrint Arch., 2017

Faster Secure Two-Party Computation in the Single-Execution Setting.

[BibT_eX]

[DOI]

,

Alex J. Malozemoff

,

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Global-Scale Secure Multiparty Computation.

[BibT_eX]

[DOI]

,

Samuel Ranellucci

,

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation.

[BibT_eX]

[DOI]

,

Samuel Ranellucci

,

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016

Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting.

[BibT_eX]

[DOI]

,

Alex J. Malozemoff

,

IACR Cryptol. ePrint Arch., 2016

Efficiently Enforcing Input Validity in Secure Two-party Computation.

[BibT_eX]

[DOI]

,

Alex J. Malozemoff

,

IACR Cryptol. ePrint Arch., 2016

Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation.

[BibT_eX]

[DOI]

,

,

Mariana Raykova

,

,

,

,

Proceedings of the IEEE Symposium on Security and Privacy, 2016

2015

iDASH Secure Genome Analysis Competition Using ObliVM.

[BibT_eX]

[DOI]

Xiao Shaun Wang

,

,

,

,

IACR Cryptol. ePrint Arch., 2015

Secure Computation of MIPS Machine Code.

[BibT_eX]

[DOI]

,

,

,

IACR Cryptol. ePrint Arch., 2015

GraphSC: Parallel Secure Computation Made Easy.

[BibT_eX]

[DOI]

,

Xiao Shaun Wang

,

Stratis Ioannidis

,

,

,

Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

ObliVM: A Programming Framework for Secure Computation.

[BibT_eX]

[DOI]

,

Xiao Shaun Wang

,

,

,

Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

Efficient Genome-Wide, Privacy-Preserving Similar Patient Query based on Private Edit Distance.

[BibT_eX]

[DOI]

Xiao Shaun Wang

,

,

,

,

,

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014

Oblivious Data Structures.

[BibT_eX]

[DOI]

,

,

,

,

,

IACR Cryptol. ePrint Arch., 2014

SCORAM: Oblivious RAM for Secure Computation.

[BibT_eX]

[DOI]

Xiao Shaun Wang

,

,

T.-H. Hubert Chan

,

,

IACR Cryptol. ePrint Arch., 2014

Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound.

[BibT_eX]

[DOI]

,

T.-H. Hubert Chan

,

IACR Cryptol. ePrint Arch., 2014

Oblivious Data Structures.

[BibT_eX]

[DOI]

Xiao Shaun Wang

,

,

,

T.-H. Hubert Chan

,

,

,

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

Loading...