A Proof of Security in O(2 n ) for the Benes Scheme
From MaRDI portal
Publication:3506381
DOI10.1007/978-3-540-68164-9_14zbMath1141.94367MaRDI QIDQ3506381
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
unconditional security; pseudorandom function; design of keyed hash functions; information-theoretic primitive; security above the birthday bound
94A60: Cryptography
Related Items
Revisiting BBS signatures, Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers, \textsf{Elastic-Tweak}: a framework for short tweak tweakable block cipher, Deterministic encryption with the Thorp shuffle, Tight security of cascaded LRW2, Hardness-preserving reductions via cuckoo hashing, How to build optimally secure PRFs using block ciphers, A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier, The “Coefficients H” Technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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