Intro
Preface
Organization
Contents
Efficient Construction of Public-Key Matrices in Lattice-Based Cryptography: Chaos Strikes Again
1 Introduction
2 Preliminaries
2.1 The Chaotic System: Logistic Map
2.2 LWE and the Encryption Scheme
3 The Proposed Public-Key Construction
3.1 Generating Uniform Chaotic Sequences
3.2 Public Key Matrices Constructed from Chaotic Sequences
3.3 The Public-Key Encryption Scheme Based on LWE and Chaos
4 Tests
4.1 Chi-Square Tests and K-S Tests
4.2 Gap Tests
4.3 Construction of Keys
5 Conclusion
References

Explore Capabilities and Effectiveness of Reverse Engineering Tools to Provide Memory Safety for Binary Programs
1 Introduction
2 Related Works
3 Benchmarks and Frameworks
3.1 Experimental Framework
3.2 Benchmarks
4 Static Reverse Engineering
4.1 Setup and Implementation Details
4.2 Efficacy of Reverse Engineering Tools
5 Run-Time Framework to Detect Memory Errors
5.1 Dynamic Tracking and Instrumentation Using Pin
5.2 Buffer Overflow Detection Accuracy
5.3 Performance Overhead
6 Conclusions and Future Work
A Optimized Benchmarks

B Detection Accuracy Using Ghidra
C Program Execution Time Overhead by the Pin-Based Run-Time Technique
References
Enhanced Mixup Training: a Defense Method Against Membership Inference Attack
1 Introduction
1.1 A Subsection Sample
2 Preliminary
2.1 Membership Inference Attack
2.2 Recent Defense Against Membership Inference Attack
2.3 Definition of Mixup
3 Enhanced Mixup Training Against Membership Inference Attack
3.1 Enhanced Mixup Training
3.2 Regularization Proof of EMI
4 Experiment Results
4.1 Dataset
4.2 Experimental Setup

4.3 Experimental Results
5 Conclusion and Future Work
References
Isogeny Computation on Twisted Jacobi Intersections
1 Introduction
2 Preliminaries
3 Isogenies on Twisted Jacobi Intersections
3.1 2-Isogeny
3.2 Odd Degree Isogenies
4 -Coordinate on Twisted Jacobi Intersections
4.1 -Coordinate System for Differential Addition
4.2 -Coordinate for Isogenies
4.3 Computational Cost
5 Conclusion
References
EPFSTO-ARIMA: Electric Power Forced Stochastic Optimization Predicting Based on ARIMA
1 Introduction
2 Related Work

2.1 Data Poisoning and Adversarial Examples
2.2 ARIMA
2.3 Dropout
2.4 Data Poisoning Attack Defense
3 Our Approach
3.1 Similarity Calculation
3.2 Data Stochastic Sampling and Data Optimization
3.3 EPFSTO-ARIMA
4 Experiments and Results
4.1 Experimental Data and Parameter Description
4.2 Adopted Metrics
4.3 Experiments Results
5 Conclusions and Future Work
References
Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix
1 Introduction
2 Preliminaries
2.1 Notation
2.2 The Boolean Function