#### DMCA

## Random Oracles are Practical: A Paradigm for Designing Efficient Protocols (1995)

### Cached

### Download Links

Citations: | 1646 - 70 self |

### Citations

3894 | A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. - Rivest, Shamir, et al. - 1978 |

3542 | New Directions in Cryptography,” - Diffie, Hellman - 1976 |

1390 | Probabilistic encryption. - Goldwasser, Micali - 1984 |

1246 | The knowledge complexity of interactive proof systems. - Goldwasser, Micali, et al. - 1989 |

1017 | The MD5 Message-Digest Algorithm", - Rivest - 1992 |

959 | A Digital signature scheme secure against adaptive chosen-message attacks, - Goldwasser, Micali - 1998 |

749 | How to construct random functions, - Goldreich, Goldwasser, et al. - 1986 |

662 | How to generate cryptographically strong sequences of pseudo-random bits. - Blum, Micali - 1984 |

560 | Theory and applications of trapdoor functions. - Yao - 1982 |

480 | Non-malleable cryptography. - Dolev, Dwork, et al. - 1991 |

440 | A hard-core predicate for all one-way functions. - Goldreich, Levin - 1989 |

384 | Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. - Rackoff, Simon - 1992 |

363 | Zero-Knowledge Proofs of Identity. - Feige, Fiat, et al. - 1988 |

362 | Digitalized Signatures and Public-key Functions as Intractable as Factorization. - Rabin - 1979 |

342 | How to Construct Pseudorandom Permutations from Pseudorandom Functions,” - Luby, Rackoff - 1988 |

295 |
A simple unpredictable pseudo-random number generator.
- Blum, Blum, et al.
- 1986
(Show Context)
Citation Context ...tation with inverse f \Gamma1 ; G(r) \Phi x denotes the bitwise XOR of x with the first jxj bits of the output of G(r); and "k" denotes concatenation. For a concrete implantation, f might be=-= squaring [42, 3]-=- or RSA [38]. We suggest two schemes to encrypt efficiently in the random oracle model: (1) Set E G (x) = f(r) k G(r) \Phi x for a random value r from the domain of f . (2) Set E G;H (x) = f(r) k G(r)... |

284 | Public-key cryptosystems provably secure against chosen ciphertext attacks. - Naor, Yung - 1990 |

208 | On the composition of zero-knowledge proof systems. - Goldreich, Krawczyk - 1996 |

200 | Limits on the provable consequences of one-way permutations, in: - Impagliazzo, Rudich - 1989 |

185 | Multiple non-interactive zero-knowledge proofs under general assumptions. - Feige, Lapidot, et al. - 1999 |

152 | Non-Interactive Zero-Knowledge and Its Applications. - Blum, Feldman, et al. - 1988 |

132 |
An efficient probabilistic public-key encryption scheme which hides all partial information,
- Blum, Goldwasser
- 1985
(Show Context)
Citation Context ...e second is secure against chosen-ciphertext attack in the sense of [36] as well as non-malleable in the sense of [13]; and both are significantly more efficient than previous provably-secure schemes =-=[24, 4, 34, 36, 11, 13] for the s-=-ame goals. Justification Of Known Heuristics. A variety of well-known "tricks" find formal justification by moving to the random oracle setting. (This does not mean that existing protocols c... |

124 |
The round complexity of secure protocols.
- Beaver, Micali, et al.
- 1990
(Show Context)
Citation Context ...ls in which the adversary is denied access to the random 2 Personal communication, via S. Micali and S. Rudich. 3 In this application it does not suffice to replace the pseudorandom generator used in =-=[1]-=- by a random generator. 4 oracle. 4 Thus in many applications (and the ones of this paper in particular) PRFs don't suffice. Note, however, that when the setting permits instantiation of the oracle vi... |

85 | The notion of security for probabilistic cryptosystems. - Micali, Rackoff, et al. - 1988 |

84 | A modification of the RSA public-key encryption procedure, - Williams - 1980 |

77 | A uniform-complexity treatment of encryption and zero-knowledge. - Goldreich - 1993 |

69 | Zero-knowledge proofs of knowledge without interaction (extended abstract - Santis, Persiano - 1992 |

60 | On the cryptographic applications of random functions - Goldreich, Goldwasser, et al. - 1985 |

51 | Non-interactive zero-knowledge proof systems and applications - Blum, Feldman, et al. - 1988 |

30 | How to sign given any trapdoor permutation - Bellare, Micali - 1992 |

26 | An ecient probabilistic public-key encryption scheme which hides all partial information - Blum, Goldwasser - 1985 |

7 | Chaum and C. Cr' epeau, "Minimum Disclosure Proofs of Knowledge - Brassard, D - 1988 |

5 | Provably fast and secure digital signature algorithms based on secure hash functions - Leighton, Micali - 1993 |

3 | Foundations of cryptography," class notes - Goldreich - 1989 |

2 | Damg ard, "Towards practical public key cryptosystems secure against chosen ciphertext attacks - unknown authors - 1991 |

2 | Symmetric Public-Key Cryptosystems", submitted to - Galil, Haber, et al. - 1989 |

1 | An asymmetric authentication protocol - Rogaway, Blakley - 1993 |