Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Constrained Pseudorandom Functions and Their Applications
verfasst von : Dan Boneh, Brent Waters
Erschienen in: Advances in Cryptology - ASIACRYPT 2013
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We put forward a new notion of pseudorandom functions (PRFs) we call PRFs. In a standard PRF there is a master key
k
that enables one to evaluate the function at all points in the domain of the function. In a PRF it is possible to derive constrained keys
k
S
from the master key
k
. A constrained key
k
S
enables the evaluation of the PRF at a certain subset
S
of the domain and nowhere else. We present a formal framework for this concept and show that PRFs can be used to construct powerful primitives such as identity-based key exchange and a broadcast encryption system with optimal ciphertext size. We then construct PRFs for several natural set systems needed for these applications. We conclude with several open problems relating to this new concept.