A Proof of Security in O(2 n ) for the Benes Scheme

DOI10.1007/978-3-540-68164-9_14zbMath1141.94367OpenAlexW1506429688MaRDI QIDQ3506381

Jacques Patarin

Publication date: 13 June 2008

Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68164-9_14

zbMATH Keywords

unconditional securitypseudorandom functiondesign of keyed hash functionsinformation-theoretic primitivesecurity above the birthday bound

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Tight security of cascaded LRW2 ⋮ Revisiting BBS signatures ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ \textsf{Elastic-Tweak}: a framework for short tweak tweakable block cipher ⋮ How to build optimally secure PRFs using block ciphers ⋮ Deterministic encryption with the Thorp shuffle ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ The “Coefficients H” Technique

Cites Work

• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• Foiling Birthday Attacks in Length-Doubling Transformations
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Information Security and Cryptology - ICISC 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Proof of Security in O(2 n ) for the Benes Scheme