Ke Yang's Publications (by area) [DBLP]

Machine Learning

Ting Liu, Andrew W. Moore, Alexander Gray, and Ke Yang,
An Investigation of Practical Approximate Nearest Neighbor Algorithms.
To appear in Neural Information Proecessing Systems (NIPS 2004), Vancouver, BC, Canada. 2004.

Maria-Florina Balcan, Avrim Blum, and Ke Yang,
Co-Training and Expansion: Towards Bridging Theory and Practice.
To appear in Neural Information Proecessing Systems (NIPS 2004), Vancouver, BC, Canada. 2004.

Ting Liu, Ke Yang, and Andrew W. Moore,
The IOC algorithm: Efficient Many-Class Non-parametric Classification for High-Dimensional Data.
To appear in the 10th ACM SIGKDD conference (KDD 2004), Seattle, WA, 2004.


Ke Yang,
New Lower Bounds for Statistical Query Learning.
Appeared in the Fifteenth Annual Conference on Computational Learning Theory, Sydney, NSW, Australia (COLT 2002), LNAI 2375, pp. 229-243, 2002.
Journal version to appear in JCSS.
[PS] [PDF] [gzipped PS] [LNAI 2375] [ECCC TR02-060]

Ke Yang,
On Learning Correlated Functions Using Statistical Query.
Appeared in The Twelfth International Conference on Algorithmic Learning Theory, Washington, DC. (ALT 2001), LNAI 2225, pp. 59-76, 2001.
Journal version to appear in Theoretical Computer Science.
[PS] [PDF] [gzipped PS] [] LNAI 2225 ] [ ECCC TR01-098 ]

Cryptography and Security

Alina Oprea, Mike Reiter, and Ke Yang,
Space-Efficient Block Storage Integrity.
To appear in the Proceedings of the 12th Annual Network and Distributed System Security Symposium (NDSS 2005), San Diego, CA, February 2005.


Lea Kissner, Alina Oprea, Mike Reiter, Dawn Song and Ke Yang,
Private Keyword-Based Push and Pull with Applications to Anonymous Communication
To appear in the second conference of Applied Cryptography and Network Security (ACNS 2004), Yellow Mountain, China, 2004.
[PS] [PDF]

Juan Garay , Philip MacKenzie and Ke Yang,
Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness (preliminary version).
Submitted.
[PS] [PDF] [gzipped PS] [Slides (PS)] [Slides (PDF)] [Slides (gzipped PS)] [Slides (PPT)] [IACR ePrint Report 2004/009]


Philip MacKenzie and Ke Yang,
On Simulation-Sound Trapdoor Commitments.
Appreared in Eurocrypt 2004, Interlaken, Switzerland, LNCS 3027, pp. 382-400, 2004.
[IACR ePrint Report 2003/252]

Philip MacKenzie , Mike Reiter and Ke Yang,
Alternatives to Non-Malleability: Definitions, Constructions and Applications.
Appeared in Theory of Cryptography Conference (TCC 2004), Cambridge, MA, LNCS 2951, pp. 171-190, 2004.
[PS] [PDF] [gzipped PS]

Juan Garay , Philip MacKenzie and Ke Yang,
Efficient and Universally Composable Committed Oblivious Transfer and Applications.
Appeared in Theory of Cryptography Conference (TCC 2004), Cambridge, MA, LNCS 2951, pp. 297-316, 2004.
[PS] [PDF] [gzipped PS] [slides (PDF)] [IACR ePrint Report 2004/053]

Juan Garay , Philip MacKenzie and Ke Yang,
Strengthening Zero-Knowledge Protocols using Signatures.
Appeared in Eurocrypt 2003, Warsaw, Poland, LNCS 2656, pp.177-194, 2003.
Full version to appear in Journal of Cryptology.
[PS] [PDF] [gzipped PS] [IACR ePrint Report 2003/037]

Boaz Barak , Oded Goldreich , Russell Impagliazzo , Steven Rudich , Amit Sahai , Salil Vadhan , and Ke Yang,
On the (Im)possibilities of Obfuscating Pograms.
Appeared in CRYPTO 2001, Santa Baraba, CA, LNCS 2139, pp. 1-18, 2001.
[PS] [PDF] [gzipped PS] [ ECCC TR01-057 ] [IACR ePrint Report 2001/069 ] [Slides (PS)] [Slides (PDF)] [Slides (gzipped PS)]

Liansheng Huang, Xinbing Wang, Feng Xie and Ke Yang,
Formal Authentication Based on Intruder's Role Impersonate (in Chinese).
Appeared in the Journal of Tsinghua University, July, 2001.

Quantum Information Theory and Quantum Computation

Andris Ambainis and Ke Yang,
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information.
To appear in the 19th Aunnual IEEE Conference of Computational Complexity (CCC 2004), Amherst, MA, 2004.
[quant-ph/0207090] [ECCC TR03-082] [PS] [PDF]

Avrim Blum and Ke Yang,
On Statistical Query Sampling and NMR Quantum Computing.
Appeared in 18th Aunnual IEEE Conference of Computational Complexity (CCC 2003), Århus, Denmark, pp. 194-205, 2003.
[PS] [PDF] [gzipped PS] [ECCC TR03-014] [quant-ph/0307071] [IEEE ]

Andris Ambainis , Adam Smith and Ke Yang,
Extracting Quantum Entanglement (General Entanglement Purification Protocols).
Appeared in the IEEE Conference of Computational Complexity, Montreal, Quebec, Canada (CCC 2002), pp. 103-112, 2002.
[PS] [PDF] [gzipped PS] [quant-ph/0110011] [IEEE]

Computational Complexity

Ke Yang and Qianchuan Zhao,
Balance Problem of Min-Max Systems is co-NP hard.
To appear in Systems and Control Letters, Elsevier.


Ke Yang,
On the (Im)possibility of Non-interactive Correlation Distillation.
To appear in the Latin American Theoretical INformatics (LATIN 2004), Buenos Aires, Argentina, LNCS 2976, pp. 222-231, 2004.
[PS] [PDF] [gzipped PS] [ECCC TR03-085]

Manuel Blum , Rachel Rue, and Ke Yang,
On the Complexity of MAX/MIN/AVRG circuits.
CMU SCS Technical Report, CMU-CS-02-110.
[PS] [PDF] [gzipped PS] [ CMU-CS-02-110 ]

Ke Yang,
Integer Circuit Evaluation is PSPACE-complete.
Appeared in the IEEE Conference of Computational Complexity, Florence, Italy, 2000 (CCC 2000) pp. 204 - 213.
Journal version at Journal of Computer and System Sciences, 63, 288-303 (2001).
[PS] [PDF] [gzipped PS] [ ECCC TR00-012 ] [ IEEE ]

Ke Yang, Xingliang Lin, and Yiqi Dai
Minimal Size of (2,n) Data Sharing Scheme Under XOR Operation (in Chinese).
Appeared in the Journal of Tsinghua University, May, 1998.

Misc

Ke Yang,
On the Communication Complexity of Correlation and Entanglement Distillation.
Ph.D. Thesis.
[PS] [PDF] [CMU SCS Technical Report, CMU-CS-04-136]