Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
David Xiao
Observed names:
D. Xiao,
D. Xiao Eurocrypt,
David Y. Xiao,
Xiao, David
Institutions:
Centre National de la Recherche Scientifique,
Université Paris Diderot
Observed institutions:
Université Paris-Sud,
Centre National de la Recherche Scientifique,
Princeton University,
Laboratoire d'Informatique Algorithmique: Fondements et Applications,
Laboratoire de Recherche en Informatique,
Université Paris Diderot,
University of California, Berkeley
show all 7
OpenAlex ID:
A5103581925
Is privacy compatible with truthfulness?
2013
·
David Xiao
·
Conference on Innovations in Theoretical Computer Science
·
95
Path-quality monitoring in the presence of adversaries
2008
·
Sharon Goldberg
, David Xiao
, et al.
·
ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)
·
94
Redrawing the boundaries on purchasing data from privacy-sensitive individuals
2014
·
Kobbi Nissim
, Salil Vadhan
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
91
On Basing Lower-Bounds for Learning on Worst-Case Assumptions
2008
·
Benny Applebaum
, Boaz Barak
, et al.
·
Annual Symposium on Foundations of Computer Science
·
73
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
2012
·
Iordanis Kerenidis
, Sophie Laplante
, et al.
·
Annual Symposium on Foundations of Computer Science
·
62
PDF
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
2015
·
Vitaly Feldman
, David Xiao
·
SIAM Journal on Computing
·
60
PDF
Untitled
2008
·
Avi Wigderson
, David Xiao
·
Theory of Computing
·
53
Protocols and Lower Bounds for Failure Localization in the Internet
2008
·
Boaz Barak
, Sharon Goldberg
, et al.
·
Springer eBooks
·
48
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
2015
·
Iordanis Kerenidis
, Sophie Laplante
, et al.
·
SIAM Journal on Computing
·
36
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
2011
·
Frédéric Magniez
, Ashwin Nayak
, et al.
·
Lecture notes in computer science
·
28
PDF
Improved bounds for the randomized decision tree Complexity of recursive majority
2015
·
Frédéric Magniez
, Ashwin Nayak
, et al.
·
Random Structures and Algorithms
·
26
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
2010
·
Iftach Haitner
, Mohammad Mahmoody
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
26
Path-quality monitoring in the presence of adversaries
2008
·
Sharon Goldberg
, David Xiao
, et al.
·
ACM SIGMETRICS Performance Evaluation Review
·
23
On the Power of Randomized Reductions and the Checkability of SAT
2010
·
Mohammad Mahmoody
, David Xiao
·
IEEE Conference on Computational Complexity (CCC)
·
22
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
2005
·
A. Wigderson
, D. Xiao
·
Annual Symposium on Foundations of Computer Science
·
22
Is privacy compatible with truthfulness
2011
·
David Xiao
·
IACR Cryptology ePrint Archive
·
18
(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
2011
·
David Xiao
·
Lecture notes in computer science
·
13
PDF
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
2010
·
S. Dov Gordon
, Hoeteck Wee
, et al.
·
Lecture notes in computer science
·
11
On Basing ZK ≠ BPP on the Hardness of PAC Learning
2009
·
David Xiao
·
IEEE Conference on Computational Complexity (CCC)
·
10
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
2006
·
Avi Wigderson
, David Xiao
·
Electronic colloquium on computational complexity
·
10
Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols
2014
·
Sharon Goldberg
, David Xiao
, et al.
·
IEEE/ACM Transactions on Networking
·
9
The Evolution of Expander Graphs
2003
·
David Xiao
·
9
Languages with Efficient Zero-Knowledge PCPs are in SZK
2013
·
Mohammad Mahmoody
, David Xiao
·
Lecture notes in computer science
·
8
PDF
Learning to Create is as Hard as Learning to Appreciate.
2010
·
David Xiao
·
Conference on Learning Theory
·
8
New perspectives on the complexity of computational learning, and other problems in theoretical computer science
2009
·
Boaz Barak
, David Xiao
·
8
Show more works
View as search
Works count:
58
Citation count:
900
H-index:
16
I10-index:
20
Year
Topic
Type