↓ Skip to main content

Advances in Cryptology – ASIACRYPT 2011

Overview of attention for book
Cover of 'Advances in Cryptology – ASIACRYPT 2011'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 BKZ 2.0: Better Lattice Security Estimates
  3. Altmetric Badge
    Chapter 2 Functional Encryption for Inner Product Predicates from Learning with Errors
  4. Altmetric Badge
    Chapter 3 Random Oracles in a Quantum World
  5. Altmetric Badge
    Chapter 4 Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
  6. Altmetric Badge
    Chapter 5 Structure Preserving CCA Secure Encryption and Applications
  7. Altmetric Badge
    Chapter 6 Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
  8. Altmetric Badge
    Chapter 7 Lower and Upper Bounds for Deniable Public-Key Encryption
  9. Altmetric Badge
    Chapter 8 Bridging Broadcast Encryption and Group Key Agreement
  10. Altmetric Badge
    Chapter 9 On the Joint Security of Encryption and Signature, Revisited
  11. Altmetric Badge
    Chapter 10 Polly Cracker, Revisited
  12. Altmetric Badge
    Chapter 11 Oblivious RAM with O((logN)3) Worst-Case Cost
  13. Altmetric Badge
    Chapter 12 Noiseless Database Privacy
  14. Altmetric Badge
    Chapter 13 The Preimage Security of Double-Block-Length Compression Functions
  15. Altmetric Badge
    Chapter 14 Rebound Attack on JH42
  16. Altmetric Badge
    Chapter 15 Second-Order Differential Collisions for Reduced SHA-256
  17. Altmetric Badge
    Chapter 16 Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions
  18. Altmetric Badge
    Chapter 17 Cryptanalysis of ARMADILLO2
  19. Altmetric Badge
    Chapter 18 An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware
  20. Altmetric Badge
    Chapter 19 Biclique Cryptanalysis of the Full AES
  21. Altmetric Badge
    Chapter 20 Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol
  22. Altmetric Badge
    Chapter 21 Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge
  23. Altmetric Badge
    Chapter 22 Two Provers in Isolation
  24. Altmetric Badge
    Chapter 23 Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
  25. Altmetric Badge
    Chapter 24 A Framework for Practical Universally Composable Zero-Knowledge Protocols
  26. Altmetric Badge
    Chapter 25 Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
  27. Altmetric Badge
    Chapter 26 Cryptography Secure against Related-Key Attacks and Tampering
  28. Altmetric Badge
    Chapter 27 Counting Points on Genus 2 Curves with Real Multiplication
  29. Altmetric Badge
    Chapter 28 On the Efficiency of Bit Commitment Reductions
  30. Altmetric Badge
    Chapter 29 Secure Communication in Multicast Graphs
  31. Altmetric Badge
    Chapter 30 Constant-Round Private Function Evaluation with Linear Complexity
  32. Altmetric Badge
    Chapter 31 Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
  33. Altmetric Badge
    Chapter 32 Computational Verifiable Secret Sharing Revisited
  34. Altmetric Badge
    Chapter 33 Natural Generalizations of Threshold Secret Sharing
  35. Altmetric Badge
    Chapter 34 Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
  36. Altmetric Badge
    Chapter 35 Short Signatures from Weaker Assumptions
  37. Altmetric Badge
    Chapter 36 Practical Key-Recovery for All Possible Parameters of SFLASH
  38. Altmetric Badge
    Chapter 37 The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
  39. Altmetric Badge
    Chapter 38 Leakage-Resilient Cryptography from the Inner-Product Extractor
  40. Altmetric Badge
    Chapter 39 Program Obfuscation with Leaky Hardware
  41. Altmetric Badge
    Chapter 40 BiTR: Built-in Tamper Resilience
Attention for Chapter 25: Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age and source (65th percentile)

Mentioned by

patent
1 patent

Readers on

mendeley
37 Mendeley
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
Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
Chapter number 25
Book title
Advances in Cryptology – ASIACRYPT 2011
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-25385-0_25
Book ISBNs
978-3-64-225384-3, 978-3-64-225385-0
Authors

Fischlin, Marc, Libert, Benoît, Manulis, Mark, Marc Fischlin, Benoît Libert, Mark Manulis

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 3%
United Kingdom 1 3%
Unknown 35 95%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 11 30%
Student > Master 9 24%
Researcher 5 14%
Professor 2 5%
Lecturer 2 5%
Other 6 16%
Unknown 2 5%
Readers by discipline Count As %
Computer Science 28 76%
Physics and Astronomy 2 5%
Engineering 2 5%
Mathematics 1 3%
Design 1 3%
Other 0 0%
Unknown 3 8%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 11 March 2015.
All research outputs
#7,524,294
of 22,962,258 outputs
Outputs from Lecture notes in computer science
#2,489
of 8,137 outputs
Outputs of similar age
#54,752
of 181,571 outputs
Outputs of similar age from Lecture notes in computer science
#75
of 317 outputs
Altmetric has tracked 22,962,258 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,137 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 54% 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 181,571 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 27th percentile – i.e., 27% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 317 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 65% of its contemporaries.