Towards realizing random oracles: Hash functions that hide all partial information
- 1 January 1997
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 455-469
- https://doi.org/10.1007/bfb0052255
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Towards realizing random oracles: Hash functions that hide all partial informationLecture Notes in Computer Science, 1997
- Keying Hash Functions for Message AuthenticationLecture Notes in Computer Science, 1996
- The Exact Security of Digital Signatures-How to Sign with RSA and RabinLecture Notes in Computer Science, 1996
- XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom FunctionsLecture Notes in Computer Science, 1995
- Collisions for the compression function of MD5Lecture Notes in Computer Science, 1994
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Non-malleable cryptographyPublished by Association for Computing Machinery (ACM) ,1991
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988