Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Hovav Shacham

Security And Privacy

Hovav Shacham is a professor of computer security at the University of California, San Diego, whose work spans cryptography and systems security. He completed his doctorate at Stanford University under Dan Boneh with a dissertation on new paradigms in signature schemes, and with Boneh and Ben Lynn he developed a short digital signature scheme built on the Weil pairing that is now widely used. He is best known in security for return oriented programming, a method showing that Turing complete computation can be built by reusing code already present in a program, which turned memory corruption exploits into a general technique. He also took part in a high profile audit of software-controlled cars, studied backscatter X-ray body scanners and chaired the IEEE Symposium on Security and Privacy in 2019 and 2020.

Facts
Contribution Kind
Algorithm 1
Notable Work
Return Oriented Programming 1
Connections

Affiliated With

Source Hovav Shacham (Wikipedia)

In Field

Cryptography, Fields
Source Hovav Shacham (Wikipedia)
Source Hovav Shacham (Wikipedia)
Sources
1. Hovav Shacham (Wikipedia)
  • Research
    Shacham developed a scheme to digital signature scheme based on the Weil pairing with Dan Boneh and Ben Lynn
  • Research, security
    Shacham is best known for developing Return Oriented Programming (ROP)
  • In Group: Applied Cryptography, Research, cryptography
    Shacham developed a scheme to digital signature scheme based on the Weil pairing with Dan Boneh and Ben Lynn
  • In Field: Cryptography, Research, field
    Shacham's research covers the areas of cryptography and security.
  • In Field: Information Security, Research, security field
    Shacham's research covers the areas of cryptography and security.
  • Affiliated With: University of California, San Diego, Lead
    Hovav Shacham is a professor in computer security at the University of California, San Diego.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.