Parallel-CFS

DOI10.1007/978-3-642-19574-7_11MaRDI QIDQ3084252zbMATH OpenOpenAlexFDO

Authors Matthieu Finiasz

Publication date 15 March 2011

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19574-7_11

zbMATH Keywords

CFS digital signature schemecode based cryptographysyndrome decoding problem

Mathematics Subject Classification ID

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

Recommendations

• Certificateless parallel multisignature scheme based on bilinear pairings
• Efficient certificateless parallel multi-signature scheme
• CMSS – An Improved Merkle Signature Scheme
• Cryptanalysis and Improvement of a Certificateless Multi-proxy Signature Scheme
• Concise multi-challenge CCA-secure encryption and signatures with almost tight security
• Cryptanalysis and improvement of a proxy multisignature scheme
• Distributed Computing – IWDC 2005
• A pairing-free certificateless digital multisignature scheme using elliptic curve cryptography
• Provably secure identity-based identification and signature schemes with parallel-PVR

Cites work

• 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
• Algebraic cryptanalysis of McEliece variants with compact keys
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 2081064 (Why is no real title available?)
• List Decoding for Binary Goppa Codes
• McEliece Cryptosystem Implementation: Theory and Practice
• On the complexity of some cryptographic problems based on the general decoding problem
• Security bounds for the design of code-based cryptosystems
• Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme

Cited in

(10)

• A correction to a code-based blind signature scheme
• Implementing CFS
• Quasi-dyadic CFS signatures
• Decoding one out of many
• Monoidic codes in cryptography
• A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
• Quantum-assisted QD-CFS signatures
• A digital signature scheme \(\text{mCFS}^{\text{QC-LDPC}}\) based on QC-LDPC codes
• Code-Based Signature Schemes from Identification Protocols in the Rank Metric
• On two modifications of the McEliece PKE and the CFS signature scheme

Describes a project that uses

Uses Software

• McEliece

This page was built for publication: Parallel-CFS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084252)