Pseudorandom functions with new properties

Placeholder Show Content

Abstract/Contents

Abstract
Pseudorandom functions (PRFs), first defined by Goldreich, Goldwasser, and Micali, are a fundamental building block in cryptography and have numerous applications. They are used for encryption, message integrity, signatures, key derivation, user authentication, and many other cryptographic mechanisms. It is therefore unsurprising that pseudorandom functions have proven to be an important and widely researched subject. This thesis focuses on three new properties of PRFs. We start by explaining how to construct efficient algebraic pseudorandom functions. To do this, we develop a new, general PRF construction technique called the augmented cascade and show that it leads to efficient algebraic PRFs. In addition, we show how to use our techniques to build new verifiable random functions. Secondly, we show how to build PRFs with new functionality: key homomorphic PRFs. Intuitively, a key homomorphic PRF is just a PRF with an efficiently computable homomorphism over the key space. This new functionality enables a number of interesting applications, such as distributed PRFs and updatable encryption. Finally, we explain how to build PRFs that are resistant to certain kinds of attacks where the PRF key is updated in a deterministic manner. More precisely, we show how to use our key homomorphic PRFs to build PRFs secure against related-key attacks.

Description

Type of resource text
Form electronic; electronic resource; remote
Extent 1 online resource.
Publication date 2014
Issuance monographic
Language English

Creators/Contributors

Associated with Montgomery, Hart William
Associated with Stanford University, Department of Computer Science.
Primary advisor Boneh, Dan
Thesis advisor Boneh, Dan
Thesis advisor Williams, Ryan, (Singer)
Thesis advisor Williams Vassilevska, Virginia, 1980-
Advisor Williams, Ryan, (Singer)
Advisor Williams Vassilevska, Virginia, 1980-

Subjects

Genre Theses

Bibliographic information

Statement of responsibility Hart William Montgomery.
Note Submitted to the Department of Computer Science.
Thesis Thesis (Ph.D.)--Stanford University, 2014.
Location electronic resource

Access conditions

Copyright
© 2014 by Hart W Montgomery
License
This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).

Also listed in

Loading usage metrics...