Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4339024> ?p ?o }
Showing triples 1 to 75 of
75
with 100 triples per page.
- Q4339024 description "American cryptographer".
- Q4339024 description "American cryptographer".
- Q4339024 subject Q5312304.
- Q4339024 subject Q5835830.
- Q4339024 subject Q6819743.
- Q4339024 subject Q7066851.
- Q4339024 subject Q7067047.
- Q4339024 subject Q8244983.
- Q4339024 subject Q8611250.
- Q4339024 subject Q8637205.
- Q4339024 subject Q8882878.
- Q4339024 subject Q9580543.
- Q4339024 abstract "Rafail Ostrovsky (born 1963) is a professor of computer science and mathematics at UCLA and a well-known researcher in algorithms and cryptography. Prof. Ostrovsky received his Ph.D. from MIT in 1992. He is a member of the Editorial Board of Algorithmica [1], Editorial Board of Journal of Cryptology [2] and Editorial and Advisory Board of the International Journal of Information and Computer Security [3].Prof. Ostrovsky is a winner of the 2006 IBM Faculty Award; the 2006 and 2005 Xerox Innovation Group Award; the 2004 OKAWA Research Award; the 1993 Henry Taub Prize; 1996 Bellcore prize for excellence in research; and three-time winner of the best published work of the year (1999, 2001, 2002) at SAIC in computer science and mathematics. Some notable achievements of Prof. Ostrovsky include: 1990 Introduced (with R. Venkatesan and M. Yung) the notion of interactive hashing proved essential for constructing statistical zero-knowledge proofs for NP based on any one-way function (see NOVY and ECCC TR06-075). 1991 Introduced (with M. Yung) the notion of mobile adversary (later renamed proactive security) (see survey of Goldwasser [4]) or over 400 citations in Google Scholar) 1992 Proved the existence of asymptotically optimal software protection scheme (later renamed searching on encrypted data) assuming the existence of Tamper-resistant Microprocessor 1993 Proved (with A. Wigderson) equivalence of one-way functions and zero-knowledge [5]. 1996 Introduced (with R. Canetti, C. Dwork and M. Naor) the notion of deniable encryption [6]. 1997 Invented (with E. Kushilevitz) the first single server private information retrieval protocol [7] (see over 400 citations in Google Scholar). 1997 Showed (with E. Kushilevitz and Y. Rabani) (1+ε) poly-time and poly-size approximate-nearest neighbor search for high-dimensional data for L1-norm and Euclidean space (see over 320 citations in Google Scholar).".
- Q4339024 birthDate "1963".
- Q4339024 birthYear "1963".
- Q4339024 wikiPageExternalLink scholar?hl=en&lr=&cluster=16876204603976795719.
- Q4339024 wikiPageExternalLink scholar?hl=en&lr=&cluster=18241228131050222006.
- Q4339024 wikiPageExternalLink scholar?hl=en&lr=&cluster=3582393584382162472.
- Q4339024 wikiPageExternalLink 1997-podc.pdf.
- Q4339024 wikiPageExternalLink Algorithmica_Editors.htm.
- Q4339024 wikiPageExternalLink ~rafail.
- Q4339024 wikiPageExternalLink 05.html.
- Q4339024 wikiPageExternalLink 07.html.
- Q4339024 wikiPageExternalLink 09.html.
- Q4339024 wikiPageExternalLink 10.html.
- Q4339024 wikiPageExternalLink 14.html.
- Q4339024 wikiPageExternalLink 29.html.
- Q4339024 wikiPageExternalLink 34.html.
- Q4339024 wikiPageExternalLink IJICS.
- Q4339024 wikiPageExternalLink Ostrovsky:Rafail.html.
- Q4339024 wikiPageWikiLink Q11609.
- Q4339024 wikiPageWikiLink Q121594.
- Q4339024 wikiPageWikiLink Q1532069.
- Q4339024 wikiPageWikiLink Q17295.
- Q4339024 wikiPageWikiLink Q174710.
- Q4339024 wikiPageWikiLink Q191943.
- Q4339024 wikiPageWikiLink Q21198.
- Q4339024 wikiPageWikiLink Q2657061.
- Q4339024 wikiPageWikiLink Q395.
- Q4339024 wikiPageWikiLink Q49108.
- Q4339024 wikiPageWikiLink Q5297.
- Q4339024 wikiPageWikiLink Q5312304.
- Q4339024 wikiPageWikiLink Q5835830.
- Q4339024 wikiPageWikiLink Q608751.
- Q4339024 wikiPageWikiLink Q6819743.
- Q4339024 wikiPageWikiLink Q7066851.
- Q4339024 wikiPageWikiLink Q7067047.
- Q4339024 wikiPageWikiLink Q720931.
- Q4339024 wikiPageWikiLink Q7681757.
- Q4339024 wikiPageWikiLink Q8244983.
- Q4339024 wikiPageWikiLink Q8366.
- Q4339024 wikiPageWikiLink Q8611250.
- Q4339024 wikiPageWikiLink Q8637205.
- Q4339024 wikiPageWikiLink Q8789.
- Q4339024 wikiPageWikiLink Q8882878.
- Q4339024 wikiPageWikiLink Q956437.
- Q4339024 wikiPageWikiLink Q9580543.
- Q4339024 dateOfBirth "1963".
- Q4339024 name "Ostrovsky, Rafail".
- Q4339024 shortDescription "American cryptographer".
- Q4339024 type Person.
- Q4339024 type Agent.
- Q4339024 type Person.
- Q4339024 type Agent.
- Q4339024 type NaturalPerson.
- Q4339024 type Thing.
- Q4339024 type Q215627.
- Q4339024 type Q5.
- Q4339024 type Person.
- Q4339024 comment "Rafail Ostrovsky (born 1963) is a professor of computer science and mathematics at UCLA and a well-known researcher in algorithms and cryptography. Prof. Ostrovsky received his Ph.D. from MIT in 1992. He is a member of the Editorial Board of Algorithmica [1], Editorial Board of Journal of Cryptology [2] and Editorial and Advisory Board of the International Journal of Information and Computer Security [3].Prof.".
- Q4339024 label "Rafail Ostrovsky".
- Q4339024 givenName "Rafail".
- Q4339024 name "Ostrovsky, Rafail".
- Q4339024 name "Rafail Ostrovsky".
- Q4339024 surname "Ostrovsky".