Multilinear Pseudorandom Functions

DOI10.1007/978-3-662-47672-7_27zbMath1440.94040OpenAlexW2295987348MaRDI QIDQ3448796

Justin Holmgren, Aloni Cohen

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Number-theoretic constructions of efficient pseudo-random functions
• Circular-Secure Encryption from Decision Diffie-Hellman
• Verifiable Delegation of Computation over Large Datasets
• Aggregate Pseudorandom Functions and Connections to Learning
• Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• On the Implementation of Huge Random Objects

This page was built for publication: Multilinear Pseudorandom Functions