- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c17 |      | |
| c16 | | Mohammad Mahmoody, David Xiao: Languages with Efficient Zero-Knowledge PCPs are in SZK. TCC 2013: 297-314 |
| c15 | | David Xiao: Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. TCC 2013: 721-722 |
| i13 | | Iordanis Kerenidis, Mathieu Laurière, David Xiao: New lower bounds for privacy in communication protocols. Electronic Colloquium on Computational Complexity (ECCC) 20: 15 (2013) |
| 2012 | ||
| c14 | | David Xiao: Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments. AFRICACRYPT 2012: 395-411 |
| c13 | | 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: 500-509 |
| i12 | | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao: Lower bounds on information complexity via zero-communication protocols and applications. CoRR abs/1204.1505 (2012) |
| i11 | | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao: Lower bounds on information complexity via zero-communication protocols and applications. Electronic Colloquium on Computational Complexity (ECCC) 19: 38 (2012) |
| i10 | | Mohammad Mahmoody, David Xiao: Languages with Efficient Zero-Knowledge PCPs are in SZK. Electronic Colloquium on Computational Complexity (ECCC) 19: 52 (2012) |
| i9 | | Mohammad Mahmoody, David Xiao: Languages with Efficient Zero-Knowledge PCP's are in SZK. IACR Cryptology ePrint Archive 2012: 229 (2012) |
| 2011 | ||
| c12 | | Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao: Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) 2011: 317-329 |
| c11 | | David Xiao: (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. TCC 2011: 541-558 |
| i8 | | |
| 2010 | ||
| c10 | | Mohammad Mahmoody, David Xiao: On the Power of Randomized Reductions and the Checkability of SAT. IEEE Conference on Computational Complexity 2010: 64-75 |
| c9 | | Iftach Haitner, Mohammad Mahmoody, David Xiao: A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. IEEE Conference on Computational Complexity 2010: 76-87 |
| c8 | | |
| c7 | | S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich: On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations. LATINCRYPT 2010: 189-204 |
| i7 | | Iftach Haitner, Mohammad Mahmoody, David Xiao: A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. Electronic Colloquium on Computational Complexity (ECCC) 17: 1 (2010) |
| i6 | | Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao: Improved bounds for the randomized decision tree complexity of recursive majority. Electronic Colloquium on Computational Complexity (ECCC) 17: 192 (2010) |
| 2009 | ||
| c6 | | David Xiao: On Basing ZK ≠ BPP on the Hardness of PAC Learning. IEEE Conference on Computational Complexity 2009: 304-315 |
| i5 | | David Xiao: On basing ZK != BPP on the hardness of PAC learning. Electronic Colloquium on Computational Complexity (ECCC) 16: 6 (2009) |
| i4 | | Mohammad Mahmoody, David Xiao: On the Power of Randomized Reductions and the Checkability of SAT. Electronic Colloquium on Computational Complexity (ECCC) 16: 139 (2009) |
| i3 | | David Xiao: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks. IACR Cryptology ePrint Archive 2009: 513 (2009) |
| 2008 | ||
| j1 | | Avi Wigderson, David Xiao: Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications. Theory of Computing 4(1): 53-76 (2008) |
| c5 | | Boaz Barak, Sharon Goldberg, David Xiao: Protocols and Lower Bounds for Failure Localization in the Internet. EUROCRYPT 2008: 341-360 |
| c4 | | Benny Applebaum, Boaz Barak, David Xiao: On Basing Lower-Bounds for Learning on Worst-Case Assumptions. FOCS 2008: 211-220 |
| c3 | | Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford: Path-quality monitoring in the presence of adversaries. SIGMETRICS 2008: 193-204 |
| 2006 | ||
| i2 | | Avi Wigderson, David Xiao: Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications. Electronic Colloquium on Computational Complexity (ECCC) 13(105) (2006) |
| 2005 | ||
| c2 | | Avi Wigderson, David Xiao: A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. FOCS 2005: 397-406 |
| i1 | | Avi Wigderson, David Xiao: A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. Electronic Colloquium on Computational Complexity (ECCC)(107) (2005) |
| 2003 | ||
| c1 | | Frederic H. Behr, Victoria Fossum, Michael Mitzenmacher, David Xiao: Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression. DCC 2003: 416 |
Colors in the list of coauthors
Last update Wed May 22 16:19:55 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page