On the Relation Between the Ideal Cipher and the Random Oracle Models
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 184-206
- https://doi.org/10.1007/11681878_10
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Merkle-Damgård Revisited: How to Construct a Hash FunctionLecture Notes in Computer Science, 2005
- An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption ProblemLecture Notes in Computer Science, 2004
- On the Random-Oracle Methodology as Applied to Length-Restricted Signature SchemesLecture Notes in Computer Science, 2004
- Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGVLecture Notes in Computer Science, 2002
- A Design Principle for Hash FunctionsPublished by Springer Science and Business Media LLC ,2001
- The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key SearchLecture Notes in Computer Science, 2000
- The Exact Security of Digital Signatures-How to Sign with RSA and RabinLecture Notes in Computer Science, 1996
- Optimal asymmetric encryptionLecture Notes in Computer Science, 1995
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- A construction of a cipher from a single pseudorandom permutationLecture Notes in Computer Science, 1993