Public-Key Cryptography – PKC 2017
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
-
Altmetric BadgeChapter 2 Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
-
Altmetric BadgeChapter 3 Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
-
Altmetric BadgeChapter 4 Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash
-
Altmetric BadgeChapter 5 Asymptotically Tight Bounds for Composing ORAM with PIR
-
Altmetric BadgeChapter 6 Predictable Arguments of Knowledge
-
Altmetric BadgeChapter 7 Removing Erasures with Explainable Hash Proof Systems
-
Altmetric BadgeChapter 8 Scalable Multi-party Private Set-Intersection
-
Altmetric BadgeChapter 9 Tightly Secure IBE Under Constant-Size Master Public Key
-
Altmetric BadgeChapter 10 Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
-
Altmetric BadgeChapter 11 Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
-
Altmetric BadgeChapter 12 Non-malleable Codes with Split-State Refresh
-
Altmetric BadgeChapter 13 Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
-
Altmetric BadgeChapter 14 Fully Leakage-Resilient Codes
-
Altmetric BadgeChapter 15 On the Bit Security of Elliptic Curve Diffie–Hellman
-
Altmetric BadgeChapter 16 Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
-
Altmetric BadgeChapter 17 Provably Secure NTRU Instances over Prime Cyclotomic Rings
-
Altmetric BadgeChapter 18 Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems