↓ Skip to main content

Advances in Cryptology - ASIACRYPT’99

Overview of attention for book
Cover of 'Advances in Cryptology - ASIACRYPT’99'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Modulus Search for Elliptic Curve Cryptosystems
  3. Altmetric Badge
    Chapter 2 On the Lai-Massey Scheme
  4. Altmetric Badge
    Chapter 3 On Cryptographically Secure Vectorial Boolean Functions
  5. Altmetric Badge
    Chapter 4 Equivalent Keys of HPC
  6. Altmetric Badge
    Chapter 5 Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials
  7. Altmetric Badge
    Chapter 6 Cryptanalysis of Two Cryptosystems Based on Group Actions
  8. Altmetric Badge
    Chapter 7 Probabilistic Higher Order Differential Attack and Higher Order Bent Functions
  9. Altmetric Badge
    Chapter 8 Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
  10. Altmetric Badge
    Chapter 9 Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves
  11. Altmetric Badge
    Chapter 10 Speeding up the Discrete Log Computation on Curves with Automorphisms
  12. Altmetric Badge
    Chapter 11 ECC: Do We Need to Count?
  13. Altmetric Badge
    Chapter 12 Elliptic Scalar Multiplication Using Point Halving
  14. Altmetric Badge
    Chapter 13 On the Design of RSA with Short Secret Exponent
  15. Altmetric Badge
    Chapter 14 Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries
  16. Altmetric Badge
    Chapter 15 Adaptively-Secure Optimal-Resilience Proactive RSA
  17. Altmetric Badge
    Chapter 16 Factorization of RSA-140 Using the Number Field Sieve
  18. Altmetric Badge
    Chapter 17 How to Prove That a Committed Number Is Prime
  19. Altmetric Badge
    Chapter 18 Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
  20. Altmetric Badge
    Chapter 19 General Adversaries in Unconditional Multi-party Computation
  21. Altmetric Badge
    Chapter 20 Approximation Hardness and Secure Communication in Broadcast Channels
  22. Altmetric Badge
    Chapter 21 Mix-Networks on Permutation Networks
  23. Altmetric Badge
    Chapter 22 Secure Communication in an Unknown Network Using Certificates
  24. Altmetric Badge
    Chapter 23 Linear Complexity versus Pseudorandomness: On Beth and Dai’s Result
  25. Altmetric Badge
    Chapter 24 A Class of Explicit Perfect Multi-sequences
  26. Altmetric Badge
    Chapter 25 Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function
  27. Altmetric Badge
    Chapter 26 Doing More with Fewer Bits
  28. Altmetric Badge
    Chapter 27 A Quick Group Key Distribution Scheme with “Entity Revocation”
  29. Altmetric Badge
    Chapter 28 An Efficient Hierarchical Identity-Based Key-Sharing Method Resistant against Collusion-Attacks
  30. Altmetric Badge
    Chapter 29 Periodical Multi-secret Threshold Cryptosystems
  31. Altmetric Badge
    Chapter 30 A Signature Scheme with Message Recovery as Secure as Discrete Logarithm
  32. Altmetric Badge
    Chapter 31 A 3-Codes under Collusion Attacks
  33. Altmetric Badge
    Chapter 32 Broadcast Authentication in Group Communication
Attention for Chapter 14: Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
5 Wikipedia pages

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
69 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
Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries
Chapter number 14
Book title
Advances in Cryptology - ASIACRYPT’99
Published in
Lecture notes in computer science, November 1999
DOI 10.1007/978-3-540-48000-6_14
Book ISBNs
978-3-54-066666-0, 978-3-54-048000-6
Authors

Pascal Paillier, David Pointcheval

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Germany 2 3%
Portugal 1 1%
Turkey 1 1%
Pakistan 1 1%
United Kingdom 1 1%
Denmark 1 1%
United States 1 1%
Poland 1 1%
Unknown 60 87%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 24 35%
Student > Master 11 16%
Researcher 8 12%
Lecturer 6 9%
Professor > Associate Professor 5 7%
Other 13 19%
Unknown 2 3%
Readers by discipline Count As %
Computer Science 57 83%
Mathematics 4 6%
Engineering 2 3%
Design 1 1%
Unknown 5 7%
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 24 July 2020.
All research outputs
#7,452,489
of 22,783,848 outputs
Outputs from Lecture notes in computer science
#2,485
of 8,124 outputs
Outputs of similar age
#11,074
of 35,934 outputs
Outputs of similar age from Lecture notes in computer science
#3
of 6 outputs
Altmetric has tracked 22,783,848 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,124 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 55% 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 35,934 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 10th percentile – i.e., 10% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 6 others from the same source and published within six weeks on either side of this one. This one has scored higher than 3 of them.