Codes, Cryptology and Information Security Third International Conference, C2SI 2019, Rabat, Morocco, April 22-24, 2019, Proceedings - In Honor of Said El Hajji

This book constitutes the proceedings of the Third International Conference on Codes, Cryptology and Information Security, C2SI 2019, held in Rabat, Morocco, in April 2019. The 19 regular papers presented together with 5 invited talks were carefully reviewed and selected from 90 submissions. The fir...

Full description

Saved in:
Bibliographic Details
Main Authors Carlet, Claude, Guilley, Sylvain, Nitaj, Abderrahmane, Souidi, El Mamoun
Format eBook Conference Proceeding Book
LanguageEnglish
Published Cham Springer Nature 2019
Springer International Publishing AG
Springer International Publishing
Edition1
SeriesLecture Notes in Computer Science
Subjects
Coding and Information Theory
Computer programming, programs, data
Computer Science
Cryptography and Security
Cryptology
Internet-Security measures
Software Engineering
Systems and Data Security
Online AccessGet full text
ISBN9783030164584
3030164586
9783030164577
3030164578
ISSN0302-9743
1611-3349
DOI10.1007/978-3-030-16458-4

Cover

Table of Contents:
  • Intro -- Preface -- Organization -- Biography of Said El Hajji -- Invited Papers and Talks -- Privacy Preserving Auctions on Top of Ethereum (Abstract for Invited Talk) -- Contents -- Side-Channel Analysis -- Virtual Security Evaluation -- 1 Introduction -- 2 The Presented Methodology -- 3 Conclusion and Perspectives -- References -- Cache-Timing Attacks Still Threaten IoT Devices -- 1 Introduction -- 2 Previous Works -- 2.1 Timing Attacks and Cache-Timing Attacks -- 2.2 Existing Tools -- 3 Our Methodology -- 3.1 Leakage Types -- 3.2 Principle of the Tool -- 3.3 False Positives -- 4 Evaluating MbedTLS Source Code -- 4.1 Analysis of the RSA Implementation -- 4.2 Analysis of ECDSA Implementation -- 4.3 Analysis of AES Implementation -- 4.4 Analysis of DES Implementation -- 4.5 Analysis of Blowfish Implementation -- 4.6 Analysis of Camellia Implementation -- 5 Discussion -- 6 Conclusion and Perspectives -- A Appendix -- References -- Speed-up of SCA Attacks on 32-bit Multiplications -- 1 Introduction -- 2 Complexity of Attacking 32-bit Multiplication -- 3 Split the Attack -- 4 Attack Steps -- 4.1 Step 1 - Retrieve K0 -- 4.2 Step 2 - Retrieve K1 -- 4.3 Step 3 - Retrieve K2 -- 4.4 Step 4 - Retrieve K3 -- 4.5 Conclusion -- 5 Benchmark -- 5.1 SCA Attack on 8-bit Multiplication -- 5.2 Performance on Software Implementation -- 6 Conclusion -- 7 Glossary -- References -- Cryptography -- Arabic Cryptography and Steganography in Morocco -- 1 Introduction -- 2 Arab Numerical Coding in Morocco and ``Hissab Al-Jommal'' -- 3 The Moroccan Cryptographic and Steganography Methods -- 4 Encryption Using a Poetry -- 5 Conclusions -- References -- An AEAD Variant of the Grain Stream Cipher -- 1 Introduction -- 2 Design Details -- 2.1 Building Blocks and Functions -- 2.2 Key and IV Initialization -- 2.3 Operating Mode -- 3 Design Rationale
  • 1 Introduction -- 2 Background on Rank Metric and Gabidulin Codes -- 2.1 Rank Metric -- 2.2 Gabidulin Codes -- 2.3 General Decoding of Rank Metric Codes -- 3 A New Code: l-Gabidulin Codes -- 3.1 l-Gabidulin Codes Construction -- 3.2 l-Gabidulin Codes Construction -- 4 New Public-Key Encryption on l-Gabidulin Codes -- 4.1 Description of the Encryption Scheme -- 4.2 A Toy Example of l in LG Encryption -- 5 Security Against Structural Attacks -- 5.1 Overbeck's Attack -- 5.2 Annulator Polynomial Attack -- 5.3 Frobenius Weak Attack -- 6 Proposed Parameters -- 7 Conclusion -- References -- Perfect, Hamming and Simplex Linear Error-Block Codes with Minimum -distance 3 -- 1 Introduction -- 2 Perfect LEB Codes of Type = [n1 ]…[nt ][2]s, t1 with d=3 -- 2.1 Construction of Perfect LEB Codes of Type =[n1][2]s (n12) with d=3 -- 2.2 Binary Perfect LEB Codes of Type =[n1][n2][2]s with d =3 -- 2.3 Binary Perfect LEB Codes of Type =[n1]…[nt][2]s (t2) and d=3 -- 3 Perfect LEB Codes of Type = [n1][nt ][3]s, t=1 or t=2 with d=3 -- 3.1 Perfect LEB Codes of Type =[n1][3]s (n13) and d=3 -- 3.2 Perfect LEB Codes of Type =[n1][n2][3]s with d=3 -- 4 Hamming LEB Codes -- 5 Simplex LEB Codes -- 6 Conclusion and Perspectives -- References -- Quasi-Dyadic Girault Identification Scheme -- 1 Introduction -- 2 Background -- 2.1 Notation -- 2.2 Coding Theory -- 2.3 NP-Complete Problem -- 3 Quasi-Dyadic Equivalence Subcode (QD-ES) -- 3.1 Statement of Problems -- 3.2 Some Remarks About These Problems -- 4 The Girault Identification Protocol -- 4.1 Overview of Code-Based Identification Protocols -- 4.2 Description of Girault Identification Protocol -- 5 Version Improved of the Girault Identification Scheme Using Quasi-Dyadic Subcode -- 5.1 Key Generation Algorithm -- 5.2 Improved Identification Scheme -- 6 Security -- 6.1 Completeness -- 6.2 Soundness -- 6.3 Zero-Knowledge
  • 3.1 A Short History of the Grain Family of Stream Ciphers -- 3.2 Differences Between Grain-128AEAD and Grain-128a -- 4 Security Analysis -- 4.1 General Security Analysis -- 4.2 Correlation Attacks -- 4.3 Chosen IV Attacks -- 4.4 Fault Attacks -- 5 Implementation -- 6 Conclusions -- A Test Vectors -- References -- Construction for a Nominative Signature Scheme from Lattice with Enhanced Security -- 1 Introduction -- 2 Preliminaries -- 2.1 Computational and Decisional Problems -- 2.2 Zero Knowledge Argument System libert2016signature -- 3 Our Nominative Signature Scheme -- 4 Security -- 4.1 Oracles for Adversaries -- 4.2 Security Model for Unforgeability Against Malicious Nominee -- 4.3 Security Model Under Unforgeability Against Malicious Nominator -- 5 Security Model Against Invisibility -- 5.1 Security Model for Non-repudiation -- References -- Reinterpreting and Improving the Cryptanalysis of the Flash Player PRNG -- 1 Introduction -- 2 Preliminaries -- 2.1 Constant Blinding in Flash Player -- 2.2 Shifting Signed Integers -- 2.3 Previous Cryptanalysis Results -- 3 Reinterpreting -- 4 Improving -- 5 Experimental Results -- 6 Conclusions -- A Additional Algorithms -- References -- A Key Exchange Based on the Short Integer Solution Problem and the Learning with Errors Problem -- 1 Introduction -- 1.1 Background -- 1.2 Key Exchange Based on SIS Problem -- 1.3 Key Exchange Based on LWE Problem -- 1.4 Our Contributions -- 2 Attack to Wang's Protocol -- 2.1 Preliminary -- 2.2 Notation -- 2.3 Description of the Protocol -- 2.4 Mao's Attack ref7 -- 2.5 Our Attack -- 2.6 Experimental Results -- 2.7 Toy Example -- 3 Key Exchange on SIS and LWE -- 3.1 Preliminary -- 3.2 Desciption of the Protocol -- 3.3 Remove the Approximation -- 3.4 Correctness -- 3.5 Security -- References -- Non-interactive Zero Knowledge Proofs in the Random Oracle Model
  • 1 Introduction -- 1.1 Problem Statement -- 1.2 The FS Transform Internals -- 1.3 The Soundness Degradation of the FS Transform -- 2 Our Results -- 3 Overview of Our Transform -- 4 Comparison -- 5 Applications -- 6 Related Work -- 7 Our Transform -- 7.1 Step I: From spec-prot to 3-Round Public-Coin HVZK in the ROM -- 7.2 Step II: Composing with the FS Transform -- References -- From Quadratic Functions to Polynomials: Generic Functional Encryption from Standard Assumptions -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Overview of Our Techniques -- 2 Preliminaries -- 2.1 Bilinear Map -- 2.2 Functional Encryption -- 3 A Generic Functional Encryption Scheme for Quadratic Functions -- 3.1 Our FE Scheme for Quadratic Functions over Zp -- 4 From Quadratic FE to Cubic FE over Zp -- 4.1 Cubic Functionality over Zp -- 4.2 Our FE Scheme for Cubic Functions over Zp -- 5 Generalization: From Degree-m Polynomial FE to Degree-(m+1) Polynomial FE -- 5.1 Our FE Scheme for Degree-(m+1) Polynomial over Zp -- 6 Conclusions and Discussion -- A Requirements of PKE -- B Proofs in Our FE Scheme for Quadratic Functions -- B.1 Proof of Theorem 1 -- C Proofs in Our FE Scheme for Cubic Functions -- C.1 Proof of Theorem 2 -- C.2 Proof of Theorem 3 -- References -- Secret Sharing -- Efficient Proactive Secret Sharing for Large Data via Concise Vector Commitments -- 1 Introduction -- 1.1 Organization -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Notation -- 2.2 Network Model -- 2.3 Discrete Logarithm Problem -- 2.4 Vector Commitments -- 2.5 Proactive Secret Sharing -- 3 Proactive Secret Sharing with Vector Commitments -- 3.1 Scheme Description -- 3.2 Scheme Analysis -- 4 Instantiation, Implementation, and Evaluation -- 4.1 Instantiation -- 4.2 Implementation -- 4.3 Evaluation -- 5 Conclusions -- A Proofs -- References -- Secret Sharing Using Near-MDS Codes
  • 7 Performance Analysis of the Scheme
  • 1 Introduction -- 1.1 Organization -- 2 Preliminaries -- 2.1 Coding Theory -- 2.2 Secret Sharing -- 3 Related Work -- 3.1 Share Construction -- 3.2 Secret Reconstruction -- 4 Attack on the Scheme in zhou2009secret -- 5 Proposed Secret Sharing Scheme -- 5.1 Motivation for the Scheme -- 5.2 Access Structure -- 5.3 Share Construction -- 5.4 Secret Reconstruction -- 6 Analysis of the Proposed Scheme -- 6.1 Cheating Detection and Cheating Identification -- A An Instantiation of the Proposed Scheme -- A.1 Secret Reconstruction -- References -- Mathematics for Cryptography -- On Plateaued Functions, Linear Structures and Permutation Polynomials -- 1 Introduction -- 2 Preliminaries -- 3 Cusick's Highly Nonlinear Plateaued Functions and Their Modifications -- 4 Constructing Permutation Polynomials over Fq2 via Fq -- 5 Constructing Permutation Polynomials over Fqn via Fq with n 3 -- 6 A Further Generalization of Linear Translators -- 7 Conclusion -- References -- Faster Scalar Multiplication on the x-Line: Three-Dimensional GLV Method with Three-Dimensional Differential Addition Chains -- 1 Introduction -- 2 Three and Four-Dimensional GLV Method -- 3 Projection to the x-Line -- 4 Three-Dimensional Differential Addition Chains -- 4.1 A Uniform Three-Dimensional Differential Addition Chain -- 4.2 A Faster Three-Dimensional Differential Addition Chain -- 5 Comparison -- 5.1 Theoretic Analysis -- 5.2 Implementation Results -- 6 Conclusion and Future Research -- A Four-dimensional Case -- References -- Codes and Their Applications -- On Good Polynomials over Finite Fields for Optimal Locally Recoverable Codes -- 1 Introduction -- 2 Preliminaries -- 3 Constructions of r-good Polynomials -- 3.1 Known Constructions of Good Polynomials -- 3.2 More Constructions of Good Polynomials -- References -- A New Gabidulin-Like Code and Its Application in Cryptography