Intro
Preface
Organization
Keynote Abstracts
Building Covert Communication Systems That Resist Traffic Analysis
Cultivating a National Culture of Cybersecurity
Contents
Schemes I
Forward Security Under Leakage Resilience, Revisited
1 Introduction
1.1 Background and Motivation
1.2 Our Contributions in Brief
2 Technical Overview
3 Preliminaries
3.1 Notations
3.2 Different Notions of Entropy
3.3 Primitives Required for Our Constructions.
4 Our Results in the FS+CL Model
4.1 Encryption in the FS+CL Model
4.2 Our Construction

5 Our Results in the FS+(C)EBL Model
5.1 The FS+EBL Model
5.2 NIKE in FS+EBL Model
5.3 Syntax of FS-EBLR NIKE
5.4 Security Model for FS-EBLR NIKE
5.5 Construction of NIKE Scheme in the FS+EBL Model
5.6 Security Proof
References
Anonymous Broadcast Authentication with Logarithmic-Order Ciphertexts from LWE
1 Introduction
1.1 Related Work
1.2 Our Contributions and Paper Organization
2 Preliminaries
2.1 Anonymous Broadcast Authentication (ABA)
3 Vernam-Styled Multirecipient Encryption with Information-Theoretic Security
4 Template Construction of Base ABA

4.1 A Template
4.2 Anonymity
4.3 Unforgeability
5 Concatenation of ABAs
5.1 Anonymity in the Restricted Device Selection
5.2 Modification Against Recombination Attack
5.3 Anonymity from the Dependency of Algebraic Systems
6 Concrete Scheme and Security Parameters
7 Concluding Remarks
References
Traceable Policy-Based Signatures with Delegation
1 Introduction
2 Preliminaries and Building Blocks
2.1 Rerandomizable Digital Signature Scheme (RDS)
2.2 Simulation-Sound Extractable NIZK (SE-NIZK)
2.3 Digital Signature Schemes

3 Traceable Policy-Based Signatures (TPBS)
3.1 TPBS Security Definitions
3.2 Privacy
3.3 Unforgeability
3.4 Non-frameability
3.5 Traceability
4 TPBS Generic Construction
5 TPBS Security
6 TPBS Instantiation and Performance
7 Comparisson with PBS and Xu et al.'s Schemes
8 Conclusion
References
Basic Primitives
How to Enumerate LWE Keys as Narrow as in Kyber/Dilithium
1 Introduction
2 Preliminaries
3 How to Enumerate LWE Keys with May's Algorithm
3.1 Brute-Force and Meet-in-the-Middle LWE Key Enumeration
3.2 High-Level Idea of the Algorithm

4 Enumerating Keys from a Probabilistic Distribution
4.1 A Polynomial Fraction of All Keys Achieves Expectations
4.2 Attacking Almost All Keys via Permutations
5 Instantiating LWE-Search with Simple (Rep-0) Representations
5.1 Rep-0 Instantiation of LWE-Search
6 More Representations
6.1 Rep-1 Representations
6.2 Rep-2, Rep-3 Representations
7 Other Distributions
Ternary, B(2), and Uniform
7.1 Ternary Keys-Featuring NTRU, BLISS and GLP
7.2 B(2) and B(3)-Featuring Kyber-512 and Kyber-768,1024
7.3 Uniform Distribution-Featuring Dilithium-1024,2048