↓ Skip to main content

Theory of Cryptography

Overview of attention for book
Cover of 'Theory of Cryptography'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Concurrent Zero Knowledge Without Complexity Assumptions
  3. Altmetric Badge
    Chapter 2 Interactive Zero-Knowledge with Restricted Random Oracles
  4. Altmetric Badge
    Chapter 3 Non-interactive Zero-Knowledge from Homomorphic Encryption
  5. Altmetric Badge
    Chapter 4 Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles
  6. Altmetric Badge
    Chapter 5 Efficient Blind and Partially Blind Signatures Without Random Oracles
  7. Altmetric Badge
    Chapter 6 Key Exchange Using Passwords and Long Keys
  8. Altmetric Badge
    Chapter 7 Mercurial Commitments: Minimal Assumptions and Efficient Constructions
  9. Altmetric Badge
    Chapter 8 Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
  10. Altmetric Badge
    Chapter 9 On Error Correction in the Exponent
  11. Altmetric Badge
    Chapter 10 On the Relation Between the Ideal Cipher and the Random Oracle Models
  12. Altmetric Badge
    Chapter 11 Intrusion-Resilience Via the Bounded-Storage Model
  13. Altmetric Badge
    Chapter 12 Perfectly Secure Password Protocols in the Bounded Retrieval Model
  14. Altmetric Badge
    Chapter 13 Polylogarithmic Private Approximations and Efficient Matching
  15. Altmetric Badge
    Chapter 14 Theory of Cryptography
  16. Altmetric Badge
    Chapter 15 Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
  17. Altmetric Badge
    Chapter 16 Efficient Multi-party Computation with Dispute Control
  18. Altmetric Badge
    Chapter 17 Round-Optimal and Efficient Verifiable Secret Sharing
  19. Altmetric Badge
    Chapter 18 Generalized Environmental Security from Number Theoretic Assumptions
  20. Altmetric Badge
    Chapter 19 Games and the Impossibility of Realizable Ideal Functionality
  21. Altmetric Badge
    Chapter 20 Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols
  22. Altmetric Badge
    Chapter 21 Resource Fairness and Composability of Cryptographic Protocols
  23. Altmetric Badge
    Chapter 22 Finding Pessiland
  24. Altmetric Badge
    Chapter 23 Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
  25. Altmetric Badge
    Chapter 24 On the Complexity of Parallel Hardness Amplification for One-Way Functions
  26. Altmetric Badge
    Chapter 25 On Matroids and Non-ideal Secret Sharing
  27. Altmetric Badge
    Chapter 26 Secure Computation with Partial Message Loss
  28. Altmetric Badge
    Chapter 27 Communication Efficient Secure Linear Algebra
  29. Altmetric Badge
    Chapter 28 Threshold and Proactive Pseudo-Random Permutations
  30. Altmetric Badge
    Chapter 29 PRF Domain Extension Using DAGs
  31. Altmetric Badge
    Chapter 30 Chosen-Ciphertext Security from Tag-Based Encryption
  32. Altmetric Badge
    Chapter 31 Separating Sources for Encryption and Secret Sharing
  33. Altmetric Badge
    Chapter 32 Erratum to: Theory of Cryptography
Attention for Chapter 15: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (89th percentile)
  • High Attention Score compared to outputs of the same age and source (99th percentile)

Mentioned by

patent
7 patents
q&a
1 Q&A thread

Citations

dimensions_citation
14 Dimensions

Readers on

mendeley
93 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
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
Chapter number 15
Book title
Theory of Cryptography
Published in
Lecture notes in computer science, January 2006
DOI 10.1007/11681878_15
Book ISBNs
978-3-54-032731-8, 978-3-54-032732-5
Authors

Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft, Damgård, Ivan, Fitzi, Matthias, Kiltz, Eike, Nielsen, Jesper Buus, Toft, Tomas

Mendeley readers

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

Geographical breakdown

Country Count As %
United Kingdom 1 1%
Sweden 1 1%
France 1 1%
Unknown 90 97%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 24 26%
Student > Master 19 20%
Researcher 13 14%
Student > Bachelor 7 8%
Student > Doctoral Student 6 6%
Other 17 18%
Unknown 7 8%
Readers by discipline Count As %
Computer Science 65 70%
Mathematics 8 9%
Engineering 7 8%
Unspecified 1 1%
Physics and Astronomy 1 1%
Other 1 1%
Unknown 10 11%

Attention Score in Context

This research output has an Altmetric Attention Score of 12. 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 29 March 2022.
All research outputs
#2,503,321
of 22,100,435 outputs
Outputs from Lecture notes in computer science
#536
of 8,097 outputs
Outputs of similar age
#15,009
of 140,768 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 15 outputs
Altmetric has tracked 22,100,435 research outputs across all sources so far. Compared to these this one has done well and is in the 88th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,097 research outputs from this source. They receive a mean Attention Score of 5.0. This one has done particularly well, scoring higher than 93% 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 140,768 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 89% of its contemporaries.
We're also able to compare this research output to 15 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 99% of its contemporaries.