• Gold M - Skip to Main Content.
  • University of Minnesota
  • Search U of M
  • CSE Home
  • IT Home
  • Directories
  • One Stop
  • myU
Computer Science & Engineering
Prospective Students
Current Students
Alumni
Industry

Computer Science & Engineering

  • Department Info
    • About Us
    • Contact Info
    • Department News
    • Giving
  •  
  • Admissions
    • Undergraduate
    • Graduate
  •  
  • Academics
    • Undergraduate
    • Graduate
  •  
  • People
    • Faculty
    • Graduate Students
  •  
  • Research
    • Research Areas
    • Tech Reports
    • Related Centers
  •  
  • Resources
    • Forms
    • Systems Help
    • Faculty Portal locked external link
    • Computing Facilities
    • Department Wiki locked external link
    • Employment
  •  
  • Site Map
  •  
  •  
Institute of Technology Logo
Home > People > Faculty

CSE Profile: Nick Hopper

Nick Hopper
Assistant Professor

(612) 626-1284
Office: EE/CS 4-211

Interests

Cryptography, Computer Security, Algorithms and Complexity.

Education

Ph.D. 2004, Computer Science, Carnegie Mellon University.

B.A. 1999, Computer Science and Mathematics, University of Minnesota, Morris.

Assistant Professor Hopper specializes in Cryptography and Computer Security. He's a member of the International Association for Cryptographic Research. He received the National Science Foundation's (NSF) CAREER award in 2006.  

Research

My general interests are in cryptography, computer & network security, and
theoretical computer science. The focus of my research is on proving the security of computer systems and protocols. The central questions in this research are:

  • What should it mean for a computer system to be secure? In order to prove the security of a system or protocol we must first establish formal definitions of security.
  • What can we prove about the security of current systems and protocols? Given a formal security goal, it is sometimes possible to prove that existing protocols satisfy this definition or show that they do not.
  • How can we construct efficient systems with provable security properties? If we cannot prove the security of an existing protocol or system, a natural alternative is to construct a system so that the proof of security is tractable.

Personal Home Page

Related Links

  • Faculty Awards
  • Graduate Student Awards
  • Undergraduate Student Awards
  • Best Paper Awards
  • Award-winning IT Faculty
  • U of M Alumni Association
  • UMNnews: Faculty & Staff Communications

 

  • ©2006 - 2009 Regents of the University of Minnesota. All rights reserved.
  • Privacy
  • Contact U of M
  • Contact CSE
  • CSE Employment
  • Site Map
  • The University of Minnesota is an equal opportunity educator and employer.
  • Last modified on July 23, 2008