↓ 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 An Optimally Fair Coin Toss
  3. Altmetric Badge
    Chapter 2 Complete Fairness in Multi-party Computation without an Honest Majority
  4. Altmetric Badge
    Chapter 3 Fairness with an Honest Minority and a Rational Majority
  5. Altmetric Badge
    Chapter 4 Purely Rational Secret Sharing (Extended Abstract)
  6. Altmetric Badge
    Chapter 5 Some Recent Progress in Lattice-Based Cryptography
  7. Altmetric Badge
    Chapter 6 Non-malleable Obfuscation
  8. Altmetric Badge
    Chapter 7 Simulation-Based Concurrent Non-malleable Commitments and Decommitments
  9. Altmetric Badge
    Chapter 8 Proofs of Retrievability via Hardness Amplification
  10. Altmetric Badge
    Chapter 9 Security Amplification for Interactive Cryptographic Primitives
  11. Altmetric Badge
    Chapter 10 Composability and On-Line Deniability of Authentication
  12. Altmetric Badge
    Chapter 11 Authenticated Adversarial Routing
  13. Altmetric Badge
    Chapter 12 Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
  14. Altmetric Badge
    Chapter 13 On the (Im)Possibility of Key Dependent Encryption
  15. Altmetric Badge
    Chapter 14 On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
  16. Altmetric Badge
    Chapter 15 Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
  17. Altmetric Badge
    Chapter 16 Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
  18. Altmetric Badge
    Chapter 17 Realistic Failures in Secure Multi-party Computation
  19. Altmetric Badge
    Chapter 18 Secure Arithmetic Computation with No Honest Majority
  20. Altmetric Badge
    Chapter 19 Universally Composable Multiparty Computation with Partially Isolated Parties
  21. Altmetric Badge
    Chapter 20 Oblivious Transfer from Weak Noisy Channels
  22. Altmetric Badge
    Chapter 21 Composing Quantum Protocols in a Classical Environment
  23. Altmetric Badge
    Chapter 22 LEGO for Two-Party Secure Computation
  24. Altmetric Badge
    Chapter 23 Simple, Black-Box Constructions of Adaptively Secure Protocols
  25. Altmetric Badge
    Chapter 24 Black-Box Constructions of Two-Party Protocols from One-Way Functions
  26. Altmetric Badge
    Chapter 25 Chosen-Ciphertext Security via Correlated Products
  27. Altmetric Badge
    Chapter 26 Hierarchical Identity Based Encryption with Polynomially Many Levels
  28. Altmetric Badge
    Chapter 27 Predicate Privacy in Encryption Systems
  29. Altmetric Badge
    Chapter 28 Simultaneous Hardcore Bits and Cryptography against Memory Attacks
  30. Altmetric Badge
    Chapter 29 The Differential Privacy Frontier (Extended Abstract)
  31. Altmetric Badge
    Chapter 30 How Efficient Can Memory Checking Be?
  32. Altmetric Badge
    Chapter 31 Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
  33. Altmetric Badge
    Chapter 32 Secret Sharing and Non-Shannon Information Inequalities
  34. Altmetric Badge
    Chapter 33 Weak Verifiable Random Functions
  35. Altmetric Badge
    Chapter 34 Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
  36. Altmetric Badge
    Chapter 35 Towards a Theory of Extractable Functions
  37. Altmetric Badge
    Chapter 36 Erratum to: Theory of Cryptography
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

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

Mentioned by

patent
1 patent
wikipedia
3 Wikipedia pages

Citations

dimensions_citation
11 Dimensions

Readers on

mendeley
17 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.
Title
Theory of Cryptography
Published by
ADS, January 2009
DOI 10.1007/978-3-642-00457-5
ISBNs
978-3-64-200456-8, 978-3-64-200457-5
Editors

Omer Reingold

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 17 100%

Demographic breakdown

Readers by professional status Count As %
Other 1 6%
Unknown 16 94%
Readers by discipline Count As %
Social Sciences 1 6%
Unknown 16 94%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 6. 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 August 2018.
All research outputs
#4,905,574
of 23,577,654 outputs
Outputs from ADS
#4,698
of 38,204 outputs
Outputs of similar age
#26,944
of 172,288 outputs
Outputs of similar age from ADS
#146
of 914 outputs
Altmetric has tracked 23,577,654 research outputs across all sources so far. Compared to these this one has done well and is in the 76th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 38,204 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done well, scoring higher than 81% 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 172,288 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 78% of its contemporaries.
We're also able to compare this research output to 914 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 77% of its contemporaries.