David Xiao

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Redrawing the boundaries on purchasing data from privacy-sensitive individuals Proceedings of the 5th conference on Innovations in theoretical computer science	2017-05-19	Paper
Is privacy compatible with truthfulness? Proceedings of the 4th conference on Innovations in Theoretical Computer Science	2017-05-16	Paper
Improved bounds for the randomized decision tree complexity of recursive majority Random Structures & Algorithms	2016-06-10	Paper
Sample complexity bounds on differentially private learning via communication complexity SIAM Journal on Computing	2015-11-25	Paper
Lower bounds on information complexity via zero-communication protocols and applications SIAM Journal on Computing	2015-11-04	Paper
Lower bounds on information complexity via zero-communication protocols and applications SIAM Journal on Computing	2015-11-04	Paper
New Lower Bounds for Privacy in Communication Protocols Lecture Notes in Computer Science	2015-09-30	Paper
Languages with efficient zero-knowledge PCPs are in SZK Theory of Cryptography	2013-03-18	Paper
Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks Theory of Cryptography	2013-03-18	Paper
Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments Progress in Cryptology - AFRICACRYPT 2012	2012-07-23	Paper
Pseudo-randomness: objects and generation	2012-01-18	Paper
scientific article; zbMATH DE number 5986691 (Why is no real title available?)	2011-12-07	Paper
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority Automata, Languages and Programming	2011-07-06	Paper
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority Automata, Languages and Programming	2011-07-06	Paper
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications Theory of Computing	2011-05-24	Paper
(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks Theory of Cryptography	2011-05-19	Paper
On the round complexity of zero-knowledge proofs based on one-way permutations Lecture Notes in Computer Science	2010-08-31	Paper
Protocols and Lower Bounds for Failure Localization in the Internet Advances in Cryptology – EUROCRYPT 2008	2008-04-15	Paper

Research outcomes over time

This page was built for person: David Xiao