Code-Based Signature Schemes from Identification Protocols in the Rank Metric

DOI10.1007/978-3-030-00434-7_14zbMath1518.94108OpenAlexW2889380842MaRDI QIDQ6104627

Florian Caullery, Victor Mateu, Unnamed Author, Emanuele Bellini, Unnamed Author

Publication date: 28 June 2023

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-00434-7_14

zbMATH Keywords

code-based cryptographysignature schemerank metricFiat-Shamir transformidentification protocol

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of codes with maximum rank distance
• Improved identification schemes based on error-correcting codes
• A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
• A new rank metric codes based encryption scheme
• New technique for decoding codes in the rank metric and its cryptography applications
• Post-quantum security of Fiat-Shamir
• An Efficient Attack on a Code-Based Signature Scheme
• On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
• Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
• On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
• On the Complexity of the Rank Syndrome Decoding Problem
• Parallel-CFS
• A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
• Random Oracles in a Quantum World
• Full Cryptanalysis of the Chen Identification Protocol
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys
• Grover vs. McEliece
• Reducing Key Length of the McEliece Cryptosystem
• Security Bounds for the Design of Code-Based Cryptosystems
• Compact McEliece Keys from Goppa Codes
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A new identification scheme based on syndrome decoding
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A digital signature scheme based on random error-correcting codes
• Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
• An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes
• New Results for Rank-Based Cryptography
• Extended security arguments for signature schemes

This page was built for publication: Code-Based Signature Schemes from Identification Protocols in the Rank Metric