Cryptology and Network Security: 21st International Conference, CANS 2022, Abu Dhabi, United Arab Emirates, November 13–16, 2022, Proceedings (Lecture Notes in Computer Science)

This book constitutes the refereed proceedings of the 21 st International Conference on Cryptology and Network Security, CANS 2022, which was held during November 13-16, 2022. The conference was took place in Abu Dhabi, United Arab Emirates. The 18 full and 2 short papers presented in these proceedings were carefully reviewed and selected from 54 submissions. They were organized in topical sections as follows: zero-knowledge and MPC; public-key infrastructure; attacks and countermeasures; cryptanalysis and provable security; cryptographic protocols; blockchain and payment systems; and codes and post-quantum cryptography. Preface Organization Contents Zero-Knowledge and MPC Efficient NIZK Arguments with Straight-Line Simulation and Extraction 1 Introduction 2 Definitions and Tools 2.1 Argument Systems 2.2 Cryptographic Puzzles 2.3 Or-Composition of -Protocols 3 Fischlin's NIZK Argument and Its Randomized Version 4 On the WI of Protocol in Fig.1 5 Our Efficient NIZK Argument of Knowledge References Updatable NIZKs from Non-Interactive Zaps 1 Introduction 2 Preliminaries 2.1 NI Zap and NI-ZoK Arguments 2.2 NIZKs with Trusted, Subverted, and Updatable SRS 2.3 Assumptions 2.4 Key Updatable, One-time, and Key Homomorphic Signatures 3 Bellare et al.'s Sub-ZK NIZK Can Achieve U-SND 4 Sub-ZK and U-{SS, SE} NIZKs from NI Zaps 5 Conclusion References Through the Looking-Glass: Benchmarking Secure Multi-party Computation Comparisons for ReLU's 1 Introduction 1.1 Related Work 1.2 Our Contributions 1.3 Outline 2 Preliminaries 2.1 Notation 2.2 Arithmetic Black Box 2.3 ReLU 3 Ad(a/o)pting Rabbit 3.1 Inequality Tests 3.2 Beyond Rabbit 3.3 Optimized Rabbit for ReLU's 4 Constant Round Catrina and De Hoogh 4.1 Modulo 2m (mod2m) 4.2 Catrina and De Hoogh Constant Round LTZ (cons_ltz) 5 Benchmarking 5.1 Prototype 5.2 Results 5.3 Practical Scenarios 6 Conclusion, Discussion and Future Work 1 Rabbit Definitions 1.1 The Problem 1.2 The Rabbit Principle 2 Constant Round ReLU Protocol References Public-Key Infrastructure Oh SSH-it, What's My Fingerprint? A Large-Scale Analysis of SSH Host Key Fingerprint Verification Records in the DNS 1 Introduction 1.1 Related Work 1.2 Contributions 2 Background 2.1 Host Key Verification 2.2 SSHFP Records 3 Methodology 3.1 Data Collection 3.2 Data Analysis 3.3 Replicability 4 Evaluation 4.1 Tranco 1M 4.2 Certificate Transparency Logs 5 Discussion 5.1 Prevalence of SSHFP Records 5.2 Security and Privacy 5.3 Limitations 5.4 Future Work 6 Summary and Conclusion References Attribute-Based Anonymous Credential: Optimization for Single-Use and Multi-Use 1 Introduction 1.1 Motivation 1.2 Our Contributions 1.3 Overview of Our Scheme 1.4 Related Works 2 Preliminaries 2.1 Bilinear Pairing 2.2 Security Assumptions 2.3 The SDH-Based Camenisch and Lysyanskaya (CL) Signature 2.4 Share Conversion Protocol 3 Security Requirements for Attribute-Based Anonymous Credential 3.1 Impersonation Resilience 3.2 Anonymity 3.3 Unlinkability 4 Our Construction on Credential Issuance 4.1 Key Generation 4.2 Issue of Credentials 4.3 Zero-Knowledge Proofs for Multi-use Show Proof 5 Security 5.1 Impersonation Resilience 5.2 Anonymity 5.3 Unlinkability 6 Single-Use Credential and Anonymity Proof 6.1 Proof of Possession of Single-Use Credential 6.2 Proof of Anonymity 6.3 Batch the Single-use Credentials 7 Conclusion and Further Extensions A Proof of Theorem 1 A.1 Proof of Lemma 1 A.2 Proof of Lemma 2 A.3 Proof of Lemma 3 B Proof of Theorem 2 C Proof of Theorem 3 D Proof of Theorem 4 E Correctness for the Equations from Section6.1 E.1 And proof (Sect.6.1.1) E.2 ANY proof (Sect.6.1.2) E.3 NAND proof (Sect.6.1.3) E.4 NANY proof (Sect.6.1.4) References Auditable Asymmetric Password Authenticated Public Key Establishment 1 Introduction 1.1 Our Contributions 2 Related Work 3 Preliminaries 4 A2PAKE 5 UC-secure Protocol 5.1 Setup Assumptions 5.2 Generic Description of Our Protocol 5.3 Concrete Instantiation 6 Evaluation References (Augmented) Broadcast Encryption from Identity Based Encryption with Wildcard 1 Introduction 2 Preliminaries 2.1 Broadcast Encryption 2.2 Augmented Broadcast Encryption 2.3 Identity-Based Encryption with Wildcard 2.4 Other Definitions 3 Generic Construction of AugBE from WIBE 3.1 Broadcast Encryption from WIBE 3.2 Augmented Broadcast Encryption from WIBE 4 Instantiations of WIBE 4.1 WIBE with Constant Size Ciphertext 4.2 Pattern Hiding WIBE References Attacks and Countermeasures Passive Triangulation Attack on ORide 1 Introduction 1.1 Triangulation 1.2 Threat Model 1.3 Our Contribution 2 Overview of ORide ch8ORidePaper and Its Noisy Variant ch8deepakOridePaper 2.1 ORide ch8ORidePaper 2.2 Noisy Variant of ORide ch8deepakOridePaper 3 Location Harvesting Attacks 3.1 Preliminaries 3.2 Basic Triangulation Attack 3.3 Attack on ORide Protocol 3.4 Attack on Noisy Version of ORide 3.5 Correctness and Time Complexity 3.6 Mobile Drivers in the ORide Protocol 4 Experiments and Results 4.1 Experiment Details 4.2 Discussion of Results 4.3 Post-processing of Our Experiment Results 5 Related Works 5.1 Ride-Hailing Services 5.2 Triangulation 6 Conclusion and Future Work A Algorithms for Triangulation Attack References HyperDetector: Detecting, Isolating, and Mitigating Timing Attacks in Virtualized Environments 1 Introduction 2 Background 2.1 Intel VT-x 2.2 KVM 3 HyperDetector 4 Experiments 5 Related Work 6 Concluding Remarks References Cryptanalysis and Provable Security The Construction and Application of (Related-Key) Conditional Differential Neural Distinguishers on KATAN 1 Introduction 2 Preliminaries 2.1 Notation 2.2 Description of KATAN 2.3 Related-Key Cryptanalysis 2.4 Description of Differential Cryptanalysis Based on Deep Learning 3 (Related-Key) Conditional Differential Neural Distinguishers Based on MILP 3.1 Data Format of (Related-Key) Conditional Differential Neural Distinguishers 3.2 Neural Network Structure 3.3 MILP Model of KATAN Family 3.4 (Related-Key) Conditional Differential Neural Distinguishers 4 Key Recovery Attack of KATAN32 4.1 Training of Related-Key Conditional Differential Neural Distinguishers 4.2 125-Round Practical Key Recovery Attack of KATAN32 5 Key Recovery Attack of KATAN48 and KATAN64 5.1 106-Round Practical Key Recovery Attack of KATAN48 5.2 95-Round Practical Key Recovery Attack of KATAN64 5.3 Extension of Key Recovery Attack 6 Conclusion A Appendix References How to Design Authenticated Key Exchange for Wearable Devices: Cryptanalysis of AKE for Health Monitoring and Countermeasures via Distinct SMs with Key Split and Refresh 1 Introduction 1.1 Contribution 1.2 Related Work 1.3 Structure of Paper 2 Preliminaries 2.1 System Settings 2.2 Threat Model 2.3 Notation 3 An Impersonation Attack on the LR-AKE Scheme 3.1 Original Scheme 3.2 Attack Description 4 Methodology for Improving LR-AKE 4.1 Secure AKE Construction with Signature Components 5 Improved LR-AKE Using Split Schnorr Signatures with Key Refresh and OOB Optical Inspection 5.1 Separated SM for Key Splitting 5.2 Schnorr Signatures with Additive Key Splitting and Refresh 6 Security Analysis 6.1 Modification of the Canetti-Krawczyk Security Model 6.2 Security Against Impersonation and Session Key Secrecy 7 Conclusion References Cryptanalysis of the Multi-Power RSA Cryptosystem Variant 1 Introduction 2 Preliminaries 3 The CRT-Multi-Power RSA 4 Solving the Linear Equation 5 Applications of the New Method 5.1 Application to the Multi-Power RSA 5.2 Application to the Generalization of the Multi-Power RSA 5.3 Application to the CRT Multi-power RSA 6 Conclusion References Provable Security of HADES Structure 1 Introduction 1.1 Background 1.2 Our Results 1.3 Organization 2 Preliminaries 2.1 The HADES Construction 2.2 The H-Coefficients Technique 3 SPRP Security of 4-Round HADES 3.1 Terminology, and Outline of the Proof 3.2 Bad Transcript Extensions and Probability 3.3 Analysis for Good Transcript 3.4 Analyzing Good Transcript Extensions 4 Attack Against 3 Rounds 5 Conclusion References Cryptographic Protocols Practical Single-Pass Oblivious Aggregation and Billing Computation Protocols for Smart Meters 1 Introduction 1.1 Related Work 1.2 Our Contribution 2 Preliminaries 2.1 Cryptographic Tools 3 Our Smart Metering System Model 3.1 Problem Statement 3.2 Threat Model 4 Authenticated Aggregated Oblivious Encryption 5 Our Oblivious Aggregation and Billing Protocol 6 Experimental Evaluation 7 Conclusion and Future Work References Anonymous Random Allocation and Its Applications 1 Introduction 1.1 Our Technique 1.2 Related Work 2 Preliminaries 2.1 Syntax and Security of ARA 3 Our ARA Protocol 3.1 Construction 4 Security Analysis A Appendix : Missing Materials References ACDC: Anonymous Crowdsourcing Using Digital Cash 1 Introduction 2 System Overview and Security Goals 3 Authentication Protocol 4 K-Anonymous Reporting 5 Results, Performance and Simulations 5.1 K-Anonymity 6 Related Work 7 Conclusion References Blockchain and Payment Systems Analyzing Price Deviations in DeFi Oracles 1 Introduction 2 Related Works 3 Price Deviations in DeFi Oracles 4 Evaluation 4.1 Data Collection 4.2 Analysis of Price Deviations 5 Conclusion and Future Works References Redacting Blockchain Without Exposing Chameleon Hash Collisions 1 Introduction and Previous Works 2 Preliminaries 2.1 Classical Chameleon Hash Scheme 2.2 Secret-Coin Chameleon-Hash 2.3 Basics on Bitcoin Backbone Protocol 2.4 Ateniese's Redactable Blockchain 3 Redacted Blockchain Based on Preimage Chameleon Hash Functions 4 Security Discussion 5 Instantiating Preimage Chameleon Hash Functions 5.1 Classical Construction Based on Factoring and Modular Square Root 5.2 Post-Quantum Construction Based on Lattices 6 Experiments 7 Conclusion References Codes and Post-quantum Cryptography Efficient Proofs of Retrievability Using Expander Codes 1 Introduction 1.1 Context and State-of-the-Art 1.2 Contributions 2 Background 2.1 The Constructive Cryptography Model 2.2 Proofs of Retrievability 2.3 Expander Graphs and Expander Codes 3 PoR with Expander Codes 3.1 Audit 3.2 Description of Our PoR with Expander Codes: The General Case 3.3 Instantiation with the Point-Line Incidence Graph of the Plane 3.4 Parameters References Post-Quantum Electronic Identity: Adapting OpenID Connect and OAuth 2.0 to the Post-Quantum Era 1 Introduction 2 Background 2.1 OAuth 2.0 2.2 OpenID Connect 2.3 OAuth 2.0 and OIDC Security Considerations 2.4 Transport Layer Security 1.3 2.5 Post-Quantum Cryptography 3 Related Work 3.1 Method 3.2 Execution 4 Post-Quantum OAuth 2.0 and OIDC 5 Empirical Evaluation 5.1 Case Study 5.2 Prototype Implementation 5.3 Experiment Plan 5.4 Experimental Results 6 Conclusion and Future Works References Author Index