A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory

DOI10.1007/978-3-319-12160-4_21zbMath1352.94053OpenAlexW2256649878MaRDI QIDQ3193273

Sachin Vasant, K. Preetha Mathew, C. Pandu Rangan

Publication date: 16 October 2015

Published in: Information Security and Cryptology -- ICISC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12160-4_21

zbMATH Keywords

signaturecode-based cryptographysigncryptionsyndrome decodingCFS signature

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

On the security of the Courtois-Finiasz-Sendrier signature ⋮ A code-based group signature scheme

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhanced public key security for the McEliece cryptosystem
• Random matrices and codes for the erasure channel
• Parallel-CFS
• Decoding One Out of Many
• An Efficient Attack on All Concrete KKS Proposals
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys
• Code-based cryptography
• Security Bounds for the Design of Code-Based Cryptosystems
• On the inherent intractability of certain coding problems (Corresp.)
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
• A new identification scheme based on syndrome decoding
• Is code equivalence easy to decide?
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• A digital signature scheme based on random error-correcting codes
• How to avoid the Sidel'nikov-Shestakov attack
• A Distinguisher for High-Rate McEliece Cryptosystems
• Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme

This page was built for publication: A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory