default search action
Ke Yang 0005
Person information
- affiliation: Google Inc., Mountain View, CA, USA
- affiliation (former): Carnegie Mellon University, Pittsburgh, PA, USA
Other persons with the same name
- Ke Yang — disambiguation page
- Ke Yang 0001 — Queen Mary University of London, UK
- Ke Yang 0002 — Beihang University, School of Instrumentation and Optoelectronic Engineering, Beijing, China
- Ke Yang 0003 — University of Texas at San Antonio, TX, USA (and 2 more)
- Ke Yang 0004 — National Innovation Institute of Defense Technology, Beijing, China (and 1 more)
- Ke Yang 0006 — Beijing University of Posts and Telecommunications, Beijing, China
- Ke Yang 0007 — East China Jiaotong University, Nanchang, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j6]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (im)possibility of obfuscating programs. J. ACM 59(2): 6:1-6:48 (2012) - 2011
- [j5]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. J. Cryptol. 24(4): 615-658 (2011)
2000 – 2009
- 2006
- [j4]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures. J. Cryptol. 19(2): 169-209 (2006) - [c13]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. TCC 2006: 404-428 - 2005
- [j3]Ke Yang:
New lower bounds for statistical query learning. J. Comput. Syst. Sci. 70(4): 485-509 (2005) - [i6]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2005: 370 (2005) - 2004
- [j2]Ke Yang, Qianchuan Zhao:
The balance problem of min-max systems is co-NP hard. Syst. Control. Lett. 53(3-4): 303-310 (2004) - [c12]Lea Kissner, Alina Oprea, Michael K. Reiter, Dawn Xiaodong Song, Ke Yang:
Private Keyword-Based Push and Pull with Applications to Anonymous Communication. ACNS 2004: 16-30 - [c11]Andris Ambainis, Ke Yang:
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. CCC 2004: 305-319 - [c10]Philip D. MacKenzie, Ke Yang:
On Simulation-Sound Trapdoor Commitments. EUROCRYPT 2004: 382-400 - [c9]Ting Liu, Ke Yang, Andrew W. Moore:
The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data. KDD 2004: 629-634 - [c8]Ke Yang:
On the (Im)possibility of Non-interactive Correlation Distillation. LATIN 2004: 222-231 - [c7]Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Yang:
An Investigation of Practical Approximate Nearest Neighbor Algorithms. NIPS 2004: 825-832 - [c6]Philip D. MacKenzie, Michael K. Reiter, Ke Yang:
Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). TCC 2004: 171-190 - [i5]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. IACR Cryptol. ePrint Arch. 2004: 9 (2004) - [i4]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Efficient and Universally Composable Committed Oblivious Transfer and Applications. IACR Cryptol. ePrint Arch. 2004: 53 (2004) - 2003
- [c5]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures. EUROCRYPT 2003: 177-194 - [i3]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols using Signatures. IACR Cryptol. ePrint Arch. 2003: 37 (2003) - 2002
- [c4]Andris Ambainis, Adam D. Smith, Ke Yang:
Extracting Quantum Entanglement. CCC 2002: 103-112 - [c3]Ke Yang:
New Lower Bounds for Statistical Query Learning. COLT 2002: 229-243 - 2001
- [j1]Ke Yang:
Integer Circuit Evaluation Is PSPACE-Complete. J. Comput. Syst. Sci. 63(2): 288-303 (2001) - [c2]Ke Yang:
On Learning Correlated Boolean Functions Using Statistical Queries. ALT 2001: 59-76 - [c1]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. CRYPTO 2001: 1-18 - [i2]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. Electron. Colloquium Comput. Complex. TR01 (2001) - [i1]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. IACR Cryptol. ePrint Arch. 2001: 69 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint