Pseudorandom functions revisited: The cascade construction and its concrete security (1996)
Cached
Download Links
- [www.cs.ucsd.edu]
- [www.cs.ucsd.edu]
- [www-cse.ucsd.edu]
- [www.research.ibm.com]
- [www.cs.ucsd.edu]
- [www-cse.ucsd.edu]
- [www-cse.ucsd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE |
| Citations: | 79 - 21 self |
BibTeX
@INPROCEEDINGS{Bellare96pseudorandomfunctions,
author = {Mihir Bellare and Ran Canetti and Hugo Krawczyk},
title = {Pseudorandom functions revisited: The cascade construction and its concrete security},
booktitle = {Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE},
year = {1996},
pages = {514--523},
publisher = {IEEE}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract Pseudorandom function families are a powerful cryptographic primitive, yielding, in partic-ular, simple solutions for the main problems in private key cryptography. Their existence based on general assumptions (namely, the existence of one-way functions) has been established.In this work we investigate new ways of designing pseudorandom function families. The goal is to find constructions that are both efficient and secure, and thus eventually to bring thebenefits of pseudorandom functions to practice.
