Multilinear pseudorandom functions

DOI10.1007/978-3-662-47672-7_27zbMATH Open1440.94040OpenAlexW2295987348MaRDI QIDQ3448796FDOQ3448796

Authors: Aloni Cohen, Justin Holmgren 

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_27

Recommendations

• Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
• An algebraic framework for pseudorandom functions and applications to related-key security
• Hardness preserving constructions of pseudorandom functions
• Number-theoretic constructions of efficient pseudo-random functions
• From non-adaptive to adaptive pseudorandom functions

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Circular-Secure Encryption from Decision Diffie-Hellman
• Number-theoretic constructions of efficient pseudo-random functions
• Verifiable delegation of computation over large datasets
• On the implementation of huge random objects
• Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
• Aggregate Pseudorandom Functions and Connections to Learning
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Cited In (1)

• Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security

This page was built for publication: Multilinear pseudorandom functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448796)