Ke Yang

According to our database, Ke Yang authored at least 17 papers between 2001 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

Resource Fairness and Composability of Cryptographic Protocols.

Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

2004

The balance problem of min-max systems is co-NP hard.

Ke Yang, Qianchuan Zhao

Syst. Control. Lett., 2004

Efficient and Universally Composable Committed Oblivious Transfer and Applications.

Juan A. Garay, Philip D. MacKenzie, Ke Yang

IACR Cryptol. ePrint Arch., 2004

Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness.

Juan A. Garay, Philip D. MacKenzie, Ke Yang

IACR Cryptol. ePrint Arch., 2004

Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract).

Philip D. MacKenzie, Michael K. Reiter, Ke Yang

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

An Investigation of Practical Approximate Nearest Neighbor Algorithms.

Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Yang

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

On the (Im)possibility of Non-interactive Correlation Distillation.

Ke Yang

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data.

Ting Liu, Ke Yang, Andrew W. Moore

Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

On Simulation-Sound Trapdoor Commitments.

Philip D. MacKenzie, Ke Yang

Proceedings of the Advances in Cryptology, 2004

Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information.

Andris Ambainis, Ke Yang

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

Private Keyword-Based Push and Pull with Applications to Anonymous Communication.

Lea Kissner, Alina Oprea, Michael K. Reiter, Dawn Xiaodong Song, Ke Yang

Proceedings of the Applied Cryptography and Network Security, 2004

2003

Strengthening Zero-Knowledge Protocols Using Signatures.

Juan A. Garay, Philip D. MacKenzie, Ke Yang

Proceedings of the Advances in Cryptology, 2003

2002

New Lower Bounds for Statistical Query Learning.

Ke Yang

Proceedings of the Computational Learning Theory, 2002

Extracting Quantum Entanglement.

Andris Ambainis, Adam D. Smith, Ke Yang

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

Integer Circuit Evaluation Is PSPACE-Complete.

Ke Yang

J. Comput. Syst. Sci., 2001

On the (Im)possibility of Obfuscating Programs.

Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang

Proceedings of the Advances in Cryptology, 2001

On Learning Correlated Boolean Functions Using Statistical Queries.

Ke Yang

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001