Information Security and Cryptology : 17th International Conference, Inscrypt 2021, Virtual Event, August 12–14, 2021, Revised Selected Papers

This book constitutes the post-conference proceedings of the 17th International Conference on Information Security and Cryptology, Inscrypt 2021, in August 2021. Due the COVID-19, the conference was held online The 28 full papers presented were carefully reviewed and selected from 81 submissions. The papers presents papers about research advances in all areas of information security, cryptology, and their applications. Preface Organization Contents Signatures Concurrent Signatures from a Variety of Keys 1 Introduction 2 Preliminaries 2.1 Groups 2.2 1-out-of-n Signatures 2.3 Concurrent Signatures 3 1-out-of-n Signatures with Key Separation 3.1 Description 3.2 Security Analysis 3.3 Concrete Examples 4 Concurrent Signatures with Key Separation 4.1 Description 4.2 Security Analysis 5 Conclusion A 1-out-of-n Signatures Without Key Separation A.1 Description A.2 Security Analysis B Same Group 1-out-of-n Concurent Signature B.1 Description B.2 Security Analysis References A Generic Construction of Fuzzy Signature 1 Introduction 1.1 Our Contributions 1.2 Our Approach 2 Preliminaries 2.1 Bilinear Groups 2.2 Signature Scheme 2.3 Fuzzy Extractor 3 Fuzzy Signature 4 Construction of Fuzzy Signature 4.1 Correctness 4.2 Security 5 Instantiation 5.1 First Instantiation 5.2 Second Instantiation References Identity Based Linkable Ring Signature with Logarithmic Size 1 Introduction 2 Preliminaries 2.1 Notations 2.2 Bilinear Map 2.3 Pedersen Commitment 2.4 ID-Based Linkable Ring Signature 3 ID-based Linkable Ring Signature Scheme 3.1 Construction 3.2 Security Proofs 4 Conclusions and Future Works A Proof of Theorem 1 B The Underlying Sigma-Protocol References Security Analysis of DGM and GM Group Signature Schemes Instantiated with XMSS-T 1 Introduction 2 Preliminaries 3 Specification of Related Schemes 3.1 Extended Merkle Signature Scheme-Tightened (XMSS-T) 3.2 Group Merkle (GM) 3.3 Dynamic Group Merkle (DGM) 4 Instantiating GM and DGM with XMSS-T 5 DGM with XMSS-T Security Analysis 5.1 Multi-target Attacks and XMSS-T 5.2 Multi-target Attacks on DGM 5.3 DGM Bit Security 6 DGM+ with Optimal Parameters 6.1 Message Hashing with DM-SPR 6.2 DGM and DGM+ Comparison 7 Conclusion A XMSS-T Addressing Scheme References System Security UC-Secure Cryptographic Reverse Firewall–Guarding Corrupted Systems with the Minimum Trusted Module 1 Introduction 1.1 Our Contribution 1.2 Related Work 2 Preliminary 2.1 Notations 2.2 Proud-but-Malicious Adversary 2.3 The Current Definition of a CRF 3 Security Model 3.1 Protocol Framework 3.2 Protocol Equipped with a CRF 3.3 Define a CRF by UC-emulation 4 Universal Composition of Protocols Deployed with a CRF 5 From the New Definition to the Current Definition 6 Construction of a Deterministic CRF A The Current Definition of a CRF B CRF Construction in Work ch5DMS:2016:MTR B.1 Two-round Message-Transmission Protocol B.2 Rerandomizable Encryption and Key Malleability Encryption B.3 CRF Construction for Two-round Message-Transmission Protocols References A Message Franking Channel 1 Introduction 2 Notation 3 Commiting AEAD 4 Cryptographic Channel for Message Franking (MFC) 4.1 Correctness of the Channel 5 Security for Message Franking Channel 5.1 Confidentiality 5.2 Integrity 5.3 Binding Security Notions 6 MFC Instantiation 6.1 Construction 6.2 Security Analysis 7 Conclusion References SparrowHawk: Memory Safety Flaw Detection via Data-Driven Source Code Annotation 1 Introduction 2 Motivation 2.1 Challenges 2.2 Insights 3 SparrowHawk 3.1 Overview 3.2 Programming Language Aware Word Segmentation 3.3 Targeted Function Annotation 3.4 Flaw Detection 3.5 Implementation 4 Real-World Evaluation 4.1 RQ 1: Function Prototype Segmentation 4.2 RQ 2: Function Annotation 4.3 RQ 3: Flaw Detection 5 Related Work 5.1 Deep Learning Based Flaw Detection 5.2 Program Analysis Based Flaw Detection 6 Conclusion References Symmetric Cryptanalysis A New Approach for Finding Low-Weight Polynomial Multiples 1 Introduction 1.1 Related Work 1.2 Our Approach 2 Theoretical Background 2.1 Notations and Conventions 2.2 Random Functions 3 First Algorithm 3.1 Building Blocks 3.2 The Algorithm 3.3 Experimental Results 4 Second Algorithm 4.1 Computation of 4.2 The Algorithm 4.3 Experimental Results 5 Comparison with the State-of-the-art 6 Time-Memory Trade-Off Variants References Differential-Linear Cryptanalysis of the Lightweight Cryptographic Algorithm KNOT-6pt 1 Introduction 1.1 Our Contributions 1.2 Paper Organization 2 Preliminaries 2.1 Description of KNOT-AEAD 2.2 Notations 2.3 MILP-Based Automatic Search for Differential and Linear Trails 3 The Framework of Differential-Linear Attacks 3.1 The Classic Differential-Linear Attack 3.2 Recent Improvements 4 Differential-Linear Cryptanalysis of KNOT-AEAD 4.1 Searching Differential-Linear Distinguishers 4.2 Attack on 15-Round KNOT-AEAD(128,256,64) 4.3 Attack on 17-Round KNOT-AEAD(128,384,192) 5 Conclusion References Revisit Two Memoryless State-Recovery Cryptanalysis Methods on A5/1 1 Introduction 2 Preliminary 2.1 The Keystream Generation Procedure of A5/1 2.2 A Brief Review of Golic's Guess-and-Determine Attack 2.3 The General Process of Zhang's Near Collision Attack 2.4 Unit of the Time Complexity 3 The Move Pattern Guessing Technique 3.1 The Basic Concepts of the Move Pattern 3.2 Move Guessing vs. Clock Guessing 4 Guess-and-Determine Attack Based on the Move Guessing Technique 5 Revisit Zhang's Near Collision Attack 5.1 Inaccurate Evaluations of Some Attack Parameters 5.2 Near Collision Attack with Original Clock-Guess-Based RP-Recovery 5.3 Improved Near Collision Attack with Move-Based RP-Recovery 6 Conclusion and Future Works References More Accurate Division Property Propagations Based on Optimized Implementations of Linear Layers 1 Introduction 1.1 Our Contributions 1.2 Organization of the Paper 2 Preliminaries 2.1 (Bit-Based) Division Property and Its MILP-aided Applications 2.2 Heuristics for Optimizing the Implementations of Linear Layers 3 BDP Propagations Based on Linear Layer Optimization 3.1 Construct BDP Propagation Models of Linear Layers 3.2 Division Trails of Different Models 3.3 On the Effectiveness of Our Method 4 Applications of Our New Technique 4.1 Application to Midori64 4.2 Application to Skinny64 4.3 Application to LED 5 Conclusion References Asymmetric Cryptanalysis Security Analysis on an ElGamal-Like Multivariate Encryption Scheme Based on Isomorphism of Polynomials 1 Introduction 2 IP2S and BIPC Problems 2.1 IP2S Problem 2.2 BIPC Problem and ElGamal-Like BIPC Encryption Scheme 2.3 Previous Analysis 3 Linear Stack Attack 3.1 Key Lemma 3.2 The Algorithm of the Linear Stack Attack 3.3 Complexity and Experimental Results 4 Conclusion References Attacking ECDSA Leaking Discrete Bits with a More Efficient Lattice 1 Introduction 1.1 Contributions 1.2 Roadmap 2 Preliminaries 2.1 The Lattice Attack of Recovering the ECDSA Secret Key 2.2 Elliptic Curve Digital Signature Algorithm (ECDSA) 2.3 The Information Leaked 2.4 The Extended Hidden Number Problem (EHNP) 2.5 The Approximate Shortest Vector Problem (SVP) 3 Basis Attack 3.1 Extracting Information 3.2 Reducing the Problem of Recovering the Secret Key to the EHNP 3.3 Reducing the EHNP to the Approximate SVP 4 Constructing a More Efficient Lattice 4.1 Reducing the Dimension of the Lattice 4.2 Reducing the Length of the Target Vector 4.3 Improving the Success Probability 5 Experiments 6 Conclusion References Cryptographic Protocols A Simple Post-Quantum Non-interactive Zero-Knowledge Proof from Garbled Circuits 1 Introduction 1.1 Our Construction 1.2 Related Works 2 Preliminaries 2.1 Zero Knowledge Proof 2.2 Garbled Circuit 3 Construction 3.1 ZK in the Standard Model 3.2 ZK in the CRS Model 3.3 Discussion 4 Implementation and Experiments 5 Conclusion References Improved Zero-Knowledge Argument of Encrypted Extended Permutation 1 Introduction 1.1 Contribution 1.2 Overview of Our Idea 2 Preliminaries 3 Our Main Protocol 4 Sub-Protocols 5 Analysis References Mathematical Foundations Isomorphism and Equivalence of Galois Nonlinear Feedback Shift Registers 1 Introduction 2 Preliminaries 2.1 Boolean Network 2.2 Nonlinear Feedback Shift Register 3 Isomorphism of Galois NFSRs 4 Equivalence of Galois NFSRs 5 Conclusion References Elliptic Curve and Integer Factorization 1 Introduction 2 Torsion Subgroups and Parity Conjecture 2.1 Notations 2.2 Torsion Subsubgroups 2.3 Parity Conjecture 3 A Brief Introduction to Two-Descent Method 4 Integer Factorization and the Mordell-Weil Group 5 Compute S'() and S() 6 Examples References On the Linear Complexity of Feedforward Clock-Controlled Sequence 1 Introduction 2 Pre-requisite Knowledge 2.1 Feedforward Clock-Controlled Sequence 2.2 Linear Complexity and Circulant Matrix 2.3 Block Matrix and Matrix over Ring 3 Linear Complexity Estimation Model for Feedforward Clock-Controlled Sequences 3.1 Primary Transformation of the Circulant Matrix Mcir(C) 3.2 Decomposition of the Matrix over the Ring 3.3 Linear Complexity Estimation Model 3.4 Section Summary 4 LIFI-128, and It's Linear Complexity 4.1 Description of LIFI-128 4.2 Linear Complexity 4.3 Section Summary 5 Conclusion References Symmetric Cryptography On Characterization of Transparency Order for (n,m)-functions 1 Introduction 2 Preliminaries 2.1 Definition of Boolean Functions 2.2 Some Indicators for Boolean Functions 2.3 Definition of (n, m)-functions and the Transparency Order 3 Cryptographic Properties of RTO 3.1 The Existence of (n,m)-functions Reaching the Upper Bound m on TO 3.2 The Upper and Lower Bounds on RTO(F) 3.3 Relating RTO to the Absolute Cross-Correlation Indicator 3.4 The Relationships Between RTO and Other Cryptographic Properties 4 RTO of S-Boxes of Size 4 4 4.1 RTO of 302 Affine Equivalent Representative (4,4) S-Box 4.2 RTO of AGi for 16 Optimal S-Box Gi 5 Conclusions References Binary Sequences Derived from Monomial Permutation Polynomials over GF(2p) 1 Introduction 2 Preliminaries 2.1 Dual Bases 2.2 Maximal Length Monomial Sequences 3 Properties of Coordinate Sequences Derived from MLM-sequences 3.1 Period Properties of the Coordinate Sequences 3.2 Shift-Equivalence of the Coordinate Sequences 4 Conclusions References On the Provable Security Against Truncated Impossible Differential Cryptanalysis for AES in the Master-Key Setting 1 Introduction 2 Preliminaries 2.1 Brief Description of AES 2.2 Definitions 3 Main Results 4 Conclusion References Adaptive Side-Channel Analysis Model and Its Applications to White-Box Block Cipher Implementations 1 Introduction 2 Preliminaries 2.1 CEJO-WBAES 2.2 Differential Fault Analysis 2.3 The Table Redundancy Method Against DFA 2.4 Differential Computation Analysis 2.5 The Improved Masking Method Against DCA 3 Adaptive Side-Channel Analysis Model and Its Applications 3.1 The Adaptive Side-Channel Analysis Model on WBC 3.2 Adaptive DFA on the Table Redundancy Method 3.3 Adaptive DCA on the Improved Masking Method 4 Theoretical Analysis and Experimental Results 4.1 Results of the Adaptive DFA on the Table Redundancy Method 4.2 Results of the Adaptive DCA on the Improved Masking Method 5 Adaptive SCA on Lee et al.'s Higher-Order Countermeasures 6 Conclusion References Public Key Cryptography Fully Secure Lattice-Based ABE from Noisy Linear Functional Encryption 1 Introduction 1.1 Related Works 2 Preliminaries 2.1 Conjunctive Normal Form 2.2 Ciphertext-Policy Attribute-Based Encryption 2.3 Lattice and Smoothing Parameters 2.4 Lattice Trapdoor and Learning with Error 3 Noisy Linear Functional Encryption with Bounded Collusion 4 Fully Secure CP-ABE Scheme for CNF Policies 4.1 Construction 4.2 Hyper-functional Keys and Semi-functional Ciphertexts 4.3 Security Proof 5 Conclusion and Future Works A Proof of Lemma 2.5 B Proof of Theorem 3.1 References Revocable Identity-Based Encryption with Server-Aided Ciphertext Evolution from Lattices 1 Introduction 2 Definition and Security Model 2.1 RIBE with Server-Aided Ciphertext Evolution 2.2 Lattices 3 Our Lattice-Based RIBE-CE Scheme Without DKER 3.1 Description of the Scheme 3.2 Analysis 4 Our Lattice-Based RIBE-CE Scheme with DKER 4.1 Description of the Scheme 4.2 Analysis 5 Conclusion References Homomorphic Modular Reduction and Improved Bootstrapping for BGV Scheme 1 Introduction 2 Preliminaries 2.1 Cyclotomic Rings 2.2 (Ring) LWE Problems and Ciphertexts 2.3 BGV Scheme 2.4 A Ring Variant of the GSW Scheme 3 New Homomorphic Modular Reduction Algorithm 3.1 The Basic Idea 3.2 Homomorphic Modular Reduction 4 Improved Bootstrapping for BGV Scheme 4.1 Blind Rotation 4.2 Repacking 4.3 Bootstrapping 5 Conclusion References Real World Cryptography Privacy Preserving OpenPGP Public Key Distribution with Spamming Resistance 1 Introduction 2 Background 2.1 OpenPGP and Web of Trust 2.2 Synchronizing Keyservers 2.3 Private Set Intersection 2.4 Bloom Filter 2.5 HMAC-Based Key Derivation Function 3 Assumptions and Goals 3.1 Problem Description 3.2 Design Principles 3.3 Threat Model 4 Scheme 4.1 Protocol Selection 4.2 Scheme Details 4.3 Extension to Public Key IDs 4.4 Optimization 5 Evaluation 5.1 Experimental Settings 5.2 Usability Evaluation 5.3 Privacy Evaluation 6 Related Work 7 Conclusion References Collaborative Verifiable Delay Functions 1 Introduction 1.1 Related Work 1.2 Applications of a coVDF 1.3 Our Contributions 2 coVDFs: Definitions and Security Properties 2.1 Correctness, Soundness and Sequentiality 2.2 Security in a Trustless Setting 3 A Sequential coVDF 4 A Robust coVDF Construction 4.1 coVDF from Repeated Hashing 4.2 Security of V2 5 Concluding Remarks A A Sequential coVDF Construction A.1 Security of V1 B Example of Graph Built Using Eval2 C Examples C.1 Collaborative Work C.2 Decentralised Blind Auctions References SMCOS: Fast and Parallel Modular Multiplication on ARM NEON Architecture for ECC 1 Introduction 2 Related Work 3 Preliminaries 3.1 ARM NEON Architecture 3.2 Representation of Prime Field Elements 4 Modular Multiplication for ECC Using SIMD Extensions 4.1 Cascade Operand Scanning for Specific Modulus on SIMD 4.2 Performance Analysis 4.3 Making SMCOS Fully Pipelined 5 Results 5.1 Target Platforms 5.2 Performance Comparison of Prime Field Multiplication 5.3 Performance Comparison of Elliptic Curve Arithmetic 5.4 Performance Results of ECDH and ECDSA 6 Conclusions References Correction to: Differential-Linear Cryptanalysis of the Lightweight Cryptographic Algorithm KNOT Correction to: Chapter “Differential-Linear Cryptanalysis of the Lightweight Cryptographic Algorithm KNOT” in: Y. Yu and M. Yung (Eds.): Information Security and Cryptology, LNCS 13007, https://doi.org/10.1007/978-3-030-88323-2_9 Author Index