Code-based cryptography : 9th International Workshop, CBCrypto 2021, Munich, Germany, June 21-22, revised selected papers / / edited by Antonia Wachter-Zeh, Hannes Bartz, Gianluigi Liva

• Pubblicazione: Cham, Switzerland : , : Springer, , [2022]; ©2022
• Descrizione fisica: 1 online resource (132 pages)
• Disciplina: 005.82
• Soggetto topico: Coding theory
• Persona (resp. second.): BartzHannes; LivaGianluigi; Wachter-ZehAntonia
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Intro -- Preface -- Organization -- Contents -- A Rank Metric Code-Based Group Signature Scheme -- 1 Introduction -- 2 Preliminaries -- 2.1 Notations -- 2.2 Background on Code-Based Cryptography -- 2.3 Group Signatures -- 2.4 Transform of Index -- 2.5 Permutations -- 3 The Underlying Interactive Protocol -- 3.1 The Interactive Scheme -- 3.2 Analysis -- 4 Our Code-Based Group Signature Scheme -- 4.1 Efficiency and Correctness -- 4.2 Anonymity -- 4.3 Traceability -- 5 Parameters -- 6 Conclusion -- References -- The Rank-Based Cryptography Library -- 1 Preliminaries -- 1.1 Rank Metric Overview -- 1.2 Rank Metric Codes -- 1.3 The ROLLO and RQC Schemes -- 2 The RBC Library -- 2.1 RBC Library Overview -- 2.2 RBC Library Architecture -- 2.3 RBC Library Algorithms -- 3 RBC Library Performances -- 3.1 Comparison with the NTL, mpFq and RELIC libraries -- 3.2 Performances of ROLLO and RQC on Intel Skylake-X -- 3.3 Performances of ROLLO and RQC on ARM Cortex-M4 -- References -- Security Analysis of a Cryptosystem Based on Subspace Subcodes -- 1 Introduction -- 2 Preliminaries -- 2.1 GRS Codes -- 2.2 Shortened Codes and Punctured Codes -- 2.3 Binary m-Block Codes -- 2.4 Subspace Subcodes -- 2.5 Generalized Subspace Subcodes -- 3 Scheme Description -- 3.1 Description of Generic Scheme -- 3.2 Description of the BGKR Scheme -- 4 New Security Model -- 5 Security Analysis of BGKR in the KSA Model -- 5.1 Exhaustive Search -- 5.2 Algebraic Cryptanalysis -- 5.3 Parameter Choice -- 6 Conclusion -- References -- Information-Set Decoding with Hints -- 1 Introduction -- 2 Preliminaries -- 3 Hint-Based Parameter Reduction in the SDP -- 3.1 Known Error Locations or Error-Free Locations -- 3.2 Measurement of the Error -- 3.3 Known Partial Message -- 3.4 Measurement of the Message -- 3.5 Restricted Error Values -- 3.6 Combining Different Types of Hints. ; 4 Hamming Weights of Error Blocks Known -- 4.1 Prange's ISD Algorithm with Known Block Weights -- 4.2 Lee-Brickell Algorithm with Known Block Weights -- 4.3 Stern's ISD Algorithm with Known Block Weights -- 4.4 Numerical Results and Comparison -- 5 Conclusion -- A A Framework for Birthday Decoding with Known Block Error Distribution -- References -- A Correction to a Code-Based Blind Signature Scheme -- 1 Introduction -- 2 Background on Code-Based Cryptography -- 2.1 Syndrome Decoding -- 2.2 Trapdoor Digital Signature -- 2.3 Stern's Authentication Protocol -- 3 Blind Signature -- 4 The Previous Scheme -- 5 A New Scheme -- 5.1 The Scheme -- 5.2 Unforgeability -- 5.3 Blindness -- 5.4 Parameters -- 6 Conclusion -- References -- Performance Bounds for QC-MDPC Codes Decoders -- 1 Introduction -- 2 Notation and Background -- 2.1 Error Correcting Codes -- 2.2 QC-MDPC Codes -- 3 Maximum-Likelihood Decoding -- 3.1 ML Decoders for QC-MDPC Codes -- 4 Lower Bounds for BF Decoders -- 4.1 Hard to Decode Errors for QC-MDPC -- 4.2 Results for QC-MDPC(2,p,v) Codes -- 5 Conclusion -- References -- Author Index.
• Titolo autorizzato: Code-Based Cryptography
• ISBN: 3-030-98365-X
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996464452003316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science