Information and Communications Security: 25th International Conference, ICICS 2023, Tianjin, China, November 18–20, 2023, Proceedings (Lecture Notes in Computer Science)
معرفی کتاب «Information and Communications Security: 25th International Conference, ICICS 2023, Tianjin, China, November 18–20, 2023, Proceedings (Lecture Notes in Computer Science)» نوشتهٔ Ding Wang (editor), Moti Yung (editor), Zheli Liu (editor), Xiaofeng Chen (editor)، منتشرشده توسط نشر Springer Verlag در سال 2023. این کتاب در فرمت pdf، زبان انگلیسی ارائه شده است.
This volume LNCS 14252 constitutes the refereed proceedings of 25th International Conference on Information and Communications Security , ICICS 2023, held in Tianjin, China, during November 18–20, 2023. The 38 full papers presented together with 6 short papers were carefully reviewed and selected from 181 submissions. The conference focuses on: Symmetric-Key Cryptography; Public-Key Cryptography; Applied Cryptography; Authentication and Authorization; Privacy and Anonymity; Security and Privacy of AI; Blockchain and Cryptocurrencies; and System and Network Security. Preface Organization Abstracts of Keynotes TEE-assisted Crypto Systems: Towards Designing Practical Data Security Solutions Covert&Side Stories: Threats Evolution in Traditional and Modern Technologies Contents Symmetric-Key Cryptography SAT-Aided Differential Cryptanalysis of Lightweight Block Ciphers Midori, MANTIS and QARMA 1 Introduction 2 Preliminaries 2.1 The Lightweight Block Cipher Midori-128 2.2 The Tweakable Block Cipher QARMA-64 3 Searching the Optimal Differential Characteristics with SAT Method 4 Differential Attack on 12-Round Midori-128 5 Related-Tweak Differential Attack on 11-Round QARMA-64 6 Conclusion References Improved Related-Key Rectangle Attack Against the Full AES-192 1 Introduction 2 Preliminaries 2.1 Description of AES 2.2 Rectangle Attack 2.3 Notations 3 Guessing Key Strategy for a Nonlinear Key Schedule 4 Improved Rectangle Attack on AES-192 4.1 Distinguisher of AES-192 4.2 A Detailed Description of the Attack on AES-192 5 Discussion and Conclusion References Block Ciphers Classification Based on Randomness Test Statistic Value via LightGBM 1 Introduction 2 Related Work 3 Preliminaries 3.1 Electronic Codebook Mode 3.2 Randomness Test Statistic Value 3.3 LightGBM 4 Block Ciphers Classification 4.1 Feature Selection and Extraction 4.2 Classification Scheme Based on LightGBM 5 Experimental Results 5.1 Evaluation Metrics 5.2 Experimental Results and Analysis 6 Conclusion References Cryptanalysis of Two White-Box Implementations of the CLEFIA Block Cipher 1 Introduction 2 Preliminaries 2.1 Notation 2.2 The CLEFIA Block Cipher 3 Collision-Based Attack on Su et al.'s White-Box CLEFIA Implementation 3.1 Su et al.'s White-Box CLEFIA Implementation 3.2 Attacking Su et al.'s White-Box CLEFIA Implementation 4 On the Security of Yao Et Al.'s White-Box CLEFIA Implementation Against Collision-Based Attack 4.1 Yao Et Al.'s White-Box CLEFIA Implementation 4.2 Security of Yao Et Al.'s Implementation Against Collision Attack 5 Concluding Remarks References PAE: Towards More Efficient and BBB-Secure AE from a Single Public Permutation 1 Introduction 2 Preliminaries 3 Definition of PAE 4 Proof of Theorem 1 5 Analysis of Good Transcripts 5.1 Establishing a Lower Bound on p(Tr*) 5.2 Lower Bound of p1(Tr*) 5.3 Lower Bound of p2(Tr*) 6 Instantiation 7 Software Implementation for 32-bit Microcontrollers 8 Summary References Public-Key Cryptography A Polynomial-Time Attack on G2SIDH 1 Introduction 2 Preliminaries 2.1 Abelian Varieties and Isogenies 2.2 G2SIDH 2.3 Efficient Attacks on High-Dimensional SIDH 3 Isogenies Between High-Dimensional PPAVs 3.1 Isogeny Computation Between High-Dimensional PPAVs 3.2 The Number of -isogenies Between Dimension g PPAVs 4 Parameter Tweaks in 4g-attack 4.1 Select Suitable NA' and NB' 4.2 Generate New Public Key When Selecting NA' 4.3 Generate New Public Key When Selecting NB' 5 Efficiency Analysis 5.1 General Analysis 5.2 Concrete Attack Algorithms on G2SIDH 6 Conclusion A Algorithms References Improvements of Homomorphic Secure Evaluation of Inverse Square Root 1 Introduction 1.1 Our Contributions 1.2 Outline 2 Preliminaries 2.1 Notations 2.2 CKKS Homomorphic Encryption Scheme 2.3 Approximation Theory 3 Iterative Algorithm for Inverse Square Root 3.1 Why Use an Iterative Approximation Algorithm Instead of Direct Approximation 3.2 Newton's Method for Approximating Inverse Square Root 4 Our Two Methods for Selecting Initial Value 4.1 Taylor Expansion as Initial Value 4.2 Rational Function as Initial Value 5 Implementation Details and Experiments 5.1 Implementation of Taylor Expansion Method 5.2 Implementation of Rational Function Method 5.3 Experiment Results 6 Conclusion References Oblivious Transfer from Rerandomizable PKE 1 Introduction 1.1 Our Contribution 1.2 Technical Overview 1.3 Related Primitives 2 Preliminaries 2.1 Oblivious Transfer 2.2 Rerandomizable Public-Key Encryption 2.3 Reviewing the Previous PKE-Based OT Protocols 3 Sender-Friendly Oblivious Transfer 3.1 First Attempt: OT with Constant Sender-Cost and Exponential Receiver-Cost 3.2 A Reduction from Long OT to Short OT 3.3 Putting It All Together: OT with Sublinear Sender-Cost and Polynomial Receiver-Cost 4 Receiver-Friendly Oblivious Transfer 5 Comparision to the Previous OT Protocols Based on Special Types of PKE 5.1 Comparison with Respect to 1-out-of-2 OT 5.2 Comparison with Respect to 1-out-of-n OT 6 Conclusion A From Bit-OT to String-OT A.1 Sender-Friendly 1-out-of-n String-OT A.2 Receiver-Friendly 1-out-of-n String-OT References Forward Secure Lattice-Based Ring Signature Scheme in the Standard Model 1 Introduction 1.1 Contributions and Approaches 1.2 Related Works 1.3 Organization 2 Preliminaries 2.1 Lattices 2.2 Hardness Assumption 2.3 Lattice Algorithms 3 Syntax of Forward Secure Ring Signature 3.1 System Model 3.2 Anonymity 3.3 Forward Security 4 Lattice-Based Construction 4.1 Description of Key Update with Time Periods 4.2 Our Lattice-Based Proposal 4.3 Security Analysis 5 Conclusion References Applied Cryptography Secure Multi-party Computation with Legally-Enforceable Fairness 1 Introduction 1.1 Backgrounds 1.2 Related Works 1.3 Our Contribution 2 Preliminaries 2.1 Basic Notations 2.2 Public-Key Infrastructure 2.3 Trusted Bank Functionality 2.4 Secure Computation with Abort 3 Existing Protocol for Two-Party Setting 3.1 Ideal Functionality for Secure Two-Party Computation 3.2 Two-Party Protocol with Legally Enforceable Fairness 4 Secure Multi-party Computation with Legally Enforceable Fairness 4.1 Ideal Functionality for Secure Multi-party Computation 4.2 Proposed Protocol I: O(n) Rounds, O(n2) Communications, and O(n) Fees 4.3 Proposed Protocol II: O(1) Rounds, O(n) Communications, and O(n2) Fees 5 Conclusion A Security Proof for Proposed Protocol I References On-Demand Allocation of Cryptographic Computing Resource with Load Prediction 1 Introdiction 2 Related Work 2.1 Resource Allocation 2.2 Load Prediction 3 System Model and Problem Formula 3.1 System Model 3.2 Problem Formula 4 Load-Predicted-Based Cryptographic Computing Resource Allocation 4.1 Cluster-Based Load Prediction Algorithm 4.2 Load Prediction Based Resource Allocation Algorithm 5 Experiment 5.1 Experimental Setup 5.2 Data Generate Method 5.3 Accuracy of Load Prediction 5.4 Performance Comparison of Resource Allocation Algorithms 6 Conclusion References Private Message Franking with After Opening Privacy 1 Introduction 2 PMF: Private Message Franking 2.1 Privacy Leakage with CEP 2.2 Committing Nonce Based Authenticated Encryption with Partial Opening(CEPO) 2.3 After Opening Privacy 3 Facebook Franking 4 CEP-AOP1 4.1 Description 4.2 Security Analysis 4.3 Shortcomings for CEP-AOP1 5 CEP-AOP2 5.1 Description 5.2 Security Analysis 6 Related Work A Proofs References Semi-Honest 2-Party Faithful Truncation from Two-Bit Extraction 1 Introduction 1.1 Our Contributions 1.2 Organization 2 Preliminaries 2.1 System Model and Security 2.2 Basic Operations 2.3 Parallel Prefix Adder (PPA) 3 Two-Bit Extraction 3.1 Defining Two-Bit Extraction 3.2 Trivial Construction for F2Bit-Extrl, s 3.3 Improved Construction 2Bit-Extrl, s 4 Truncation Errors and Faithful Truncation 4.1 Why Local Truncation Fails 4.2 Faithful Truncation from Two-Bit Extraction 5 Experiments 6 Conclusions References Outsourcing Verifiable Distributed Oblivious Polynomial Evaluation from Threshold Cryptography 1 Introduction 1.1 Background 1.2 Applications 1.3 Our Contribution 2 Preliminaries 2.1 Secret Sharing 2.2 Threshold Paillier Cryptosystem with a Dealer 2.3 Message Authentication Code 2.4 Security 3 Our DOPE Scheme 3.1 Setup Phase 3.2 Computation Phase 4 Conclusion References Authentication and Authorization PiXi: Password Inspiration by Exploring Information 1 Introduction 2 Related Work 3 System Design 4 User Studies 5 Results 5.1 Evaluation of Nudging Efficacy 5.2 Security Analysis 5.3 Usability Analysis 6 Conclusion References Security Analysis of Alignment-Robust Cancelable Biometric Scheme for Iris Verification 1 Introduction 2 Related Work 3 Random Augmented Histogram of Gradients (RHoG) 3.1 Step-1: Random Augmentation 3.2 Step-2: Gradient Orientation and Magnitude Calculation 3.3 Step-3: Matrix Partitioning and Histogram Formalization 3.4 Step-4: Z-Score Transformation 4 Reversing Z-Score Transformation 5 Linkability Attack on RHoG 5.1 Link with c and p Directly 5.2 Link with T and p 6 Experimental Results and Discussion 6.1 Experiment on Reversing Z-Score Transformation 6.2 Experiment on Linkability 7 Conclusion References A Certificateless Conditional Anonymous Authentication Scheme for Satellite Internet of Things 1 Introduction 2 Related Work 3 System Model 4 Definition and Security Model of CA-CL-ISE 5 Proposed Scheme 5.1 SM2-CL-ISE Scheme 5.2 Authentication System 6 Security Analysis 7 Performance Evaluation 7.1 Theoretical Analysis 7.2 Practical Simulation 8 Conclusion References BLAC: A Blockchain-Based Lightweight Access Control Scheme in Vehicular Social Networks 1 Introduction 1.1 Motivations 1.2 Contributions 2 Related Work 3 Preliminaries 3.1 Linear Secret-Sharing Scheme (LSSS) 3.2 Practical Byzantine Fault Tolerance (PBFT) 4 System Model and Design Goals 4.1 System Model 4.2 Chain Tolerance Semi-trusted Model 4.3 Security and Performance Goals 5 The Proposed Scheme 5.1 Construction of BLAC 5.2 Ciphertext Piece Storage and Recovery 6 Security Analysis 7 Performance Analysis 7.1 Computational Cost 7.2 Storage Cost 8 Conclusion References Privacy and Anonymity Link Prediction-Based Multi-Identity Recognition of Darknet Vendors 1 Introduction 2 Related Work 2.1 Author Attribution and Author Alias 2.2 Multi-identity Recognition in Darknet 2.3 Labeling of Vendor Identity 3 Data Acquisition and Preprocessing 3.1 Data Acquisition 3.2 Feature Extraction 3.3 Sample Labeling 4 Link Prediction 4.1 Construct the Network 4.2 Derive the Implicit Representation 4.3 Link Prediction 5 Experiment and Analysis 5.1 Experimental Setup 5.2 Results and Discussion 6 Conclusion and Future Work References CryptoMask: Privacy-Preserving Face Recognition 1 Introduction 1.1 Related Work 2 Background 2.1 Face Recognition 2.2 Encoding Method 2.3 Homomorphic Encryption 2.4 Key-Switching 2.5 Secret Sharing 2.6 Secure Comparison 3 Overview of Our Approach 3.1 System Model 3.2 Threat Model 3.3 Overview of CryptoMask 3.4 Data Representation 4 CryptoMask Details 4.1 Our Encoding Method 4.2 Enrolment Process 4.3 Evaluation Process 4.4 Security Analysis 4.5 Optimizations 5 Performance Evaluation 5.1 Efficiency 6 Conclusion A Complexity and Security Analysis A.1 Complexity Analysis A.2 Security Analysis B Accuracy References Efficient Private Multiset ID Protocols 1 Introduction 1.1 Motivation 1.2 Our Contribution 1.3 Overview of Our Techniques 2 Preliminaries 2.1 Security Model 2.2 Building Blocks 3 Deterministic-Value (Oblivious) Programmable PRF 3.1 Definitions 3.2 Construction of dv-PPRF 4 Private Multiset ID 4.1 PMID from Sloppy OPRF 4.2 PMID from Standard OPRF 5 Applications 6 Implementation and Performance 6.1 Implementation Details 6.2 Performance Analysis A Proof of Partial Obliviousness References Zoomer: A Website Fingerprinting Attack Against Tor Hidden Services 1 Introduction 2 Related Work 2.1 WFA Against HS 2.2 CNN-Based WFA 3 Design of HS Fingerprint 3.1 Analysis of HS Access Traffic 3.2 HS Fingerprint Generation Based on Bursts 4 Design of WFA Model 4.1 Model Overview 4.2 CNN Module 4.3 GBA Module 5 Experiments 5.1 Experiment Settings 5.2 Verification of HS Fingerprint 5.3 Verification of GBA 5.4 Performance Comparison in Closed-World Scenario 5.5 Performance Comparison in Open-World Scenario 6 Conclusion References An Enhanced Privacy-Preserving Hierarchical Federated Learning Framework for IoV 1 Introduction 2 Threat Model and Design Goal 3 Method 3.1 Hierarchical Secure Federated Learning 3.2 Detection of Malicious Tampering 3.3 Security Analysis 4 Experimental Results 4.1 Experimental Settings 4.2 Results References Security and Privacy of AI Revisiting the Deep Learning-Based Eavesdropping Attacks via Facial Dynamics from VR Motion Sensors 1 Introduction 2 Preliminaries 2.1 Speech-Related Facial Movement Data 2.2 Bone-Borne and Air-Borne Vibrations 2.3 Facial Dynamics from Motion Sensors 2.4 Facial Anthropometric Differences 3 Related Works 4 Attack Overview 5 Proposed Model 6 Data Overview 6.1 Data Collection 6.2 Data Selection 6.3 Data Segmentation 7 Experiments 7.1 Experimental Setup 7.2 Targeted Attack 7.3 Untargeted Attack 7.4 Experiment Scenarios 8 Results 8.1 Targeted Attacks 8.2 Untargeted Attacks 9 Conclusion References Multi-scale Features Destructive Universal Adversarial Perturbations 1 Introduction 2 Related Work 2.1 Image-Dependent Adversarial Attacks 2.2 Image-Agnostic Adversarial Attacks 3 The Proposed Method 3.1 Non-targeted Universal Attack 3.2 Targeted Universal Attack 4 Experiments 4.1 Universal Attack on CIFAR-10 Dataset 4.2 Universal Attack on ImageNet Dataset 5 Conclusions References Pixel-Wise Reconstruction of Private Data in Split Federated Learning 1 Introduction 2 Related Work 2.1 Federated Learning 2.2 Split Learning 3 Method 3.1 Security Analysis 3.2 Threat Model 3.3 DecodeNet System Overview 3.4 Pseudo-sample Generator Training Phase 3.5 DecodeNet Training Phase 4 Experiments 4.1 Experiment Setup 4.2 Experiments on Different Datasets 4.3 Ablation Experiments 4.4 Impact of Differential Privacy 5 Conclusion References Neural Network Backdoor Attacks Fully Controlled by Composite Natural Utterance Fragments 1 Introduction 2 Background 2.1 Existing Backdoor Attack on NLP 2.2 Limitations of Existing Attacks 3 Multi-trigger Backdoor Attacks 3.1 Threat Model 3.2 EBA: Enhanced Backdoor Attack 3.3 TFCBA: Trigger Frequency Controlled Backdoor Attack 4 Attack Evaluation 4.1 Evaluation Setup 4.2 Evaluation Results 5 Conclusion References Black-Box Fairness Testing with Shadow Models 1 Introduction 2 Background 3 Methodology 3.1 Initial Shadow Model Building 3.2 Discriminative Samples Generation 3.3 Density-Diversity-Driven Multi-subspaces Strategy 4 Experiments 4.1 Dataset and Experimental Settings 4.2 Effectiveness and Efficiency 4.3 Threats from Structures of Shadow Models 4.4 Time Performance 5 Related Work 6 Discussion and Future Work 7 Conclusion References Graph Unlearning Using Knowledge Distillation 1 Introduction 2 Related Work 2.1 Knowledge Distillation 2.2 Machine Unlearning 3 GUKD Unlearning Method 3.1 Notations and Problem Formulation 3.2 Motivation 3.3 Graph Unlearning Using Knowledge Distillation 4 Experiments 4.1 Experimental Setup 4.2 Single-Class Unlearning Experiment Results and Analysis 4.3 Multi-class Unlearning Experiment Results and Analysis 4.4 Comparison of Different Unlearning Frameworks Using Knowledge Distillation 5 Conclusion A Appendix References AFLOW: Developing Adversarial Examples Under Extremely Noise-Limited Settings 1 Introduction 2 Related Work 2.1 Adversarial Attack 2.2 Imperceptible Adversarial Attacks 3 Methodology 3.1 Overview 3.2 Problem Statement 3.3 Normalizing Flow 3.4 Generation of Adversarial Examples 3.5 Objective Functions 4 Experiments 4.1 Settings 4.2 Quantitative Comparison with the Existing Methods 4.3 Attack on Defense Models 4.4 Detectability 4.5 Evaluation of Image Similarity 5 Conclusions References Learning to Detect Deepfakes via Adaptive Attention and Constrained Difference 1 Introduction 2 Related Work 2.1 Face Forgery Techniques 2.2 Face Manipulation Forensics Methods 3 Proposed 3.1 Skipped Channel Attention Module 3.2 Constrained Difference Module 3.3 Adaptive Attention Module 3.4 Loss Function 4 Experiment 4.1 Experimental Settings 4.2 Intratesting 4.3 Crosstesting 4.4 Ablation Study 4.5 Visualization 5 Conclusion References A Novel Deep Ensemble Framework for Online Signature Verification Using Temporal and Spatial Representation 1 Introduction 2 Related Work 3 Deep Ensemble Framework for Online Signature Verification 3.1 Data Preprocessing 3.2 CGRN for Local Representation Learning 3.3 Global Feature Extraction with CNN 3.4 Cosine Similarity-Based Ensemble Verifier 4 Experiments 4.1 Dataset and Protocol 4.2 Implementation Details 4.3 Experimental Results on DeepSignDB 4.4 Ablation Study 4.5 Comparisons with Existing Methods 5 Conclusion and Future Work References Blockchain and Cryptocurrencies SCOPE: A Cross-Chain Supervision Scheme for Consortium Blockchains 1 Introduction 2 Related Work 2.1 Cross-Chain Oracles 2.2 Publish-Subscribe Schemes Using Blockchain 3 Design of SCOPE 3.1 Architecture of SCOPE 3.2 Cross-Chain Process 4 Cross-Chain Security Design 4.1 Oracle Working Group Election Method 4.2 Reputation Evaluation Method for Oracle Node 4.3 Verification Method for Off-Chain Data Authenticity 5 Experimental Evaluation 5.1 Experimental Environment 5.2 Results Analysis 6 Conclusion and Future Work References Subsidy Bridge: Rewarding Cross-Blockchain Relayers with Subsidy 1 Introduction 2 Preliminaries 2.1 Blockchain Model 2.2 Light Client Protocol 2.3 The Prover and Verifier Model 3 Subsidy Bridge Framework 3.1 Design Goal 3.2 Basic Relay Design 4 Incentive Design of Subsidy Bridge 4.1 Token Model 4.2 Extra Design Under Subsidy 5 Evaluation 5.1 Security Analysis 5.2 Incentive Analysis 5.3 Compare with Other Work 5.4 Discussion Towards Costs 6 Related Work 7 Conclusion References Towards Efficient and Privacy-Preserving Anomaly Detection of Blockchain-Based Cryptocurrency Transactions 1 Introduction 2 Related Works 3 Preliminary 3.1 Paillier Cryptosystem 3.2 Decision Tree 4 Problem Formulation 4.1 System Model 4.2 Threat Model 4.3 Design Goals 5 Design and Implementation 5.1 Initialization 5.2 Key Generation 5.3 Model Outsourcing 5.4 Anomaly Detection 6 Security Analysis 7 Experiments and Evaluation 7.1 Effectiveness and Efficiency Experiments 7.2 Complexity Analysis 8 Conclusion A Appendix References Blockchain Based Publicly Auditable Multi-party Computation with Cheater Detection 1 Introduction 2 Related Works 3 Preliminaries 3.1 Secret Sharing Based MPC 3.2 ElGamal Encryption 3.3 Pedersen Commitment 3.4 Non-interactive Zero-Knowledge Proofs 4 Blockchain based Multi-party Computation Scheme 4.1 Initialization 4.2 Input 4.3 Computation and Verification 4.4 End of the Protocol 5 One 3PC Instantiation of Our Scheme 6 Comparison and Analysis 6.1 Schemes Comparison 6.2 Privacy Preserving 6.3 Correctness 6.4 Public Auditability 6.5 Fairness with Penalties 7 Experiments Analysis 8 Conclusion References Towards Quantifying Cross-Domain Maximal Extractable Value for Blockchain Decentralisation 1 Introduction 2 Background 2.1 Types of MEV 2.2 MEV-Geth 2.3 MEV-Inspect 2.4 Cross Domain MEV 3 Data Collection and Extraction 3.1 Scope Definition 3.2 Getting Data 3.3 Smart Contract Addresses 3.4 Uniswap Fee Tiers 3.5 Swap Logs 3.6 Blocks 3.7 Connector 4 Implementation 4.1 Python and Django 4.2 Models 4.3 The Connector 4.4 Populating Tables 5 Analysis and Results 5.1 Data Overview 5.2 First Analysis 5.3 Second Analysis 6 Conclusion References BDTS: Blockchain-Based Data Trading System 1 Introduction 2 Related Work 3 Architecture and Security Model 4 The BDTS Scheme 5 Security Analysis 6 Implementation and Evaluation 7 Conclusion References Illegal Accounts Detection on Ethereum Using Heterogeneous Graph Transformer Networks 1 Introduction 2 Background 3 Heterogeneous Information Network for Accounts 3.1 Preliminaries 3.2 Feature Analysis 3.3 HIN Construction 4 AHGTN Detection Model 4.1 Data 4.2 Classification Model 5 Experiments and Results 5.1 Experimental Settings 5.2 Classification and Data Visualization 5.3 Comparison 6 Related Work 7 Conclusion References System and Network security DRoT: A Decentralised Root of Trust for Trusted Networks 1 Introduction 2 Related Work 3 The Concept of DRoTS 3.1 DRoT Components 3.2 DRoT Algorithms 3.3 DRoT Protocols 4 Security Model for DRoTS 4.1 Correctness 4.2 Unforgeability 5 A Concrete Construction of a DRoT 6 Security Analysis 7 Implementation 8 Conclusions A Implementation Overview References Finding Missing Security Operation Bugs via Program Slicing and Differential Check 1 Introduction 2 Background and Related Work 2.1 Missing Security Operation Bug 2.2 Program Slicing 2.3 Related Work 3 SSD: Program Slice-Based Missing Security Operation Detector 3.1 Motivating Example 3.2 System Overview 3.3 Security Operation Identification 3.4 Security Operation Peer Slice Construction 3.5 Missing Security Operation Bug Detection 4 Implementation 4.1 Preparing LLVM IR for SSD 4.2 Identifying Indirect Call 5 Evaluation 5.1 Slices Construction 5.2 Bug Finding 5.3 Comparison with Other Differential Analysis Tools 6 Conclusion A Appendix References TimeClave: Oblivious In-Enclave Time Series Processing System 1 Introduction 2 Background 2.1 Intel SGX 2.2 ORAM 2.3 Oblivious Primitives 3 System Overview 3.1 Threat Model 4 RoORAM 4.1 Structure and Components 4.2 Initialisation 4.3 Read Operation 4.4 Write Operation 4.5 Batch Eviction and Trees Synchronisation 4.6 RoORAM Efficiency Analysis 4.7 Security of RoORAM 5 TimeClave 5.1 Block Generation 5.2 Query Realisation 6 Evaluation 6.1 Evaluation Results 7 Related Work 7.1 Secure Time Series Processing 7.2 ORAM with Intel SGX 8 Conclusion References Efficient and Appropriate Key Generation Scheme in Different IoT Scenarios 1 Introduction 2 System and Observation 2.1 System and Secure Model 2.2 Analysis of RSS Values in Different Scenarios 3 Efficient and Appropriate Key Generation Scheme 3.1 Basic Idea of EAKGS 3.2 Overview of SKGP: Static Key Generation Process 3.3 Overview of DKGP: Dynamic Key Generation Process 4 Performance Evaluation and Analysis 5 Conclusion References A Fake News Detection Method Based on a Multimodal Cooperative Attention Network 1 Introduction 2 Related Work 3 Fake News Detection Method 3.1 Overall Framework 3.2 Multimodal Feature Extraction 3.3 Multimodal Cooperative Attention Network 3.4 Fake News Detector 4 Experimental Results and Analysis 4.1 Experimental Setup 4.2 Comparative Experiments and Analysis 4.3 Ablation Experiment and Analysis 4.4 Parameter Analysis 5 Conclusion References Author Index
دانلود کتاب Information and Communications Security: 25th International Conference, ICICS 2023, Tianjin, China, November 18–20, 2023, Proceedings (Lecture Notes in Computer Science)