↓ Skip to main content

Advances in Cryptology – CRYPTO 2005

Overview of attention for book
Cover of 'Advances in Cryptology – CRYPTO 2005'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Efficient Collision Search Attacks on SHA-0
  3. Altmetric Badge
    Chapter 2 Finding Collisions in the Full SHA-1
  4. Altmetric Badge
    Chapter 3 Advances in Cryptology – CRYPTO 2005
  5. Altmetric Badge
    Chapter 4 Composition Does Not Imply Adaptive Security
  6. Altmetric Badge
    Chapter 5 On the Discrete Logarithm Problem on Algebraic Tori
  7. Altmetric Badge
    Chapter 6 A Practical Attack on a Braid Group Based Cryptographic Protocol
  8. Altmetric Badge
    Chapter 7 The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption
  9. Altmetric Badge
    Chapter 8 Unconditional Characterizations of Non-interactive Zero-Knowledge
  10. Altmetric Badge
    Chapter 9 Impossibility and Feasibility Results for Zero Knowledge with Public Keys
  11. Altmetric Badge
    Chapter 10 Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
  12. Altmetric Badge
    Chapter 11 A Formal Treatment of Onion Routing
  13. Altmetric Badge
    Chapter 12 Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
  14. Altmetric Badge
    Chapter 13 Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
  15. Altmetric Badge
    Chapter 14 Private Searching on Streaming Data
  16. Altmetric Badge
    Chapter 15 Privacy-Preserving Set Operations
  17. Altmetric Badge
    Chapter 16 Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
  18. Altmetric Badge
    Chapter 17 Generic Transformation for Scalable Broadcast Encryption Schemes
  19. Altmetric Badge
    Chapter 18 Authenticating Pervasive Devices with Human Protocols
  20. Altmetric Badge
    Chapter 19 Secure Communications over Insecure Channels Based on Short Authenticated Strings
  21. Altmetric Badge
    Chapter 20 On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
  22. Altmetric Badge
    Chapter 21 Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
  23. Altmetric Badge
    Chapter 22 Secure Computation Without Authentication
  24. Altmetric Badge
    Chapter 23 Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
  25. Altmetric Badge
    Chapter 24 Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
  26. Altmetric Badge
    Chapter 25 Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
  27. Altmetric Badge
    Chapter 26 Merkle-Damgård Revisited: How to Construct a Hash Function
  28. Altmetric Badge
    Chapter 27 On the Generic Insecurity of the Full Domain Hash
  29. Altmetric Badge
    Chapter 28 New Monotones and Lower Bounds in Unconditional Two-Party Computation
  30. Altmetric Badge
    Chapter 29 One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
  31. Altmetric Badge
    Chapter 30 A Quantum Cipher with Near Optimal Key-Recycling
  32. Altmetric Badge
    Chapter 31 An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
  33. Altmetric Badge
    Chapter 32 Improved Security Analyses for CBC MACs
  34. Altmetric Badge
    Chapter 33 HMQV: A High-Performance Secure Diffie-Hellman Protocol
Attention for Chapter 26: Merkle-Damgård Revisited: How to Construct a Hash Function
Altmetric Badge

About this Attention Score

  • In the top 5% of all research outputs scored by Altmetric
  • Among the highest-scoring outputs from this source (#20 of 8,138)
  • High Attention Score compared to outputs of the same age (99th percentile)
  • High Attention Score compared to outputs of the same age and source (97th percentile)

Mentioned by

news
18 news outlets
wikipedia
1 Wikipedia page

Citations

dimensions_citation
17 Dimensions

Readers on

mendeley
134 Mendeley
citeulike
2 CiteULike
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Merkle-Damgård Revisited: How to Construct a Hash Function
Chapter number 26
Book title
Advances in Cryptology – CRYPTO 2005
Published in
Lecture notes in computer science, August 2005
DOI 10.1007/11535218_26
Book ISBNs
978-3-54-028114-6, 978-3-54-031870-5
Authors

Jean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, Prashant Puniya

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 134 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 1 <1%
Germany 1 <1%
Unknown 132 99%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 33 25%
Student > Master 25 19%
Student > Bachelor 15 11%
Researcher 14 10%
Other 7 5%
Other 24 18%
Unknown 16 12%
Readers by discipline Count As %
Computer Science 85 63%
Engineering 11 8%
Mathematics 8 6%
Business, Management and Accounting 3 2%
Economics, Econometrics and Finance 2 1%
Other 6 4%
Unknown 19 14%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 145. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 21 August 2020.
All research outputs
#239,040
of 22,968,808 outputs
Outputs from Lecture notes in computer science
#20
of 8,138 outputs
Outputs of similar age
#236
of 57,865 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 44 outputs
Altmetric has tracked 22,968,808 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 98th percentile: it's in the top 5% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,138 research outputs from this source. They receive a mean Attention Score of 5.0. This one has done particularly well, scoring higher than 99% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 57,865 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 99% of its contemporaries.
We're also able to compare this research output to 44 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 97% of its contemporaries.