Fast Pseudorandom Functions Based on Expander Graphs

2016 ◽  
pp. 27-56 ◽  
Author(s):  
Benny Applebaum ◽  
Pavel Raykov
Keyword(s):  
Expander Graphs ◽  
Pseudorandom Functions

Expander Graphs

2013 ◽  
pp. 1337-1347
Author(s):  
Mike Krebs ◽  
Anthony Shaheen
Keyword(s):  
Expander Graphs

scholarly journals Cryptanalysis of PMACx, PMAC2x, and SIVx

2017 ◽  
pp. 162-176
Author(s):  
Kazuhiko Minematsu ◽  
Tetsu Iwata
Keyword(s):  
Provable Security ◽  
Block Cipher ◽  
Query Complexity ◽  
Block Length ◽  
Encryption Scheme ◽  
Authenticated Encryption ◽  
Pseudorandom Functions ◽  
Tweakable Block Cipher ◽  
Deterministic Authenticated Encryption ◽  
Provably Secure

At CT-RSA 2017, List and Nandi proposed two variable input length pseudorandom functions (VI-PRFs) called PMACx and PMAC2x, and a deterministic authenticated encryption scheme called SIVx. These schemes use a tweakable block cipher (TBC) as the underlying primitive, and are provably secure up to the query complexity of 2n, where n denotes the block length of the TBC. In this paper, we falsify the provable security claims by presenting concrete attacks. We show that with the query complexity of O(2n/2), i.e., with the birthday complexity, PMACx, PMAC2x, and SIVx are all insecure.

scholarly journals Gonality of expander graphs

2018 ◽  
Vol 341 (9) ◽  
pp. 2535-2543 ◽  
Author(s):  
Neelav Dutta ◽  
David Jensen
Keyword(s):  
Expander Graphs

scholarly journals Lp-Expander Graphs

2019 ◽  
Vol 234 (2) ◽  
pp. 863-905 ◽  
Author(s):  
Amitay Kamber
Keyword(s):  
Expander Graphs

Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices

2021 ◽  
pp. 261-289
Author(s):  
Martin R. Albrecht ◽  
Alex Davidson ◽  
Amit Deo ◽  
Nigel P. Smart
Keyword(s):  
Ideal Lattices ◽  
Pseudorandom Functions

Cryptographic Hash Functions from Expander Graphs

2007 ◽  
Vol 22 (1) ◽  
pp. 93-113 ◽  
Author(s):  
Denis X. Charles ◽  
Kristin E. Lauter ◽  
Eyal Z. Goren
Keyword(s):  
Hash Functions ◽  
Expander Graphs ◽  
Cryptographic Hash Functions

scholarly journals New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs

COMBINATORICA ◽  
2020 ◽  
Vol 40 (3) ◽  
pp. 435-454
Author(s):  
Gergely Harcos ◽  
Daniel Soltész
Keyword(s):  
Expander Graphs ◽  
Hamiltonian Paths

scholarly journals Keyword Search and Oblivious Pseudorandom Functions

2005 ◽  
pp. 303-324 ◽  
Author(s):  
Michael J. Freedman ◽  
Yuval Ishai ◽  
Benny Pinkas ◽  
Omer Reingold
Keyword(s):  
Keyword Search ◽  
Pseudorandom Functions
Sign in / Sign up

Export Citation Format

Share Document