English
French
French
Séparation (cryptologie)
Cited by user Ϛ on
French
Theory of Cryptography
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Input Locality and Hardness Amplification
-
Altmetric BadgeChapter 2 General Hardness Amplification of Predicates and Puzzles
-
Altmetric BadgeChapter 3 Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
-
Altmetric BadgeChapter 4 Dense Model Theorems and Their Applications
-
Altmetric BadgeChapter 5 Parallel Repetition for Leakage Resilience Amplification Revisited
-
Altmetric BadgeChapter 6 Achieving Leakage Resilience through Dual System Encryption
-
Altmetric BadgeChapter 7 Signatures Resilient to Continual Leakage on Memory and Computation
-
Altmetric BadgeChapter 8 After-the-Fact Leakage in Public-Key Encryption
-
Altmetric BadgeChapter 9 One-Time Computable Self-erasing Functions
-
Altmetric BadgeChapter 10 Perfectly Secure Oblivious RAM without Random Oracles
-
Altmetric BadgeChapter 11 Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
-
Altmetric BadgeChapter 12 Correlated-Input Secure Hash Functions
-
Altmetric BadgeChapter 13 Black-Box Circular-Secure Encryption beyond Affine Functions
-
Altmetric BadgeChapter 14 Homomorphic Encryption: From Private-Key to Public-Key
-
Altmetric BadgeChapter 15 Identity-Based Encryption Secure against Selective Opening Attack
-
Altmetric BadgeChapter 16 Functional Encryption: Definitions and Challenges
-
Altmetric BadgeChapter 17 Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs
-
Altmetric BadgeChapter 18 Round-Optimal Password-Based Authenticated Key Exchange
-
Altmetric BadgeChapter 19 Bringing People of Different Beliefs Together to Do UC
-
Altmetric BadgeChapter 20 Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
-
Altmetric BadgeChapter 21 Practical Adaptive Oblivious Transfer from Simple Assumptions
-
Altmetric BadgeChapter 22 Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
-
Altmetric BadgeChapter 23 A Zero-One Law for Secure Multi-party Computation with Ternary Outputs
-
Altmetric BadgeChapter 24 PCPs and the Hardness of Generating Private Synthetic Data
-
Altmetric BadgeChapter 25 Limits of Computational Differential Privacy in the Client/Server Setting
-
Altmetric BadgeChapter 26 Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy
-
Altmetric BadgeChapter 27 On the Black-Box Complexity of Optimally-Fair Coin Tossing
-
Altmetric BadgeChapter 28 Theory of Cryptography
-
Altmetric BadgeChapter 29 Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
-
Altmetric BadgeChapter 30 Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators
-
Altmetric BadgeChapter 31 On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
-
Altmetric BadgeChapter 32 Concurrent Security and Non-malleability
-
Altmetric BadgeChapter 33 (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
-
Altmetric BadgeChapter 34 Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
-
Altmetric BadgeChapter 35 Towards Non-Black-Box Lower Bounds in Cryptography
-
Altmetric BadgeChapter 36 On Black-Box Separations among Injective One-Way Functions
-
Altmetric BadgeChapter 37 Impossibility of Blind Signatures from One-Way Permutations
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 (93rd percentile)
-
High Attention Score compared to outputs of the same age and source (95th percentile)
Readers on
- mendeley
- 23 Mendeley