Information Security and Cryptology – ICISC 2020: 23rd International Conference, Seoul, South Korea, December 2–4, 2020, Proceedings (Lecture Notes in Computer Science)

This book constitutes selected papers from the 23rd International Conference on Information Security and Cryptology, ICISC 2020, held in Seoul, South Korea, in December 2020. Due to the COVID-19, the confere was held online. The total of 15 papers presented in this volume were carefully reviewed and selected from 51 submissions. The aim of this conference was to provide an international forum for the latest results of research, development, and applications within the field of information security and cryptology. Preface Organization Contents Security Models Security Definitions on Time-Lock Puzzles 1 Introduction 1.1 Background and Motivation 1.2 Our Contributions 1.3 Related Works 2 Preliminaries 2.1 Notations 2.2 Time-Lock Puzzles 3 New Definition for Time-Lock Puzzles 3.1 Indistinguishability for Time-Lock Puzzles 3.2 Semantic Security for Time-Lock Puzzles 4 The Equivalence of Indistinguishability and Semantic Security 5 Reconsideration on Computational Power References Secret Sharing with Statistical Privacy and Computational Relaxed Non-malleability 1 Introduction 1.1 Background 1.2 Our Contribution 2 Preliminaries 2.1 Notations 2.2 Public Key Encryption 2.3 Lossy Encryption 2.4 Secret Sharing 3 IND-CCA Secure Lossy Encryption in the Injective Mode 3.1 Construction 3.2 Key Indistinguishability 3.3 Lossiness Under Lossy Key 3.4 IND-CCA Security 3.5 IND-CCA Secure Lossy Encryption is a Non-malleable Commitment 4 Definition of Computational Non-malleability 5 Computationally Non-malleable Secret Sharing 5.1 Construction 5.2 Statistical Privacy 5.3 Computational Non-malleability 6 Gap with Conventional Definition 7 Conclusion References Cryptography in Quantum Computer Age (Quantum) Cryptanalysis of Misty Schemes 1 Introduction 2 Misty Constructions 2.1 Misty L Scheme 2.2 Misty R Scheme 3 Overview of (Quantum) Cryptanalysis on Misty Schemes 3.1 Misty L Schemes with Few Rounds 3.2 Misty R Schemes with Few Rounds 4 Quantum Cryptanalysis on Misty 4.1 Simon's and Grover's Algorithms 4.2 Quantum Distinguishing Attack on 4-Round Misty L Schemes 4.3 Quantum Distinguishing Attack on 3-Round Misty R Schemes 4.4 Key Recovery Attack Against Misty RKF Schemes 5 Security Proof on Misty R Scheme with 3 Rounds 5.1 H Coefficient Technique 5.2 Application to Misty R Scheme with 3 Rounds 6 Conclusion References An Efficient Authenticated Key Exchange from Random Self-reducibility on CSIDH 1 Introduction 1.1 Backgrounds 1.2 Contributions 1.3 Key Techniques 2 Hard Homogeneous Spaces and CSIDH 2.1 Hard Homogeneous Space 2.2 CSIDH 2.3 Key Exchanges Based on HHS 3 Random Self-reducibility of Isogeny-Based Problems 3.1 The Classical Diffie–Hellman-Related Problems 3.2 SIDH-Related Problems 3.3 CSIDH-Related Problems 4 Protocol CSIDH 4.1 AKE Security Model 4.2 Construction 4.3 Security 4.4 Efficiency Analysis 5 Conclusion A Authenticated Key Exchange A.1 CCGJJ Security Model A.2 Detailed Security Proof of CSIDH B CSIDH B.1 CSIDH as an Instantiation of HHS B.2 Detailed Description of CSIDH C Random Self-reducibility of the CSI-stDH Problem References Constructions and Designs A Sub-linear Lattice-Based Submatrix Commitment Scheme 1 Introduction 2 Preliminaries 2.1 System Setting 2.2 Module-SIS Assumption (MSIS) 2.3 Definitions Related to the Submatrix Commitment Scheme 3 Submatrix Commitment Scheme 4 Performance Analysis 5 Conclusion References PIPO: A Lightweight Block Cipher with Efficient Higher-Order Masking Software Implementations 1 Introduction 2 Specification of PIPO 3 Design Rationale of PIPO 3.1 S-Layer 3.2 R-Layer 4 Security Evaluation of PIPO 5 Performance Evaluation of Higher-Order Masking Implementations of PIPO 6 Performance Evaluation of Software and Hardware Implementations of PIPO 6.1 Software Implementations 6.2 Hardware Implementations 7 Conclusion A Test Vectors B Proofs of Proposition and Theorems B.1 Proof of Proposition 1 B.2 Proof of Theorem 1 B.3 Proof of Theorem 2 C 8-bit S-box of PIPO, S8 C.1 Table of the S8 C.2 Bitsliced Implementations of the S8 and Its Inverse References Efficient Implementations Curve448 on 32-Bit ARM Cortex-M4 1 Introduction 1.1 Contribution 2 Related Works 2.1 Target Curve: Curve448 2.2 Target Microcontroller: 32-Bit ARM Cortex–M4 2.3 Previous Implementations 3 Optimization Techniques for Curve448 on 32-Bit ARM Cortex-M4 3.1 Finite-Field Operations 3.2 Group Operations 3.3 Side-Channel Attack Protection 4 Evaluation 4.1 Trade-Off Between Performance and Security 5 Hybrid Post-Quantum TLS 6 Conclusion References Efficient Implementation of SHA-3 Hash Function on 8-Bit AVR-Based Sensor Nodes 1 Introduction 2 Background 2.1 Overview of SHA-3 2.2 Overview of 8-Bit AVR MCUs 3 Analysis of Existing Implementations of Hash Functions on 8-Bit AVR MCUs 4 Proposed SHA-3 Implementations in 8-Bit AVR MCUs 4.1 Main Idea 4.2 Proposed Implementation Technique on 8-Bit AVR MCUs 5 Performance Analysis 6 Concluding Remarks References Security Analysis Can a Differential Attack Work for an Arbitrarily Large Number of Rounds? 1 Introduction 2 Background: Markov Ciphers and Nonlinear Invariants 2.1 Weak Keys and Weak Components - Long Term Key 2.2 Nonlinear Cryptanalysis and Higher Order Nonlinear Cryptanalysis 2.3 On Success Probability and Annihilation Degree in Previous Attacks 3 Short Description of T-310 4 Some Early Attacks on T-310 and Related Questions 4.1 Linear and Non-Linear Invariants and Phase Transitions 4.2 Phase Transitions or How Impossible Becomes Possible 4.3 Invariant Hopping and Attack Lifting - Example 5 Constructing An Anomalous Differential Invariant Attack 5.1 Our Main Theorem - An Order Two Invariant Property 5.2 A Concrete Example 5.3 Proof of Thoerem5.1.1 6 Computer Simulations and the Choice of the Boolean Function 6.1 On Hiding Differentials 7 The Reciprocal Question, Nash Postulate, and Future Research 7.1 Some Conjectures - Differential Anomalies Vs. Invariants 7.2 Related Research - Special Contrived Ciphers 7.3 Weak Is Beautiful - The World of Periodic Attacks and Weak Keys 8 Conclusion Appendix A On Boolean Function Vulnerability Appendix B The Key Recovery Question Appendix B.1 New Ways to Exploit Polynomial Invariants Appendix B.2 Multiple Simultaneous Differentials and Cube Attacks References Key Mismatch Attack on ThreeBears, Frodo and Round5 1 Introduction 1.1 Our Contribution 1.2 Outline of the Paper 2 Preliminaries 2.1 Notations 2.2 Key Mismatch Oracle 2.3 Description of ThreeBears 3 Key Mismatch Attack on ThreeBears 3.1 High Level Description of the Attack 3.2 Choice of Queries 3.3 Error-Correcting Code 3.4 Results 4 Key Mismatch Attack on Frodo and Round5 4.1 Frodo 4.2 Round5 5 Conclusion A Proof of Lemma1 B Proof of m'[l] = 1 References A New Non-random Property of 4.5-Round PRINCE 1 Introduction 2 Preliminaries 2.1 The Block Cipher PRINCE 2.2 Subspace Trails 2.3 Subspaces of PRINCE 3 New Structural Property of 4.5-Round PRINCE 3.1 4.5-Round Subspace Trails for PRINCE 3.2 New Property of 4.5-Round PRINCE 4 A Detailed Proof of Lemma1 and Theorem5 5 Conclusion References Artificial Intelligence and Cryptocurrency Generative Adversarial Networks-Based Pseudo-Random Number Generator for Embedded Processors 1 Introduction 1.1 Contribution 2 Related Works 2.1 Random Number Generator 2.2 Random Number Generator Attack 2.3 Deep Learning Framework 2.4 Generative Adversarial Networks 2.5 Previous GAN-Based PRNG Implementations 3 Proposed Method 3.1 Design of Generator Model 3.2 Design of Predictor Model 3.3 Design of GAN-Based PRNG 3.4 GAN-Based PRNG in Embedded Processors 4 Evaluation 4.1 NIST Test Suite 4.2 Comparison with Existing PRNGs 4.3 Next Bit Test 4.4 State Compromise Attack Resistance 5 Conclusion References A RDBMS-Based Bitcoin Analysis Method 1 Introduction 2 Related Work 3 RDMBS-Based Bitcoin Analysis 3.1 Architecture 3.2 Database Schema 3.3 Bitcoin Analytics 3.4 Cluster Analytics 3.5 Graph Analytics 4 Analysis Results with Queries 4.1 Bitcoin Data 4.2 Which Address Has the Largest Amount of Bitcoin? 4.3 Clustering Bitcoin Addresses with Heuristics 4.4 Identify Clusters with Address-Tag Information 4.5 What Is the Amount and Count of Transactions to CryptoLocker Addresses? 4.6 List the Hot Wallet Addresses of a Korean Exchange A 4.7 Graph Analysis Algorithm Using Graph Tools 4.8 Community Detection Algorithm on Korean Exchange B Cluster 4.9 Performance 5 Conclusion A Three-Layer Table and Index Creation Query B Example Queries (Code Block) References Fault and Side-Channel Attack Federated Learning in Side-Channel Analysis 1 Introduction 2 Background 2.1 AES-128 2.2 Deep Learning Side-Channel Attacks 3 Training of Local Models 3.1 Choice of Neural Network Type 3.2 Training Process 3.3 Choice of Neural Network Architecture 4 Aggregation Methods 4.1 Model-Level Aggregation 4.2 Output-Level Aggregation 4.3 Data-Level Aggregation 5 Assumptions 6 Experimental Setup 6.1 Equipment for Power Analysis 6.2 Power Trace Acquisition 6.3 Estimation Metrics 7 Evaluation Results 7.1 Results of Model-Level Aggregation 7.2 Results of Output-Level Aggregation 7.3 Results of Data-Level Aggregation 8 Conclusion References Differential Fault Based Key Recovery Attacks on TRIAD 1 Introduction 2 Fault Attack 2.1 Fault Attack Models 2.2 Fault Injection Techniques 3 Description of TRIAD 3.1 TRIAD-AE Component Functions 3.2 Operation Phases of TRIAD-AE 4 Fault Attacks on TRIAD 4.1 Algebraic Normal Form (ANF) of the Keystream Function 4.2 Bit-Flipping Fault Attack on TRIAD 4.3 Random Fault Attack on TRIAD 4.4 Recovering the Remaining Register Bits 4.5 Experimental Analysis and Discussions 5 Conclusion References Author Index This book constitutes selected papers from the 23rd International Conference on Information Security and Cryptology, ICISC 2020, held in Seoul, South Korea, in December 2020. Due to the COVID-19, the conference was held online. The total of 15 papers presented in this volume were carefully reviewed and selected from 51 submissions. The aim of this conference was to provide an international forum for the latest results of research, development, and applications within the field of information security and cryptology