Multilinear Pseudorandom Functions

被引:1
|
作者
Cohen, Aloni [1 ]
Holmgren, Justin [1 ]
机构
[1] MIT, Cambridge, MA 02139 USA
来源
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I | 2015年 / 9134卷
关键词
IMPLEMENTATION;
D O I
10.1007/978-3-662-47672-7_27
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We define the new notion of a multilinear pseudorandom function (PRF), and give a construction with a proof of security assuming the hardness of the decisional Diffie-Hellman problem. A direct application of our construction yields (non-multilinear) PRFs with aggregate security from the same assumption, resolving an open question in [CGV15]. Additionally, multilinear PRFs give a new way of viewing existing algebraic PRF constructions: our main theorem implies they too satisfy aggregate security.
引用
收藏
页码:331 / 342
页数:12
相关论文
共 50 条
  • [21] On Quantum Secure Compressing Pseudorandom Functions
    Bhaumik, Ritam
    Cogliati, Benoit
    Ethan, Jordan
    Jha, Ashwin
    ADVANCES IN CRYPTOLOGY, ASIACRYPT 2023, PT III, 2023, 14440 : 34 - 66
  • [22] ONE WAY FUNCTIONS AND PSEUDORANDOM GENERATORS
    LEVIN, LA
    COMBINATORICA, 1987, 7 (04) : 357 - 363
  • [23] Publicly evaluable pseudorandom functions and their applications
    Chen, Yu
    Zhang, Zongyang
    JOURNAL OF COMPUTER SECURITY, 2016, 24 (02) : 289 - 320
  • [24] Constrained Keys for Invertible Pseudorandom Functions
    Boneh, Dan
    Kim, Sam
    Wu, David J.
    THEORY OF CRYPTOGRAPHY, TCC 2017, PT I, 2017, 10677 : 237 - 263
  • [25] Constrained Pseudorandom Functions for Unconstrained Inputs
    Deshpande, Apoorvaa
    Koppula, Venkata
    Waters, Brent
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II, 2016, 9666 : 124 - 153
  • [26] Keyword search and oblivious pseudorandom functions
    Freedman, IJ
    Ishai, Y
    Pinkas, B
    Reingold, O
    THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2005, 3378 : 303 - 324
  • [27] Pseudorandom Generators for Polynomial Threshold Functions
    Meka, Raghu
    Zuckerman, David
    STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 427 - 436
  • [28] Aggregate pseudorandom functions and connections to learning
    Cohen, Aloni
    Goldwasser, Shafi
    Vaikuntanathan, Vinod
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015, 9015 : 61 - 89
  • [29] Hardness Preserving Constructions of Pseudorandom Functions
    Jain, Abhishek
    Pietrzak, Krzysztof
    Tentes, Aris
    THEORY OF CRYPTOGRAPHY (TCC 2012), 2012, 7194 : 369 - 382
  • [30] Aggregate Pseudorandom Functions and Connections to Learning
    Cohen, Aloni
    Goldwasser, Shafi
    Vaikuntanathan, Vinod
    THEORY OF CRYPTOGRAPHY (TCC 2015), PT II, 2015, 9015 : 61 - 89