On Simulation-Sound Trapdoor Commitments - MacKenzie, Yang (2003)(Correct)(5 citations)
Trapdoor Commitments Philip MacKenzie Ke Yang y December 2, 2003 Abstract We study the
Trapdoor Commitments Philip MacKenzie, Ke Yan
Mellon University, Pittsburgh, PA 15213. E-mail: yangke@cs.cmu.edu. Part of the this research was done eprint.iacr.org/2003/252.ps.gz
On the (Im)possibility of Obfuscating Programs - Barak, Goldreich.. (2001)(Correct)(4 citations)
Steven Rudich Amit Sahai 1 Salil Vadhanl[ Ke Yang August 15, 2001 Abstract Informally, an
Steven Rudich, Amir Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs.
Forbes Ave. Pittsburgh, PA 15213. E-maih {rudich, yangke}cs. cmu. edu Department of Computer Science, www.aladdin.cs.cmu.edu/papers/pdfs/y2001/obfuscators.pdf
On the (Im)possibility of Obfuscating Programs.. - Barak, Goldreich.. (2001)(Correct)(1 citation)
3 Amit Sahai 4 Salil Vadhan 5 and Ke Yang 3 1 Department of Computer Science, Weizmann
Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs.
5000 Forbes Ave. Pittsburgh, PA 15213. frudich,yangkeg@cs.cmu.edu 4 Department of Computer Science, www.cs.cmu.edu/afs/cs.cmu.edu/user/rudich/www/papers/obfuscator_crypto.ps
Space-Efficient Block Storage Integrity - Oprea, Reiter, Yang(Correct)
Integrity Alina Oprea #Michael K. Reiter Ke Yang #Abstract We present new methods to provide
Storage Integrity Alina Oprea, Michael K. Reiter, Ke Yan
#Google Inc. Mountain View, CA, USA yangke@google.com to take measures before transmitting www-2.cs.cmu.edu/~alina/papers/storageint.pdf
Private Keyword-Based Push and Pull with.. - Kissner, Oprea.. (2004)(Correct)
1 Michael K. Reiter 12 Dawn Song 12 and Ke Yang 1 1 Dept. of Computer Science, Carnegie Mellon
Alina Oprea, Michael Reiter, Dawn Song, and Ke Yang. Private keywordbased push and pull with
Science, Carnegie Mellon University leak,alina,yangke}cs.cmu.edu 2 Dept, of Electrical and Computer www-2.cs.cmu.edu/~alina/papers/p3.pdf
The IOC algorithm: Efficient Many-Class Non-parametric.. - Liu, Yang, Moore (2004)(Correct)
Pittsburgh, PA 15213 tingliu@cs.cmu.edu Ke Yang Computer Science Dept. Carnegie Mellon
Classification for High-Dimensional Data Ting Liu, Ke Yang, Andrew Moor
Carnegie Mellon University Pittsburgh, PA 15213 yangke@cs.cmu.edu Andrew W. Moore Computer Science www.autonlab.org/autonweb/documents/papers/liu-ioc.ps
Alternatives to Non-Malleability: Definitions.. - MacKenzie, Reiter, Yang (2004)(Correct)
Philip MacKenzie Michael K. Reiter Ke Yang January 2, 2004 Abstract We explore whether
Applications Philip MacKenzie, Michael K. Reiter, Ke Yan
Carnegie Mellon University, Pittsburgh, PA, USA yangke@cs.cmu.edu 1 the plaintext corresponding to c, www.aladdin.cs.cmu.edu/papers/pdfs/y2004/nm.pdf
Alternatives to Non-malleability: Definitions.. - MacKenzie, Reiter, Yang (2004)(Correct)
Philip MacKenzie 1 Michael K. Reiter 2 and Ke Yang 2 1 Bell Labs, Lucent Technologies, Murray
Abstract) Philip MacKenzie, Michael K. Reiter, Ke Yan
University, Pittsburgh, PA, USA reiter@cmu.edu,yangke@cs.cmu.edu Abstract. We explore whether www.ece.cmu.edu/~reiter/papers/./2004/TCC.pdf
On the Complexity of MAX/MIN/AVRG Circuits - Manuel Blum Rachel(Correct)
of MAX/MIN/AVRG Circuits Manuel Blum Rachel Rue Ke Yang March 29, 2002 CMU-CS-02-110 School of Computer
1984. 29 www-2.cs.cmu.edu/yangke/papers/tr.ps.gz
www-2.cs.cmu.edu/yangke/publication.html unknown On the Complexity of www-2.cs.cmu.edu/~yangke/papers/tr.ps.gz
On Statistical Query Sampling and NMR Quantum Computing - Blum, Yang(Correct)
Sampling and NMR Quantum Computing Avrim Blum Ke Yang Abstract We introduce a "Statistical Query
Sampling and NMR Quantum Computing Avrim Blum, Ke Yan
Forbes Ave. Pittsburgh, PA 15213. E-mail: favrim,yangkeg@cs.cmu.edu. This work is supported in part by www-2.cs.cmu.edu/~yangke/papers/nmr.ps.gz
New Lower Bounds for Statistical Query Learning - Ke Yang April (2002)(Correct)
New Lower Bounds for Statistical Query Learning Ke Yang April 12, 2003 Abstract We prove two lower
the ACM, 27(11)1134{ 1142, November 1984. Y01] Ke Yang, On Learning Correlated Boolean Concepts Using
Forbes Ave.Pittsburgh, Pa 15213, Usa. Email: Yangke@cs.cmu.edu. Partially Supported By The Cmu Scs www-2.cs.cmu.edu/~yangke/papers/lower_bound.ps.gz
Collected Papers on the Pita Project - Ehlert, Rothkrantz, van Vark.. (2001)(Correct)
history of the dialogue so far. 9:50 -10:20 Chen-Ke Yang -Speech interfacing in the Wireless Automotive
Ehlert, Leon Rothkrantz, Robert van Vark, Chen-Ke Yang, Gerritjan Eggenkamp, Ronald Kroo ftp.kbs.twi.tudelft.nl/pub/docs/conference/2001/Ehlert.P.A.M-TRAILWorkshop2001.pdf