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
30
views
21
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,369
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – CRYPTO 2004
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
other
Author(s):
Chun-Yuan Hsiao
,
Leonid Reyzin
Publication date
(Print):
2004
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
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
Road 2 Open Meta
Most cited references
21
Record
: found
Abstract
: not found
Article
: not found
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Manuel R Blum
,
Silvio Micali
(1984)
0
comments
Cited
137
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Ronald L. Rivest
,
Silvio Micali
,
Shafi Goldwasser
(1988)
0
comments
Cited
89
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Certified Digital Signature
Ralph C. Merkle
(1990)
0
comments
Cited
89
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2004
Pages
: 92-105
DOI:
10.1007/978-3-540-28628-8_6
SO-VID:
756b5b33-cb5b-4c99-9afa-763e0595f7e1
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
On Multiple Linear Approximations
pp. 317
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
pp. 92
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
pp. 106
Security of Random Feistel Schemes with 5 or More Rounds
pp. 140
Compressed Pairings
pp. 179
How to Compress Rabin Ciphertexts and Signatures (and More)
pp. 220
Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks
pp. 254
Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
pp. 273
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
pp. 290
Near-Collisions of SHA-0
pp. 306
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
pp. 335
Round-Optimal Secure Two-Party Computation
pp. 390
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
pp. 407
Faster Correlation Attack on Bluetooth Keystream Generator E0
pp. 426
A New Paradigm of Hybrid Encryption Scheme
pp. 443
Secure Identity Based Encryption Without Random Oracles
pp. 460
Non-interactive Timestamping in the Bounded Storage Model
pp. 494
Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes
pp. 511
Efficient Tree-Based Revocation in Groups of Low-State Devices
Similar content
2,369
Electrochemical reconstruction of a heavily corroded Tarentum hemiobolus silver coin: a study based on microfocus X-ray computed microtomography
Authors:
Benedetto Bozzini
,
Alessandra Gianoncelli
,
Claudio Mele
…
Clinical and Genetic Profile of Autism Spectrum Disorder-Epilepsy (ASD-E) Phenotype: Two Sides of the Same Coin!
Authors:
Sudhakar Karunakaran
,
Ramshekhar N Menon
,
Sruthi S Nair
…
Asymptotic dynamics of coined quantum walks on percolation graphs
Authors:
Igor Jex
,
Jaroslav Novotný
,
Tamás Kiss
…
See all similar
Cited by
9
Signature Schemes with Bounded Leakage Resilience
Authors:
Jonathan Katz
,
Vinod Vaikuntanathan
Foundations of Non-malleable Hash and One-Way Functions
Authors:
Alexandra Boldyreva
,
David W. Cash
,
Marc Fischlin
…
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
Authors:
Ilan Komargodski
,
Moni Naor
,
Eylon Yogev
See all cited by