Vai al contenuto principale della pagina

Advances in information and computer security : 16th International Workshop on Security, IWSEC 2021, virtual event, September 8-10, 2021, proceedings / / Toru Nakanishi, Ryo Nojima, (editors)



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Advances in information and computer security : 16th International Workshop on Security, IWSEC 2021, virtual event, September 8-10, 2021, proceedings / / Toru Nakanishi, Ryo Nojima, (editors) Visualizza cluster
Pubblicazione: Cham, Switzerland : , : Springer, , [2021]
©2021
Descrizione fisica: 1 online resource (250 pages)
Disciplina: 005.8
Soggetto topico: Computer security
Persona (resp. second.): NakanishiTōru
NojimaRyo
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: Intro -- Preface -- IWSEC 2021 16th International Workshop on Security Organization -- Contents -- Lattice-Based Cryptography -- A Trace Map Attack Against Special Ring-LWE Samples -- 1 Introduction -- 2 Preliminaries from Lattices to LWE Problems -- 2.1 Mathematical and Algorithmic Background on Lattices -- 2.2 LWE and Ring-LWE Problems -- 3 A Trace Map Attack Against the Ring-LWE Problem -- 3.1 Special Pairs of Ring-LWE Samples -- 3.2 A Trace Map Attack Against Special Pairs of Ring-LWE Samples -- 3.3 Comparison with the Standard Attack -- 4 (In)feasibility of Trace Map Attack for Random Samples -- 5 Conclusion -- References -- Shortest Vectors in Lattices of Bai-Galbraith's Embedding Attack on the LWR Problem -- 1 Introduction -- 1.1 Contribution -- 1.2 Organization -- 2 Preliminaries -- 2.1 Notation -- 2.2 Lattices -- 2.3 Search-LWE and Search-LWR Problems -- 2.4 Transformation of LWR to LWE -- 3 Embedding Attacks Against LWE -- 3.1 Kannan's Embedding Attack -- 3.2 Bai-Galbraith's Embedding Attack -- 4 Our Analysis of Shortest Vectors in BG-Lattices -- 5 Second Shortest Vectors in BG-lattices -- 5.1 Probability Distribution of "026B30D ec"026B30D 2 -- 5.2 Lower Bound of Probability -- 5.3 Experimental Results -- 6 Conclusion -- References -- System Security -- KPRM: Kernel Page Restriction Mechanism to Prevent Kernel Memory Corruption -- 1 Introduction -- 2 Background -- 2.1 Address Space and Page Table -- 2.2 Kernel Memory Corruption Vulnerability -- 3 Threat Model -- 4 Design and Implementation -- 4.1 Design Requirements of the KPRM -- 4.2 Design Overview -- 4.3 Kernel Page Types -- 4.4 Restricted Kernel Page Object -- 4.5 Timing of Restricted Kernel Page Management -- 4.6 Attack Situations -- 4.7 Implementation -- 4.8 Case Study -- 5 Evaluation -- 5.1 Purpose and Environment.
5.2 Prevention of Vulnerable Kernel Code Access and Kernel Memory Corruption -- 5.3 Measurement of System Call Overhead -- 5.4 Measurement of Application Overhead -- 6 Discussion -- 6.1 Kernel Resilience -- 6.2 Performance Evaluation -- 6.3 Limitation -- 6.4 Portability -- 7 Related Work -- 7.1 Comparison with Related Work -- 8 Conclusion -- References -- (Short Paper) Evidence Collection and Preservation System with Virtual Machine Monitoring -- 1 Introduction -- 1.1 Background -- 1.2 Attack Model -- 1.3 Related Work -- 1.4 Our Contribution -- 2 Issues on Existing Evidence Collection Systems -- 3 Evidence Collection and Preservation System (ECoPS) -- 3.1 Requirements -- 3.2 Design Criteria for ECoPS -- 4 Evidence Collection Mechanism -- 4.1 Library File Path Names -- 4.2 Hash Values of Library Files -- 4.3 Consideration of Ways to Collect Other Information -- 5 Evaluation -- 6 Conclusion -- References -- Multiparty Computation -- Evolving Homomorphic Secret Sharing for Hierarchical Access Structures -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Our Approach -- 1.3 Related Works -- 1.4 Organization -- 2 Preliminaries -- 2.1 Secret Sharing -- 2.2 Homomorphic Secret Sharing -- 2.3 Evolving Secret Sharing -- 2.4 Cryptographic Primitives -- 3 Evolving Homomorphic Secret Sharing -- 4 Our Scheme 1: From Hierarchical Secret Sharing -- 4.1 Access Structure -- 4.2 Construction -- 4.3 Properties -- 5 Our Scheme 2: Multi-generation of Shamir's Scheme -- 5.1 Access Structure -- 5.2 Construction -- 5.3 Properties -- 5.4 Variant of the Scheme -- 6 Comparison to a Recent Scheme -- 7 Concluding Remarks -- References -- Machine Learning and Security -- Understanding Update of Machine-Learning-Based Malware Detection by Clustering Changes in Feature Attributions -- 1 Introduction -- 2 Background and Related Work -- 2.1 Evaluation Methods.
2.2 Feature Attribution Methods -- 2.3 SHAP -- 3 Proposed Method -- 3.1 Calculating Feature Attribution Changes -- 3.2 Clustering Based on Feature Attribution Changes -- 4 Experimental Setup -- 4.1 Dataset -- 4.2 Model Update -- 4.3 Features and Models -- 5 Experimental Results -- 5.1 Classification Performance of Updated Models -- 5.2 Quantitative Evaluation -- 5.3 Qualitative Evaluation -- 6 Discussion -- 7 Conclusion -- A Detailed Experimental Setup -- References -- Proposal of Jawi CAPTCHA Using Digraphia Feature of the Malay Language -- 1 Introduction -- 2 Jawi Script: An Overview -- 3 Related Work -- 3.1 Latin CAPTCHA Schemes -- 3.2 Arabic CAPTCHA Scheme -- 4 Proposed Scheme -- 4.1 Basic Concept -- 4.2 Answer Text Generation -- 4.3 Obstacle Patterns -- 5 Usability Evaluation -- 5.1 Experimental System and Data -- 5.2 Purpose and Conditions -- 5.3 Results -- 6 Security Evaluation -- 6.1 Purpose and Conditions -- 6.2 Results -- 7 Discussion -- 8 Conclusion -- References -- Post-Quantum Cryptography (1) -- Solving the Problem of Blockwise Isomorphism of Polynomials with Circulant Matrices -- 1 Introduction -- 2 Isomorphism of Polynomials -- 2.1 Isomorphism of Polynomials -- 2.2 Blockwise Isomorphism of Polynomials -- 2.3 Blockwise Isomorphism of Polynomials with Circulant Matrices -- 2.4 Encryption Scheme Based on BIP with Circulant Matrices -- 2.5 Previous Security Analyses and Parameter Selections -- 3 Solving the BIP Problem with Circulant Matrices -- 3.1 Conjugations of Circulant Matrices -- 3.2 Equivalent Keys -- 3.3 Solving the BIP Problem with Circulant Matrices -- 4 Conclusion -- A Toy Example -- References -- FFT Program Generation for Ring LWE-Based Cryptography -- 1 Introduction -- 2 Related Work -- 3 Background -- 3.1 FFT in the RLWE Context -- 3.2 Tagless-Final Style -- 4 The Proposed Approach.
4.1 Abstract Definition of the FFT Innermost Loop -- 4.2 Vectorizing Modular Reductions -- 4.3 Subtraction -- 4.4 Vectorizing the Innermost Loop -- 4.5 Lazy Reduction -- 4.6 SIMD Backend Implementation -- 5 Experiments -- 6 Conclusion -- Appendix A Vectorize Module -- Appendix B Lazy Reduction Implementation -- Appendix C Details on SIMD Backend Implementation -- References -- Symmetric-Key Cryptography -- Optimum Attack on 3-Round Feistel-2 Structure -- 1 Introduction -- 1.1 Feistel Structure -- 1.2 Feistel-2 Structure -- 1.3 Our Contribution -- 1.4 Related Works -- 2 Preliminaries -- 2.1 3-Round Feistel-2 Structure -- 2.2 Meet in the Middle Attack ch10IS12 -- 3 Data-Time Tradeoff Attack on 3-Round Feistel-2 Structure -- 3.1 Attack Outline -- 3.2 Offline Phase -- 3.3 How to Recover k1 F0(k0) -- 3.4 How to Recover k2 and F0(k0) -- 3.5 How to Recover k0 -- 3.6 Complexity -- 4 Memoryless Attack for D=3 and T=O(2n/2) -- 4.1 Attack Outline -- 4.2 Details -- 5 Memoryless Attack For D=O(2n/4) and T=O(2n/4) -- 5.1 Our Idea -- 5.2 Memoryless Attack to Recover k0 -- 5.3 Memoryless Attack to Recover k1 -- 5.4 Memoryless Attack to Recover k2 -- References -- Post-Quantum Cryptography (2) -- An Intermediate Secret-Guessing Attack on Hash-Based Signatures -- 1 Introduction -- 2 Preliminaries -- 2.1 Description of XMSSMT -- 2.2 Description of K2SN-MSS -- 3 ISG Attack on XMSSMT -- 3.1 Verifying a WOTS+ Seed Guess for XMSSMT -- 3.2 Using a WOTS+ Seed to Forge a Signature -- 3.3 ISG Attack on XMSSMT -- 3.4 Analysis of ISG Attack on XMSSMT -- 4 ISG Attack on K2SN-MSS -- 4.1 Verifying a KSN-OTS Seed Guess for K2SN-MSS -- 4.2 Using a KSN-OTS Seed to Forge a Signature -- 4.3 ISG Attack on K2SN-MSS and Its Analysis -- 5 Implementation and Experiments -- 6 Mitigations Against the ISG Attack -- 7 Concluding Remarks -- A Description of WOTS+.
B Deferred Details of the ISG Attack on XMSSMT -- References -- (Short Paper) Analysis of a Strong Fault Attack on Static/Ephemeral CSIDH -- 1 Introduction -- 2 Preliminaries -- 2.1 General Structure of the Attack -- 3 Attack Analysis -- 3.1 ``Real-then-Dummy'' Decision Vector -- 3.2 Dynamic Uniformly Random Decision Vector -- 3.3 Determining the Signs of the Key -- 4 Simulation Results -- 5 Conclusions -- References -- (Short Paper) Simple Matrix Signature Scheme -- 1 Introduction -- 2 Trapdoor Designs for Multivariate Public Key Cryptosystems -- 2.1 Constructions of MPKC -- 2.2 UOV and Rainbow -- 2.3 Simple Matrix Encryption -- 3 Proposed Simple Matrix Signature Scheme -- 4 Security Analysis -- 4.1 Algebraic Attack -- 4.2 MinRank Attack -- 4.3 Other Attacks -- 5 Parameters -- 6 Conclusion -- References -- Game Theory and Security -- Moving Target Defense for the CloudControl Game -- 1 Introduction -- 2 Our Model -- 2.1 The Signaling Game in the Proposed Game Model -- 2.2 The FlipIt Game in the Proposed Game Model -- 3 Numerical Experiments -- 4 Conclusion and Future Work -- References -- Author Index.
Titolo autorizzato: Advances in Information and Computer Security  Visualizza cluster
ISBN: 3-030-85987-8
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996464502903316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Lecture notes in computer science ; ; 12835.