David Xiao - Academia.edu (original) (raw)
Papers by David Xiao
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
In this paper we give a randomness-efficient sampler for matrix-valued functions. Specifically, w... more In this paper we give a randomness-efficient sampler for matrix-valued functions. Specifically, we show that a random walk on an expander approximates the re-cent Chernoff-like bound for matrix-valued functions of Ahlswede and Winter [1], in a manner ...
Lecture Notes in Computer Science, 2011
We consider the randomized decision tree complexity of the recursive 3-majority function. For eva... more We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the δ-two-sided-error randomized decision tree complexity of (1 − 2δ)(5/2)h, improving the lower bound of (1 − 2δ)(7/3)h ...
Lecture Notes in Computer Science, 2008
Abstract. A secure failure-localization path-quality-monitoring (FL-PQM) protocols allows a sende... more Abstract. A secure failure-localization path-quality-monitoring (FL-PQM) protocols allows a sender to localize faulty links on a single path through a network to a receiver, even when intermediate nodes on the path behave adversarially. Such protocols were proposed as tools that en- ...
Lecture Notes in Computer Science, 2010
Abstract. We consider the following problem: can we construct constant-round zero-knowledge proof... more Abstract. We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assum-ing only the existence of one-way permutations? We answer the question in the negative for fully black-box constructions ( ...
2010 IEEE 25th Annual Conference on Computational Complexity, 2010
Page 1. A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardne... more Page 1. A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP Iftach Haitner Microsoft Research New England Campus Cambridge, USA Email:iftach@microsoft.com Mohammad ...
Lecture Notes in Computer Science, 2013
2010 IEEE 25th Annual Conference on Computational Complexity, 2010
The closure of complexity classes is a delicate question and the answer varies depending on the t... more The closure of complexity classes is a delicate question and the answer varies depending on the type of reduction considered. The closure of most classes under many-to-one (Karp) reductions is clear, but the question becomes complicated when oracle (Cook) reductions are allowed, and even more so when the oracle reductions are allowed to be randomized.
IEEE/ACM Transactions on Networking, 2014
Edge networks connected to the Internet need effective monitoring techniques to drive routing dec... more Edge networks connected to the Internet need effective monitoring techniques to drive routing decisions and detect violations of Service Level Agreements (SLAs). However, existing measurement tools, like ping, traceroute, and trajectory sampling, are vulnerable to attacks that can make a path look better than it really is. In this paper, we design and analyze path-quality monitoring protocols that reliably raise an alarm when the packet-loss rate and delay exceed a threshold, even when an adversary tries to bias monitoring results by selectively delaying, dropping, modifying, injecting, or preferentially treating packets.
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12), 2012
We show that almost all known lower bound methods for communication complexity are also lower bou... more We show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, we define a relaxed version of the partition bound of Jain and Klauck and prove that it lower bounds the information complexity of any function. Our relaxed partition bound subsumes all norm based methods (e.g. the γ 2 method) and rectangle-based methods (e.g. the rectangle/corruption bound, the smooth rectangle bound, and the discrepancy bound), except the partition bound.
Theory of Computing, 2008
Abstract: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-... more Abstract: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random variables. We present an efficient derandomization of their bound ...
Summary form only given. The measurement of the entropy of written English is extended to include... more Summary form only given. The measurement of the entropy of written English is extended to include the following written natural languages: Arabic, Chinese, French, Japanese, Korean, Russian, and Spanish. It was observed that translations of the same document have ...
In this work we analyze the sample complexity of classification by differentially private algorit... more In this work we analyze the sample complexity of classification by differentially private algorithms. Differential privacy is a strong and well-studied notion of privacy introduced by Dwork et al. [2006] that ensures that the output of an algorithm leaks little information about the data point provided by any of the participating individuals. Sample complexity of private PAC and agnostic learning was studied in a number of prior works starting with [Kasiviswanathan et al., 2011] but a number of basic questions still remain open [Beimel et al., 2010, Chaudhuri and Hsu, 2011, Beimel et al., 2013a,b].
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
In this paper we give a randomness-efficient sampler for matrix-valued functions. Specifically, w... more In this paper we give a randomness-efficient sampler for matrix-valued functions. Specifically, we show that a random walk on an expander approximates the re-cent Chernoff-like bound for matrix-valued functions of Ahlswede and Winter [1], in a manner ...
Lecture Notes in Computer Science, 2011
We consider the randomized decision tree complexity of the recursive 3-majority function. For eva... more We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the δ-two-sided-error randomized decision tree complexity of (1 − 2δ)(5/2)h, improving the lower bound of (1 − 2δ)(7/3)h ...
Lecture Notes in Computer Science, 2008
Abstract. A secure failure-localization path-quality-monitoring (FL-PQM) protocols allows a sende... more Abstract. A secure failure-localization path-quality-monitoring (FL-PQM) protocols allows a sender to localize faulty links on a single path through a network to a receiver, even when intermediate nodes on the path behave adversarially. Such protocols were proposed as tools that en- ...
Lecture Notes in Computer Science, 2010
Abstract. We consider the following problem: can we construct constant-round zero-knowledge proof... more Abstract. We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assum-ing only the existence of one-way permutations? We answer the question in the negative for fully black-box constructions ( ...
2010 IEEE 25th Annual Conference on Computational Complexity, 2010
Page 1. A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardne... more Page 1. A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP Iftach Haitner Microsoft Research New England Campus Cambridge, USA Email:iftach@microsoft.com Mohammad ...
Lecture Notes in Computer Science, 2013
2010 IEEE 25th Annual Conference on Computational Complexity, 2010
The closure of complexity classes is a delicate question and the answer varies depending on the t... more The closure of complexity classes is a delicate question and the answer varies depending on the type of reduction considered. The closure of most classes under many-to-one (Karp) reductions is clear, but the question becomes complicated when oracle (Cook) reductions are allowed, and even more so when the oracle reductions are allowed to be randomized.
IEEE/ACM Transactions on Networking, 2014
Edge networks connected to the Internet need effective monitoring techniques to drive routing dec... more Edge networks connected to the Internet need effective monitoring techniques to drive routing decisions and detect violations of Service Level Agreements (SLAs). However, existing measurement tools, like ping, traceroute, and trajectory sampling, are vulnerable to attacks that can make a path look better than it really is. In this paper, we design and analyze path-quality monitoring protocols that reliably raise an alarm when the packet-loss rate and delay exceed a threshold, even when an adversary tries to bias monitoring results by selectively delaying, dropping, modifying, injecting, or preferentially treating packets.
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12), 2012
We show that almost all known lower bound methods for communication complexity are also lower bou... more We show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, we define a relaxed version of the partition bound of Jain and Klauck and prove that it lower bounds the information complexity of any function. Our relaxed partition bound subsumes all norm based methods (e.g. the γ 2 method) and rectangle-based methods (e.g. the rectangle/corruption bound, the smooth rectangle bound, and the discrepancy bound), except the partition bound.
Theory of Computing, 2008
Abstract: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-... more Abstract: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random variables. We present an efficient derandomization of their bound ...
Summary form only given. The measurement of the entropy of written English is extended to include... more Summary form only given. The measurement of the entropy of written English is extended to include the following written natural languages: Arabic, Chinese, French, Japanese, Korean, Russian, and Spanish. It was observed that translations of the same document have ...
In this work we analyze the sample complexity of classification by differentially private algorit... more In this work we analyze the sample complexity of classification by differentially private algorithms. Differential privacy is a strong and well-studied notion of privacy introduced by Dwork et al. [2006] that ensures that the output of an algorithm leaks little information about the data point provided by any of the participating individuals. Sample complexity of private PAC and agnostic learning was studied in a number of prior works starting with [Kasiviswanathan et al., 2011] but a number of basic questions still remain open [Beimel et al., 2010, Chaudhuri and Hsu, 2011, Beimel et al., 2013a,b].