Codes, Cryptology and Information Security

Name: Codes, Cryptology and Information Security | Second International Conference, C2SI 2017, Rabat, Morocco, April 10-12, 2017, Proceedings - In Honor of Claude Carlet
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

Second International Conference, C2SI 2017, Rabat, Morocco, April 10-12, 2017, Proceedings - In Honor of Claude Carlet

Said El Hajji Abderrahmane Nitaj El Mamoun Souidi(Herausgeber*in)

Springer (Verlag)

Erschienen am 7. März 2017

XII, 384 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-55589-8 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Contents
Invited Papers
Some Results on the Known Classes of Quadratic APN Functions
1 Introduction
2 Walsh Spectra of F1 and F2
3 Walsh Spectrum of F0
4 Equivalence of Göloglu's APN Trinomial to Gold Functions
References
Families of Convolutional Codes over Finite Fields: A Survey
1 Introduction
2 Convolutional Codes over Finite Fields
3 Convolutional Codes and Linear Systems
3.1 Realization
3.2 Control Properties of Convolutional Codes
4 Families of Convolutional Codes over Finite Fields
References
Codes for Side-Channel Attacks and Protections
1 Introduction
2 Side-Channel Analysis as a Decoding Problem
2.1 Setup
2.2 Example of AWGN Channel
2.3 Absence of Countermeasures
2.4 Multivariate and Multimodel Setting
2.5 Collision
2.6 General Setting, with Countermeasures
2.7 Link Between Success Probability, SNR and Leakage Function
3 Side-Channel Protection
3.1 Strategies to Thwart Side-Channel Attacks
3.2 Masking Schemes
3.3 Security of Masking Schemes
3.4 Orthogonal Direct Sum Masking (ODSM), a Masking Scheme Based on Codes
3.5 Illustration for Some Coding-Based Masking Schemes
3.6 Masking and Faults Detection
4 Leakage Model, and Glitches
5 Conclusion
A SNR in the Presence of First Order Masking
References
An Overview of the State-of-the-Art of Cloud Computing Cyber-Security
1 Introduction
2 Cloud Computing
3 Cloud Computing Cyber-Security
4 Conclusions
References
Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges
1 Introduction
2 Existing (F/S)HE Solutions
2.1 SHE from Classical Crypto World
2.2 Lattice-Based (S/F)HE
3 Customization and Optimization of Both Program and Data
3.1 Program Management
3.2 Data Management
4 Flexibility of (S/F)HE Schemes in Terms of Multiplicative Depth Management
4.1 SHE from Classical Crypto World
4.2 Lattice-Based (S/F)HE Schemes
5 Security of (S/F)HE Schemes
5.1 SHE from Classical Crypto World
5.2 Lattice-Based (S/F)HE
6 Existing Implementations of (S/F)HE Schemes
6.1 Software Implementations
6.2 Hardware Implementations
7 How to Handle Such a Huge Complexity and Expansion?
8 Conclusion
References
Regular Papers
Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange
1 Introduction
2 Preliminaries
2.1 Deterministic Extractor
2.2 Character Sums in Finite Fields
2.3 Character Sums with Elliptic Curves
3 Randomness Extractors for E(Fp)
4 Randomness Extractor for E(Fpn), with p & 5
5 Application to Key Agreement
6 Conclusion
References
Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field Fq
1 Introduction
2 Coding Theory Background
2.1 Definitions and Notations
2.2 McEliece's Cryptosystem
2.3 Nearest-Neighbor Problem
3 Preview Work on Information-Set Decoding over Fq
4 Becker, Joux, May and Meurer ISD Using May-Ozerov Nearest-Neighbor Algorithm over Fq
5 Numerical Analysis of Time Complexity
6 Conclusion
References
Parameters of 2-Designs from Some BCH Codes
1 Introduction
2 The Classical Construction of t-Designs from Codes
2.1 Designs from Linear Codes via the Assmus-Mattson Theorem
2.2 Designs from Linear Codes via the Automorphism Group
3 The Parameters of Some 2-Designs from the Extended Codes of Some Narrow-Sense Primitive BCH Codes
3.1 General Results About 2-Designs from the Extended Codes of Some Narrow-Sense Primitive BCH Codes
3.2 Designs held in C(2, 2m-1, 2, 1) with 2=2m-1-1-2"4262304 (m-1)/2"5263305
3.3 Designs Held in C(q, Qm-1, 2, 1) for odd q
3.4 Designs Held in C(2, 2m-1, 3, 1) with 3=2m-1-1-2"4262304 (m+1)/2"5263305
3.5 Designs Held in C(2, 2m-1, 5, 1) and C(2, 2m-1, 5, 1) for even m 4
4 Concluding Remarks
References
A Median Nearest Neighbors LDA for Anomaly Network Detection
1 Introduction
2 Linear Discriminant Analysis
3 The Proposed Method
4 The Simulated Databases and Its Transformation
4.1 KDDcup99
4.2 NSL-KDD
4.3 Transformation Process
5 Experiments and Discussion
6 Conclusion
References
Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability
1 Introduction
1.1 Related Work
2 Notation and Preliminaries
2.1 Notation
2.2 Setup
2.3 LAEPuV
2.4 Hardness Assumptions
3 LAEPuV Scheme CMP14 by Catalano et al.
4 Shortcomings of CMP14
4.1 Restricted Function Evaluation
4.2 Infeasible Encryption in Some Datasets
5 Our Improved Scheme LEPCoV
5.1 High-Level Description of Our Changes
5.2 Description of the Scheme
5.3 Security
5.4 Correctness
6 Implementation
7 Conclusion
References
Constacyclic Codes over Finite Principal Ideal Rings
1 Introduction
2 Preliminaries
2.1 Finite Chain Rings
2.2 Finite Principal Ideal Rings
3 Constacyclic Codes over Finite Principal Ideal Rings
3.1 Constacyclic Codes over Finite Chain Rings
3.2 Constacyclic Codes over Finite Principal Ideal Rings
4 Self-dual Cyclic Codes over Finite Principal Ideal Rings
4.1 Cyclic Self-dual Codes over Finite Chain Rings
4.2 Self-dual Cyclic Codes over Finite Principal Ideal Rings
4.3 Cyclic Codes over Finite Principal Ideal Rings with Odd Index of Stability
5 Constacyclic Codes over R+vR
6 Conclusion
References
On Isodual Cyclic Codes over Finite Chain Rings
1 Introduction
2 Preliminaries
2.1 Isometries and Monomial Maps
2.2 Galois Extensions of Finite Chain Rings
3 Cyclic Codes of Length 2am over R
3.1 Free Cyclic Codes of Length 2am over R
4 The Existence of Cyclic Isodual Codes over Finite Chain Rings
5 Isodual Cyclic Codes over Finite Chain Rings from Duadic Codes
5.1 Lifts of Duadic Codes over Finite Chain Rings
5.2 Construction of Free Isodual Cyclic Codes over Finite Chain Rings Using Lifts of Duadic Codes
References
Revisiting the Efficient Key Generation of ZHFE
1 Introduction
2 The ZHFE Scheme and Its Key Generation Algorithms
2.1 Multivariate Public Key Cryptography
2.2 The ZHFE Encryption Scheme
2.3 Algorithms for the Private Key Generation of ZHFE Scheme
3 Our New Key Generation Algorithm for ZHFE
3.1 Baena et al.'s Algorithm
3.2 Main Idea
3.3 Our Proposed Algorithm
4 Complexity and Implementation Results
4.1 The Complexity of the Proposed Algorithm
4.2 Our Experiments
4.3 Comparison of Timings
5 Conclusion
A Our Algorithm in Sect.3.3
References
The Weight Distribution for an Extended Family of Reducible Cyclic Codes
1 Introduction
2 Definitions, Notation and Main Assumption
3 Some Preliminary Results
4 The Value Distribution of a Class of Exponential Sums
5 A Formal Proof of Theorem 1
6 Determining the Weight Distribution of Any (3,2,3)-Polygon Cyclic Code
7 An Extended Family of Cross-Correlation Functions
8 Conclusion
References
A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography
1 Introduction
2 Coding Theory Background
3 Equivalence Subcode(ES) Is NP-Complete
4 Application of ES to the Code Based Cryptography
4.1 The Girault Identification Scheme
4.2 Version of the Girault Identification Scheme Using ES
4.3 Performance of the Scheme
5 Conclusion
References
Spectral Approach for Correlation Power Analysis
1 Introduction
2 Preliminaries on Spectral Analysis
3 Modelling the Attack
3.1 Physical Principles
3.2 Target of the Attack
3.3 Assessing the Estimation Reliability
4 Multidimensional Attack
5 Experimental Results
6 Conclusion
References
Efficient Implementation of Hybrid Encryption from Coding Theory
1 Introduction
2 Preliminaries
2.1 Niederreiter PKCS
3 Hybrid Encryption
3.1 Key Encapsulation Mechanism (KEM)
3.2 Data Encapsulation Mechanism (DEM)
3.3 Key Derivation Function
4 Hybrid Scheme from Coding Theory
5 Implementation
5.1 Description
5.2 Overview of Functions
6 Security and Performance
6.1 KEM-DEM Security
6.2 Performance and Comparison
7 Conclusion
References
On the Multi-output Filtering Model and Its Applications
1 Introduction
2 Preliminaries
2.1 Basic Definitions on Sequences and Boolean Functions
3 Multi-output Filtering Model
3.1 Description of the Multi-output Filtering Model
3.2 Application to TUAK's f1, AES , KASUMI and PRESENT
4 Distinguishing Attack Model
5 Distinguishing Attack Based on Linear Complexity
5.1 A Generic Framework to Build a Distinguisher
5.2 Distribution of the Linear Complexity of Component Sequences
5.3 The New Distinguishing Attack
5.4 An Example of the Distinguishing Attack
6 Distribution of the Linear Complexity of PRINTcipher Under the Multi-output Filtering Model
6.1 Directly Applying Multi-output Filtering Model to PRINTcipher
6.2 Applying Multi-output Filtering Model to PRINTcipher with Recurrent Input
7 Distribution of the Algebraic Degree and Nonlinearity of the Component Functions
7.1 Algebraic Degree Distribution
7.2 Nonlinearity Distribution
8 Conclusions
A Appendix
References
New Bent Functions from Permutations and Linear Translators
1 Introduction
1.1 Preliminaries
1.2 Previous Results and the Aim of the Paper
1.3 The Organization of the Paper
2 Several New Constructions for Bent Functions
3 Our New Families Are Not in the Maiorana-McFarland Class
3.1 Families Obtained by the Construction Defined in Theorem1
3.2 Families Obtained by the Construction Defined in Theorem2
3.3 Families Obtained by the Construction Defined in Theorem3
3.4 Families Obtained by the Construction Defined in Theorem4
4 Conclusion
References
Bent Functions in C and D Outside the Completed Maiorana-McFarland Class
1 Introduction
2 Preliminaries
2.1 Bent Functions in C and D
3 Sufficient Conditions for Functions in C and D to Be Outside M#
4 Some Examples of Bent Functions in C Outside M#
5 Bent Functions in D Outside M*
6 Conclusions
References
Quantum Algorithms Related to HN-Transforms of Boolean Functions
1 Introduction
2 Preliminaries
2.1 HN-Transforms as a Generalization of Hadamard Transform
3 The Complexity of Computing HN-Spectra
3.1 Fast HN-Transform Algorithm
3.2 HN-Transform and Quadratic Symmetric Functions on a Subspace Depending on c
4 Extended Deutsch-Jozsa Algorithm
5 Conclusion
References
Explicit Characterizations for Plateaued-ness of p-ary (Vectorial) Functions
1 Introduction
2 Preliminaries
3 Characterizations by the Autocorrelation Functions
4 Characterizations in Terms of the Derivatives
5 Characterizations by Using Power Moments of the Walsh Transform
6 Conclusion
References
A New Dynamic Code-Based Group Signature Scheme
1 Introduction
2 Preliminaries
2.1 Notation
2.2 Code-Based Cryptography
2.3 AGS Zero-Knowledge Identification Protocol
3 Group Signature
4 The Proposed Dynamic Group Signature
4.1 Setup Algorithm
4.2 AGS Variant Protocol with Collision
4.3 High Level Overview
4.4 Join Scheme
4.5 Signature Algorithm
4.6 Verification Algorithm
4.7 Open Algorithm
5 Security Analysis and Practical Results
5.1 Security Analysis
5.2 Practical Results
6 Conclusion
References
A Secure Cloud-Based IDPS Using Cryptographic Traces and Revocation Protocol
1 Introduction
2 Security Issues
3 Proposed IDPS for Cloud Security
3.1 Cryptographic Traces for Intrusion Detection
3.2 Revocation-Based Trust Threshold for Intrusion Prevention
4 Performance Analysis
4.1 Response Time
4.2 Network Load
4.3 Security Performance
5 Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken