Paper 2014/522
Constrained Pseudorandom Functions: Verifiable and Delegatable
Nishanth Chandran, Srinivasan Raghuraman, and Dhinakaran Vinayagamurthy
Abstract
Constrained pseudorandom functions (introduced independently by Boneh and Waters (CCS 2013), Boyle, Goldwasser, and Ivan (PKC 2014), and Kiayias, Papadopoulos, Triandopoulos, and Zacharias (CCS 2013)), are pseudorandom functions (PRFs) that allow the owner of the secret key
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- Pseudorandom functionsConstrained PRFssignaturesVerifiable Random FunctionsMulti-linear maps
- Contact author(s)
- nichandr @ microsoft com
- History
- 2014-07-07: received
- Short URL
- https://ia.cr/2014/522
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/522, author = {Nishanth Chandran and Srinivasan Raghuraman and Dhinakaran Vinayagamurthy}, title = {Constrained Pseudorandom Functions: Verifiable and Delegatable}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/522}, year = {2014}, url = {https://eprint.iacr.org/2014/522} }