Innovative Security Solutions for Information Technology and Communications: 13th International Conference, SecITC 2020, Bucharest, Romania, November ... Selected Papers (Security and Cryptology)

This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Security for Information Technology and Communications, SecITC 2020, held in Bucharest, Romania, in November 2020. The 17 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 41 submissions. The conference covers topics from cryptographic algorithms, to digital forensics and cyber security and much more. Preface Organization Contents Elementary Attestation of Cryptographically Useful Composite Moduli 1 Introduction 2 Preliminaries and Building Blocks 2.1 Camenisch–Michels Proofs 2.2 Goldberg–Reyzin–Sagga–Baldimtsi Modulus Tests 2.3 Girault–Poupard–Stern Signatures 2.4 RSA Moduli with a Prescribed Pattern 3 Assembling the Puzzle to Get an Attestation 3.1 Checking that n Has Exactly Two Prime Factors 3.2 Checking for Factor Sizes 3.3 Checking that n Is a Cryptographically Useful Modulus 3.4 Optional Security Measures 4 Efficiency 5 Conclusion References Off-the-Shelf Security Testing Platform for Contactless Systems 1 Introduction 2 Background 3 Communication Standards 3.1 ISO14443A 3.2 ISO14443B 3.3 ISO18092 4 Implementation 4.1 PN532 4.2 TI RF430CL330H 4.3 Chameleon Mini 5 Conclusion References A New Generalisation of the Goldwasser-Micali Cryptosystem Based on the Gap 2k-Residuosity Assumption 1 Introduction 2 Preliminaries 2.1 2k-th Power Residue 2.2 Computational Complexity 2.3 Security Assumptions 2.4 Public Key Encryption 2.5 A Security Model for Biometric Authentication 3 A New Public Key Encryption Scheme 3.1 Description 3.2 Security Analysis 3.3 Implementation and Performance Analysis 4 An Application to Biometric Authentication 4.1 Description 4.2 Security Analysis 4.3 Performance Analysis 5 Conclusions and Further Development A Optimized Decryption Algorithms References New Insights on Differential and Linear Bounds Using Mixed Integer Linear Programming 1 Introduction 2 Background 2.1 Sun et al. (Active SBox: Eprint'13/Asiacypt'14) 2.2 Sun et al. (Exact Bound: Eprint'14) 2.3 Li et al. (Heuristic: Eprint'19) 3 Problem with Convex Hull Modelling 4 Automated Bounds with MILP: Our Proposal 4.1 Modelling 4.2 Optimizations 4.3 Results 5 Conclusion References Secure Card-Based Cryptographic Protocols Using Private Operations Against Malicious Players 1 Introduction 2 Preliminaries 2.1 Basic Notations 2.2 Private Operations 2.3 Space and Time Complexities 2.4 Malicious Actions During Private Operations 3 XOR, and and Copy Under Malicious Model 3.1 Additional Assumptions for Preventing Malicious Actions 3.2 XOR Protocol 3.3 And Protocol 3.4 COPY Protocol 4 Conclusion References Decentralized Multi-authority Anonymous Credential System with Bundled Languages on Identifiers 1 Introduction 1.1 Our Contribution and Related Work 2 Preliminaries 2.1 Bilinear Groups ch6GalbraithPS08,ch6EscalaG14 2.2 Structure-Preserving Signature Scheme ch6AbeFGHO10,ch6AbeHNOP17 2.3 Non-interactive Commit-and-Prove Scheme for Structure-Preserving Signatures 3 Our Bundled Language 4 Our Decentralized Multi-authority Anonymous Credential System 4.1 Syntax 4.2 Security Definitions 5 Construction and Security Proofs 5.1 Construction 5.2 Security Proofs 6 Conclusion A Four Properties of Commitment Part B Four Properties of Proof Part C Instantiation of Structure-Preserving Signature Scheme ch6AbeFGHO10,ch6AbeFGHO16 D Proof of Proposition 1 E Proof of Theorem 1 F Proof of Theorem 2 References A Scalable Simulation of the BB84 Protocol Involving Eavesdropping 1 Introduction 2 BB84 Protocol 2.1 No Eavesdropping 2.2 Intercept-Resend Attack 2.3 ``IBM Quantum Challenge'' 2.4 Simulation with Eavesdropping 3 Conclusion A Qiskit Source Code and Output A.1 ``IBM Quantum Challenge'' A.2 Simulation of Intercept-Resend Attack References Approach to Cryptography from Differential Geometry with Example 1 Introduction 1.1 Our Contribution and Related Work 1.2 Overview of Our Strategy 2 Preliminaries 2.1 Finsler Geometry 3 Our Proposed Public-Key Encryption 4 Example 5 IND-CCA2 Security 6 Appendix References On Using zk-SNARKs and zk-STARKs in Blockchain-Based Identity Management 1 Introduction 2 Related Work 3 Background 3.1 Blockchain-Based Identity Management 3.2 Zero-Knowledge Protocols 3.3 zk-SNARK and zk-STARK Program Representation 4 zk-SNARK and zk-STARK Comparison and Available Development Libraries 4.1 Development Libraries 5 Blockchain-Based Identity Management Using zk-SNARKs 5.1 General Architecture 5.2 Use-Cases 5.3 zk-SNARK Implementation 6 Results and Discussion 7 Conclusions References Manager Asks: Which Vulnerability Must be Eliminated First? 1 Introduction 1.1 State of the Art 1.2 Our Contribution 2 New Method Proposal 2.1 Basic Principle of Method 2.2 Calculation of Vulnerability Priority 3 Evaluation of the Method Suitability 4 Conclusion and Future Work 5 Attachments References An IND-CCA2 Attack Against the 1st- and 2nd-Round Versions of NTS-KEM 1 Introduction 1.1 Our Contribution 1.2 Related Works 1.3 Organization 2 Preliminaries 2.1 Key Encapsulation Mechanisms (KEMs) 2.2 IND-CCA2 Security of KEMs 2.3 Linear Codes 2.4 Binary Goppa Codes 2.5 The McEliece Cryptosystem 3 The 1st- and 2nd-Round Versions of NTS-KEM 3.1 Public Parameters and Parameter Sets 3.2 Key Generation 3.3 Encapsulation 3.4 Decapsulation 3.5 The Decoding Algorithm 3.6 NTS-KEM's Berlekamp-Massey Algorithm 4 Our Attack 4.1 The Adversary 4.2 Attacking the Specifications 4.3 Attacking the Non-reference Implementations A Paterson's Message B NTS-KEM's Berlekamp-Massey Algorithm C Attacking the Reference Implementations D Implementations E The modified berlekamp_massey.c F The modified ntskem_test.c References Behaviour-Based Biometrics for Continuous User Authentication to Industrial Collaborative Robots 1 Introduction 2 Related Work 3 Proposed User to Cobot Authentication 3.1 Trust Model 4 Methodology 4.1 Experimental Design 4.2 Selected Collaborative Robot 4.3 Subjects and Data Collection 4.4 Feature Extraction 4.5 Feature Selection 4.6 Considered Classifiers 5 Results and Discussion 5.1 Performance Evaluation of Single-Use Biometric Authentication System 5.2 Performance Evaluation of the Continuous Biometric Authentication (CBA) System 6 Conclusions and Future Work References Secure Speaker Recognition System Using Homomorphic Encryption 1 Introduction 2 Related Work 2.1 Homomorphic Encryption 2.2 Speaker Recognition 2.3 Convolutional Neural Networks 3 Speaker Recognition System 3.1 HE - Speaker Identifier Client 3.2 pyHE Client 3.3 HE - Speaker Identifier Server 4 Experimental Results 5 Conclusions References Reliable RFID Offline Privacy 1 Introduction 2 Notations, Definitions and Concepts 3 RFID Systems 3.1 RFID Schemes 3.2 Adversarial Model 3.3 Security 3.4 Privacy 3.5 Vaudenay's Model for Offline Schemes 4 Offline Privacy in RFID Protocols 4.1 Related Work 4.2 Privacy+ Discussion 5 Proposed Protocol 5.1 Protocol Description 5.2 Security and Privacy Analysis 6 Conclusions A Hash and PUF-Based RFID Scheme References Virtualization and Automation for Cybersecurity Training and Experimentation Abstract 1 Introduction 2 Related Work 3 Underlying Technologies 3.1 Hardware Infrastructure 3.2 Virtualization Technologies 3.3 Automation and Configuration Management Tools 3.4 Target Infrastructure 3.5 Orchestration System 4 Architecture and Workflows 5 Use Cases 5.1 Education and Awareness 5.2 Cyber Exercises 5.3 Experimentation and Research 6 Conclusions Acknowledgements References Long-Term Secure Deniable Group Key Establishment 1 Introduction 2 Preliminaries 2.1 Bilinear Maps and the Bilinear Diffie Hellman Assumption 2.2 Multi Key Encapsulation and Symmetric Encryption 2.3 Message Authentication Codes and Ring Signatures 2.4 Real-or-Random Indistinguishability 3 Security Model 4 Deniability 5 The Proposed Group Key Establishment Protocol 5.1 Security Analysis 6 Conclusion References Card-Based Covert Lottery 1 Introduction 1.1 Defining the Functionality for Two Players 1.2 Defining the Functionality for Multiple Players 1.3 Contribution 1.4 Related Work 2 Preliminary 2.1 Deck of Cards 2.2 Random Bisection Cut 2.3 Pile-Scramble Shuffle 2.4 Six-Card AND Protocol 3 A Secure Protocol for Deciding the First Turn 3.1 Idea 3.2 Description 4 Covert Lottery Protocol 4.1 Idea 4.2 Description 4.3 Security 5 Conclusion References Hardware-Accelerated Cryptography for Software-Defined Networks with P4 1 Introduction 1.1 Contribution 2 Related Work 3 Preliminaries 4 Design of FPGA-Based Crypto Accelerator 4.1 System Architecture 4.2 P4 Workflow 4.3 Main Advantages of P4 Workflow 5 Hardware Implementation and Results of Cryptographic Blocks and P4 Core 5.1 Hardware Implementation of Cryptographic External Blocks 5.2 Hardware Resources of Cryptographic External Blocks 5.3 Implementation of P4 Core 5.4 Example of Customized Cryptographic Accelerator 6 Conclusion A Input and Output signals in implemented cryptographic components B Comparison of Scalar Point Multiplication Implementations on FPGA References Security Analysis Using Subjective Attack Trees 1 Introduction 2 Subjective Logic 3 An Overview of Subjective Attack Trees 4 Adding Countermeasures to SATs 5 Security Analysis in SATs 5.1 Risk Computation 5.2 Dealing with Uncertainty for Decision Analysis 5.3 Analysing Security Investment: ROI Analysis 6 An Illustrative Example 7 Experimental Evaluation 8 Conclusions and Future Work References Author Index