Indistinguishability Amplification
- 9 August 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- Vol. 2006, 130-149
- https://doi.org/10.1007/978-3-540-74143-5_8
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Luby-Rackoff Ciphers from Weak Round Functions?Lecture Notes in Computer Science, 2006
- Composition Implies Adaptive Security in MinicryptLecture Notes in Computer Science, 2006
- Composition Does Not Imply Adaptive SecurityLecture Notes in Computer Science, 2005
- Derandomized Constructions of k-Wise (Almost) Independent PermutationsLecture Notes in Computer Science, 2005
- Black-Box Composition Does Not Imply Adaptive SecurityLecture Notes in Computer Science, 2004
- Composition of Random Systems: When Two Weak Make One StrongLecture Notes in Computer Science, 2004
- Efficient Amplification of the Security of Weak Pseudo-Random Function GeneratorsJournal of Cryptology, 2003
- Indistinguishability of Random SystemsLecture Notes in Computer Science, 2002
- Provable security for block ciphers by decorrelationLecture Notes in Computer Science, 1998
- Pseudo-random permutation generators and cryptographic compositionPublished by Association for Computing Machinery (ACM) ,1986