David Xiao

Publication Activity (10 Years)

Years Active: 2003-2020
Publications (10 Years): 3

Top Topics

Complexity Bounds

Software Engineering Practices

Decision Forest

Top Venues

Electron. Colloquium Comput. Complex.

IACR Cryptol. ePrint Arch.

Publications

Michal Aibin, Stephen Cheng, David Xiao, Aldrich Huang
Optimization of Regenerator Placement in Optical Networks Using Deep Tensor Neural Network. UEMCON (2020)
Stephen Cheng, David Xiao, Aldrich Huang, Michal Aibin
Machine Learning for Regenerator Placement Based on the Features of the Optical Network. ICTON (2019)
Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao
Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms 48 (3) (2016)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. SIAM J. Comput. 44 (5) (2015)
Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford
Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols. IEEE/ACM Trans. Netw. 23 (6) (2015)
Vitaly Feldman, David Xiao
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity. SIAM J. Comput. 44 (6) (2015)
Kobbi Nissim, Salil P. Vadhan, David Xiao
Redrawing the Boundaries on Purchasing Data from Privacy-Sensitive Individuals. CoRR (2014)
Kobbi Nissim, Salil P. Vadhan, David Xiao
Redrawing the boundaries on purchasing data from privacy-sensitive individuals. ITCS (2014)
David Xiao, Robert C. Miller
A multiplayer online game for teaching software engineering practices. L@S (2014)
Vitaly Feldman, David Xiao
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity. COLT (2014)
Vitaly Feldman, David Xiao
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity. CoRR (2014)
David Xiao
Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. TCC (2013)
Mohammad Mahmoody, David Xiao
Languages with Efficient Zero-Knowledge PCPs are in SZK. TCC (2013)
Damien Vergnaud, David Xiao
Public-Key Encryption with Weak Randomness: Security against Strong Chosen Distribution Attacks. IACR Cryptol. ePrint Arch. 2013 (2013)
Iordanis Kerenidis, Mathieu Laurière, David Xiao
New Lower Bounds for Privacy in Communication Protocols. ICITS (2013)
Iordanis Kerenidis, Mathieu Laurière, David Xiao
New lower bounds for privacy in communication protocols. Electron. Colloquium Comput. Complex. 20 (2013)
Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao
Improved bounds for the randomized decision tree complexity of recursive majority. CoRR (2013)
David Xiao
Is privacy compatible with truthfulness? ITCS (2013)
Mohammad Mahmoody, David Xiao
Languages with Efficient Zero-Knowledge PCP's are in SZK. IACR Cryptol. ePrint Arch. 2012 (2012)
David Xiao
Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments. AFRICACRYPT (2012)
Mohammad Mahmoody, David Xiao
Languages with Efficient Zero-Knowledge PCPs are in SZK. Electron. Colloquium Comput. Complex. 19 (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower bounds on information complexity via zero-communication protocols and applications CoRR (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower bounds on information complexity via zero-communication protocols and applications. Electron. Colloquium Comput. Complex. 19 (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. FOCS (2012)
David Xiao
Is privacy compatible with truthfulness? IACR Cryptol. ePrint Arch. 2011 (2011)
Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) (2011)
David Xiao
(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. TCC (2011)
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations. LATINCRYPT (2010)
Iftach Haitner, Mohammad Mahmoody, David Xiao
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. Electron. Colloquium Comput. Complex. 17 (2010)
David Xiao
Learning to Create is as Hard as Learning to Appreciate. COLT (2010)
Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao
Improved bounds for the randomized decision tree complexity of recursive majority. Electron. Colloquium Comput. Complex. 17 (2010)
Iftach Haitner, Mohammad Mahmoody, David Xiao
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. Computational Complexity Conference (2010)
Mohammad Mahmoody, David Xiao
On the Power of Randomized Reductions and the Checkability of SAT. Computational Complexity Conference (2010)
David Xiao
(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks. IACR Cryptol. ePrint Arch. 2009 (2009)
David Xiao
On basing ZK != BPP on the hardness of PAC learning. Electron. Colloquium Comput. Complex. 16 (2009)
Mohammad Mahmoody, David Xiao
On the Power of Randomized Reductions and the Checkability of SAT. Electron. Colloquium Comput. Complex. 16 (2009)
David Xiao
On Basing ZK ≠ BPP on the Hardness of PAC Learning. Computational Complexity Conference (2009)
Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford
Path-quality monitoring in the presence of adversaries. SIGMETRICS (2008)
Benny Applebaum, Boaz Barak, David Xiao
On Basing Lower-Bounds for Learning on Worst-Case Assumptions. FOCS (2008)
Avi Wigderson, David Xiao
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications. Theory Comput. 4 (1) (2008)
Boaz Barak, Sharon Goldberg, David Xiao
Protocols and Lower Bounds for Failure Localization in the Internet. EUROCRYPT (2008)
Avi Wigderson, David Xiao
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications. Electron. Colloquium Comput. Complex. 13 (105) (2006)
Avi Wigderson, David Xiao
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. FOCS (2005)
Avi Wigderson, David Xiao
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications Electron. Colloquium Comput. Complex. (107) (2005)
Frederic H. Behr, Victoria Fossum, Michael Mitzenmacher, David Xiao
Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression. DCC (2003)