English
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Concurrent Zero Knowledge Without Complexity Assumptions
-
Altmetric BadgeChapter 2 Interactive Zero-Knowledge with Restricted Random Oracles
-
Altmetric BadgeChapter 3 Non-interactive Zero-Knowledge from Homomorphic Encryption
-
Altmetric BadgeChapter 4 Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles
-
Altmetric BadgeChapter 5 Efficient Blind and Partially Blind Signatures Without Random Oracles
-
Altmetric BadgeChapter 6 Key Exchange Using Passwords and Long Keys
-
Altmetric BadgeChapter 7 Mercurial Commitments: Minimal Assumptions and Efficient Constructions
-
Altmetric BadgeChapter 8 Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
-
Altmetric BadgeChapter 9 On Error Correction in the Exponent
-
Altmetric BadgeChapter 10 On the Relation Between the Ideal Cipher and the Random Oracle Models
-
Altmetric BadgeChapter 11 Intrusion-Resilience Via the Bounded-Storage Model
-
Altmetric BadgeChapter 12 Perfectly Secure Password Protocols in the Bounded Retrieval Model
-
Altmetric BadgeChapter 13 Polylogarithmic Private Approximations and Efficient Matching
-
Altmetric BadgeChapter 14 Theory of Cryptography
-
Altmetric BadgeChapter 15 Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
-
Altmetric BadgeChapter 16 Efficient Multi-party Computation with Dispute Control
-
Altmetric BadgeChapter 17 Round-Optimal and Efficient Verifiable Secret Sharing
-
Altmetric BadgeChapter 18 Generalized Environmental Security from Number Theoretic Assumptions
-
Altmetric BadgeChapter 19 Games and the Impossibility of Realizable Ideal Functionality
-
Altmetric BadgeChapter 20 Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols
-
Altmetric BadgeChapter 21 Resource Fairness and Composability of Cryptographic Protocols
-
Altmetric BadgeChapter 22 Finding Pessiland
-
Altmetric BadgeChapter 23 Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
-
Altmetric BadgeChapter 24 On the Complexity of Parallel Hardness Amplification for One-Way Functions
-
Altmetric BadgeChapter 25 On Matroids and Non-ideal Secret Sharing
-
Altmetric BadgeChapter 26 Secure Computation with Partial Message Loss
-
Altmetric BadgeChapter 27 Communication Efficient Secure Linear Algebra
-
Altmetric BadgeChapter 28 Threshold and Proactive Pseudo-Random Permutations
-
Altmetric BadgeChapter 29 PRF Domain Extension Using DAGs
-
Altmetric BadgeChapter 30 Chosen-Ciphertext Security from Tag-Based Encryption
-
Altmetric BadgeChapter 31 Separating Sources for Encryption and Secret Sharing
-
Altmetric BadgeChapter 32 Erratum to: Theory of Cryptography
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 (#12 of 7,661)
-
High Attention Score compared to outputs of the same age (98th percentile)
-
High Attention Score compared to outputs of the same age and source (99th percentile)
Mentioned by
- news
- 22 news outlets
- blogs
- 1 blog
- policy
- 1 policy source
- 6 tweeters
- wikipedia
- 4 Wikipedia pages
Citations
- dimensions_citation
- 9 Dimensions
Readers on
- mendeley
- 702 Mendeley
- citeulike
- 6 CiteULike