Innovative Security Solutions for Information Technology and Communications: 15th International Conference, SecITC 2022, Virtual Event, December 8–9, Revised Selected Papers

Description

This book constitutes the refereed post-conference proceedings of the 15th International Conference on Innovative Security Solutions for Information Technology and Communications, SecITC 2022, held as a virtual event, during December 8–9, 2022. The 19 revised full papers presented together with 1 invited talk were carefully reviewed and selected from 53 submissions. The papers cover topics such as cryptographic algorithms, digital forensics and cyber security and much more. Preface Organization Contents Interactional Freedom and Cybersecurity 1 Introduction 2 Democratic Security 3 Dictatorial Security 4 Beautiful Security 5 Invisible Security 6 Explainable Security 7 Case Study 8 Conclusions References Lightweight Permutation-Based Cryptography for the Ultra-Low-Power Internet of Things 1 Introduction 2 MSP430 Architecture 3 Overview of the AEAD Algorithms 4 Implementation Details 5 Performance Evaluation and Comparison 6 Conclusions References Bridges Connecting Encryption Schemes 1 Introduction 2 Preliminaries 2.1 Finite Distributions 2.2 Encryption Schemes and Bridges 3 The Security of a Bridge 4 A General Recipe for Constructing Bridges 4.1 On the Security of Gentry Type Bridges 4.2 A Variant of Gentry's Recipe 5 Conclusions A Examples of Gentry Bridges A.1 Description of the CSGN Scheme A.2 1st Bridge A.3 2nd Bridge A.4 3rd Bridge A.5 4th Bridge B Entangled Encryption Schemes B.1 Goldwasser-Micali Cryptosystem B.2 The Sander-Young-Yung Cryptosystem B.3 A Bridge from GM to SYY B.4 An Application C Experiments References Superpoly Recovery of Grain-128AEAD Using Division Property 1 Introduction 1.1 Our Contributions 1.2 Organization of the Paper 2 Preliminaries 2.1 Notations 2.2 Specification of Grain128AEAD 2.3 Cube Attack and Division Property 3 Superpoly Recovery for Grain-128AEAD Using Weak Keys 3.1 Cube Searching Algorithm for Grain-128AEAD 3.2 Searching Weak-Key Domain for Grain-128AEAD 3.3 Division Property-Based Cube Attack for Grain-128AEAD 4 Experimental Results 5 Conclusion and Future Work A Detailed Result for Cube Attacks Against Grain-128AEAD References On Single-Server Delegation of RSA 1 Introduction and Model 2 Delegation of Small-Exponent RSA Encryption 3 Single-Server Delegation of RSA Decryption 3.1 A Transformation to Achieve the Result's Security Property 3.2 A Protocol with Improved Server Runtime and Client Storage 4 On the Impact of Communication on Client Energy 5 Conclusions and Directions for Future Research A On Delegation of RSA Decryption B Delegation of Multiplication in Zn* C Public-Base Small-Exponent Exponentiation in Zn* References Constructing Pairing Free Unbounded Inner Product Functional Encryption Schemes with Unbounded Inner Product Policy 1 Introduction 2 Unbounded Zero Predicate IPFE 2.1 Lattices Preliminaries ch6AFV11,ch6ACGU20 3 Our LWE Based pubUIPFE 4 Our LWE Based UZP-IPFE 4.1 Security References Efficient Distributed Keys Generation of Threshold Paillier Cryptosystem 1 Introduction 1.1 Our Contribution 2 Preliminaries 2.1 Secret Sharing 2.2 Threshold Paillier Cryptosystem with a Trusted Dealer 2.3 Generating Random Triples Based on Hyper-Invertible Matrices 2.4 Message Authentication Code 2.5 Security 3 Our Distributed Keys Generation Scheme 3.1 Pre-processing Phase 3.2 Online Phase 4 Conclusion A Correctness of the Protocol Biprimarily References Statistical Tests for Symmetric Primitives 1 Introduction 1.1 Our Contribution 1.2 Organization 2 Related Works 3 Statistical Tests 3.1 Dataset 3.2 Statistical Test 3.3 NIST Statistical Test Suits 4 Experimental Results 4.1 Plaintext and Key Avalanche 4.2 Plaintext/Ciphertext Correlation 4.3 CBC Mode 4.4 Random 4.5 Plaintext and Key Low Density 4.6 Plaintext and Key High Density 5 Conclusions A NIST Statistical Test Results of Underlying Primitives for the Avalanche Dataset References MILP-Aided Cryptanalysis of the FUTURE Block Cipher 1 Introduction 2 Related Work 3 FUTURE 4 Construction of MILP Models 4.1 S-Box 4.2 Permutation 4.3 MDS Matrix Multiplication 4.4 XOR Operation 4.5 Construction of the Objective Function 5 Differential Cryptanalysis of FUTURE 5.1 Differential MILP Model Construction 5.2 Search Strategy 5.3 Results 6 Linear Cryptanalysis of FUTURE 6.1 Linear MILP Model Construction 6.2 Search Strategy 6.3 Results 7 Conclusion References Easy-ABE: An Easy Ciphertext-Policy Attribute-Based Encryption 1 Introduction 1.1 Related Work 1.2 Organization 2 Preliminaries 2.1 Access Structures 2.2 Ciphertext-Policy ABE 2.3 Security Model 2.4 Bilinear Maps and Diffie-Hellman Assumption 2.5 Some Cryptographic Primitives 2.6 Diffie-Hellman Integrated Encryption Scheme 3 Easy-ABE: Our CP-ABE Scheme 4 Security Analysis 5 Theoretical Comparison 6 Conclusion References MOTUS: How Quantized Parameters Improve Protection of Model and Its Inference Input 1 Introduction 2 Preliminaries 3 Problem Description 4 Methodology 4.1 Extension of Ternary Neural Networks 4.2 Algorithms of MOTUS 5 Experiments 5.1 Implementation 5.2 Results 6 Discussion 7 Conclusion A Transformation of Batch Normalization into Integers B Security Analysis C Architectures References Lightweight Authentication Using Noisy Key Derived from Physically Unclonable Function 1 Introduction 1.1 Lightweight Authentication Protocols 1.2 Our Contribution 1.3 Organization 2 Definition 3 Proposed Protocol 3.1 Idea 3.2 Construction 3.3 Security Considerations 3.4 Notes 4 Feasibility 4.1 Validity of Our Assumption 4.2 Feasibility Test with Simulation 4.3 Feasibility Test with Experiments 5 Discussion 5.1 Application to IoT Devices 5.2 Security and Efficiency 6 Conclusions A Related Works A.1 Helper-Data-Free PUF-Based Authentication: Slender PUF A.2 Non-PUF-Based Authentication B Proof Sketch of Theorem 1 References Card-Based Zero-Knowledge Proof Protocol for Pancake Sorting 1 Introduction 1.1 Pancake Sorting Problem 1.2 Computational Complexity of Pancake Sorting 1.3 Contribution 1.4 Related Work 2 Preliminaries 2.1 Physical Cards 2.2 Permutation Commitment 2.3 Integer Commitment 2.4 Pile-Scramble Shuffle and Composition of Permutations 3 Proposed Protocol 3.1 Concept 3.2 Protocol Description 4 Security and Performance 4.1 Security 4.2 Performance 5 Variants 5.1 Non-interactive Protocol with Fewer Additional Cards 5.2 Interactive Protocol with Fewer Additional Cards 5.3 Protocol with Fewer Shuffles 5.4 Protocol with Fewer Cards 6 Conclusion References Activity Detection from Encrypted Remote Desktop Protocol Traffic 1 Introduction 2 Related Work 3 Approach 3.1 System Setup 3.2 Data Collection 3.3 Individual Techniques and the Ensemble Predictor 3.4 Dataset 4 Results 5 Conclusions References Application-Oriented Anonymization Framework for Social Network Datasets and IoT Environments 1 Introduction 2 Related Work 3 Privacy Models 3.1 Social Network Anonymization 3.2 Anonymization in IoT Environment 4 The Proposed Schemes for Application-Oriented Anonymization 4.1 The Framework for Social Network Datasets 4.2 The Framework for IoT Environments 5 Vulnerability of Application-Oriented Anonymization to Composition Attacks 5.1 Methods for Restraining Composition Attacks 6 Conclusion References AI-Powered Vulnerability Detection for Secure Source Code Development 1 Introduction 2 Background and Related Work 2.1 Source Code Vulnerabilities and Weaknesses 2.2 Parsers and Scanners 2.3 Vulnerability Detection Methods 3 Methodology 3.1 Dataset 3.2 Model Architecture 4 Performance Evaluation 4.1 Machine Learning Models 4.2 Explainable AI 5 Conclusion and Future Works References Towards Verifying Physical Assumption in Card-Based Cryptography 1 Introduction 1.1 Background 1.2 Contributions 1.3 Organization 2 Preliminaries 2.1 Hyperspectral Camera 2.2 Related Matters 2.3 Related Work 3 Our Experiment 3.1 Hyperspectral Camera, Card, and Ink 3.2 Filming Environment 3.3 Experimental Procedure 3.4 Spectral Angle Mapper 4 Experimental Result 4.1 Blue Ink 4.2 Black Ink 5 Discussion 5.1 Spectrum in Blue Ink 5.2 Spectrum in Black Ink 6 Conclusion A Theoretical Considerations for Attacks A.1 How to Execute the Protocol A.2 Information Obtained from This Attack A.3 Discussion References The Security of Quasigroups Based Substitution Permutation Networks 1 Introduction 2 Preliminaries 2.1 Quasigroups 2.2 Quasigroup Differential Cryptanalysis 2.3 Quasigroup Substitution Permutation Network 3 Security Analysis 4 Conclusions References Unbounded Revocable Decentralized Multi-Authority Attribute-Based Encryption Supporting Non-monotone Access Structures 1 Introduction 1.1 Background 1.2 Our Contributions 1.3 Related Works 2 Preliminaries 2.1 Notations 2.2 Security Assumption 2.3 Dual Pairing Vector Spaces by Direct Product of Symmetric Pairing Groups 2.4 General Predicates: Non-monotone Access Structures with Inner-Product Relations 2.5 Revocation Framework Based on Full Binary Tree 3 Unbounded Revocable DMA-CP-ABE Supporting Non-monotone Access Structures 3.1 Syntax of Unbounded Revocable DMA-CP-ABE (UR-DMA-CP-ABE) 3.2 Security of UR-DMA-CP-ABE 3.3 Our Construction 3.4 Security Proof Sketch 4 Conclusion A Span Programs B Linear Secret Sharing Schemes C Usefulness of Splitting the Attribute Universe When Using the NOT Operator D Full Binary Tree E The Subset-Cover Revocation Framework (SC) F Comparison Between Existing DMA-CP-ABE and Ours F.1 Structure of Ciphertexts and Secret Keys F.2 Performance References Author Index