Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
39
views
13
references
Top references
cited by
40
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
8,022
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — CRYPTO '97
Towards realizing random oracles: Hash functions that hide all partial information
other
Author(s):
Ran Canetti
Publication date
(Online):
May 17 2006
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Behavioral Public Administration
Most cited references
13
Record
: found
Abstract
: not found
Report
: not found
The MD5 Message-Digest Algorithm
R. Rivest
(1992)
0
comments
Cited
163
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
A hard-core predicate for all one-way functions
O Goldreich
,
L A Levin
(1989)
0
comments
Cited
104
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Public-key cryptosystems provably secure against chosen ciphertext attacks
M. Yung
,
M Naor
(1990)
0
comments
Cited
103
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1997
Publication date (Online):
May 17 2006
Pages
: 455-469
DOI:
10.1007/BFb0052255
SO-VID:
03410991-358a-439b-976c-51c27f88b90c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 221
A multiplicative attack using LLL algorithm on RSA signatures with redundancy
pp. 16
Statistical zero knowledge protocols to prove modular polynomial relations
pp. 235
On the security of the KMOV public key cryptosystem
pp. 75
Plug and play encryption
pp. 90
Deniable Encryption
pp. 105
Eliminating decryption errors in the Ajtai-Dwork Cryptosystem
pp. 150
Security of blind digital signatures
pp. 180
How to sign digital streams
pp. 198
Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations
pp. 213
Failure of the McEliece public-key cryptosystem under message-resend and related-message attack
pp. 249
A key recovery attack on discrete log-based schemes using a prime order subgroup
pp. 264
The prevalence of kleptographic attacks on discrete-log based cryptosystems
pp. 277
“Pseudo-random” number generation within cryptographic algorithms: The DDS case
pp. 292
Unconditional security against memory-bounded adversaries
pp. 307
Privacy amplification secure against active adversaries
pp. 322
Visual authentication and identification
pp. 342
Efficient algorithms for elliptic curve cryptosystems
pp. 357
An improved algorithm for arithmetic on a family of elliptic curves
pp. 425
Efficient generation of shared RSA keys
pp. 455
Towards realizing random oracles: Hash functions that hide all partial information
pp. 470
Collision-Resistant hashing: Towards making UOWHFs practical
Similar content
8,022
Semi-Paired Discrete Hashing: Learning Latent Hash Codes for Semi-Paired Cross-View Retrieval
Authors:
Xiaobo Shen
,
Fumin Shen
,
Quan-Sen Sun
…
File structures using hashing functions
Authors:
J. Eve
,
E. Coffman
She notes for example that Google's NetzDG transparency report "documents how it uses hashing, fingerprinting, and automated flagging technologies to try to identify unlawful content more quickly
Authors:
Hannah Bloch-Wehba
See all similar
Cited by
40
On the security of ElGamal based encryption
Authors:
Yiannis Tsiounis
,
Moti Yung
Towards realizing random oracles: Hash functions that hide all partial information
Authors:
Ran Canetti
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
Authors:
Mihir Bellare
,
Marc Fischlin
,
Adam J. O’neill
…
See all cited by