An Entity of Type: person, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Phillip Rogaway is a professor of computer science at the University of California, Davis. He graduated from Beverly Hills High School, and later earned a BA in computer science from UC Berkeley and completed his PhD in cryptography at MIT, in the Theory of Computation group. He has taught at UC Davis since 1994. He was awarded the Paris Kanellakis Award in 2009 and the first Levchin Prize for Real World Cryptography in 2016. Rogaway received an NSF CAREER award in 1996, which the NSA had attempted to prevent by influencing the NSF. Rogaway's papers cover topics including:

Property Value
dbo:abstract
  • Phillip Rogaway ist ein US-amerikanischer Informatiker, der sich mit Kryptographie befasst. Rogaway studierte ab 1980 an der University of California, Berkeley, mit dem Bachelor-Abschluss 1985 und am Massachusetts Institute of Technology (MIT) mit dem Master-Abschluss 1988 (Everything provable is provable in zero knowledge) und der Promotion 1991 bei Silvio Micali (The round complexity of secure protocols). Danach arbeitete er bei IBM und war ab 1994 Professor an der University of California, Davis. Er ist regelmäßig Gastprofessor an der Chiang Mai University in Thailand. Er forscht auf dem von ihm Practice-oriented Provable Security genannten Gebiet beweisbar sicherer kryptographischer Protokolle und entwickelte mit Mihir Bellare das Zufallsorakel-Modell (random oracle model). Außerdem führte er die Methoden des Optimal Asymmetric Encryption Padding (OAEP), die inzwischen standardisiert wurde, und Probabilistic Signature Scheme (PSS) ein. Mit Don Coppersmith entwickelte er bei IBM die Stromchiffre SEAL. 2009 erhielt er mit Bellare den Paris-Kanellakis-Preis für Praxis-orientierte beweisbare Sicherheit. 2003 erhielt er den RSA Award for Mathematics. 1996 erhielt er einen NSF Career Award. Er ist Fellow der International Association for Cryptologic Research (IACR). (de)
  • Phillip Rogaway is a professor of computer science at the University of California, Davis. He graduated from Beverly Hills High School, and later earned a BA in computer science from UC Berkeley and completed his PhD in cryptography at MIT, in the Theory of Computation group. He has taught at UC Davis since 1994. He was awarded the Paris Kanellakis Award in 2009 and the first Levchin Prize for Real World Cryptography in 2016. Rogaway received an NSF CAREER award in 1996, which the NSA had attempted to prevent by influencing the NSF. He has been interviewed in multiple media outlets regarding his stance on the ethical obligations that cryptographers and computer scientists have to serve to the public good, specifically in the areas of internet privacy and digital surveillance. Rogaway's papers cover topics including: * CMAC * Concrete security * DES and DES-X * Format-preserving encryption * OCB mode * Random oracle model * SEAL * UMAC * Zero-knowledge proofs (en)
  • Phillip Rogaway, né en 1962, est professeur d'informatique à l'Université de Californie à Davis. (fr)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 4337751 (xsd:integer)
dbo:wikiPageLength
  • 3640 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1057463856 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
schema:sameAs
rdf:type
rdfs:comment
  • Phillip Rogaway, né en 1962, est professeur d'informatique à l'Université de Californie à Davis. (fr)
  • Phillip Rogaway ist ein US-amerikanischer Informatiker, der sich mit Kryptographie befasst. Rogaway studierte ab 1980 an der University of California, Berkeley, mit dem Bachelor-Abschluss 1985 und am Massachusetts Institute of Technology (MIT) mit dem Master-Abschluss 1988 (Everything provable is provable in zero knowledge) und der Promotion 1991 bei Silvio Micali (The round complexity of secure protocols). Danach arbeitete er bei IBM und war ab 1994 Professor an der University of California, Davis. Er ist regelmäßig Gastprofessor an der Chiang Mai University in Thailand. (de)
  • Phillip Rogaway is a professor of computer science at the University of California, Davis. He graduated from Beverly Hills High School, and later earned a BA in computer science from UC Berkeley and completed his PhD in cryptography at MIT, in the Theory of Computation group. He has taught at UC Davis since 1994. He was awarded the Paris Kanellakis Award in 2009 and the first Levchin Prize for Real World Cryptography in 2016. Rogaway received an NSF CAREER award in 1996, which the NSA had attempted to prevent by influencing the NSF. Rogaway's papers cover topics including: (en)
rdfs:label
  • Phillip Rogaway (de)
  • Phillip Rogaway (fr)
  • Phillip Rogaway (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:doctoralStudent of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License