Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Identity-Based Identification and Signature Schemes using Error Correcting Codes
View through CrossRef
In this chapter, we propose a survey of identity-based identification and signature schemes using error correcting codes. We describe coding theory, its application to cryptography and the different identification and signature schemes using error correcting codes with their new improvements. We also present the first (and unique up to now) identity-based scheme (provably secure) not based on number theory or generic constructions. The scheme combines two well known code-based schemes: the signature scheme of Courtois, Finiasz and Sendrier and the zero-knowledge identification scheme of Stern (which may also be used for signature). The scheme inherits some of the characteristics of the previous schemes: it has a large public key of order 1MB and requires a certain number of exchange rounds. The scheme can also be used as signature but leads to a very large signature of size 1.5 MB. Eventually, we present schemes obtained from the generic construction.
Title: Identity-Based Identification and Signature Schemes using Error Correcting Codes
Description:
In this chapter, we propose a survey of identity-based identification and signature schemes using error correcting codes.
We describe coding theory, its application to cryptography and the different identification and signature schemes using error correcting codes with their new improvements.
We also present the first (and unique up to now) identity-based scheme (provably secure) not based on number theory or generic constructions.
The scheme combines two well known code-based schemes: the signature scheme of Courtois, Finiasz and Sendrier and the zero-knowledge identification scheme of Stern (which may also be used for signature).
The scheme inherits some of the characteristics of the previous schemes: it has a large public key of order 1MB and requires a certain number of exchange rounds.
The scheme can also be used as signature but leads to a very large signature of size 1.
5 MB.
Eventually, we present schemes obtained from the generic construction.
Related Results
Increased life expectancy of heart failure patients in a rural center by a multidisciplinary program
Increased life expectancy of heart failure patients in a rural center by a multidisciplinary program
Abstract
Funding Acknowledgements
Type of funding sources: None.
INTRODUCTION Patients with heart failure (HF)...
A novel method for development of post-quantum digital signature schemes
A novel method for development of post-quantum digital signature schemes
Introduction: Development of post-quantum digital signature standards represents a current challenge in the area of cryptography. Recently, the signature schemes based on the hidde...
A Novel Method for Developing Post-quantum Digital Signature Algorithms on Non-commutative Associative Algebras
A Novel Method for Developing Post-quantum Digital Signature Algorithms on Non-commutative Associative Algebras
Introduction: Development of practical post-quantum signature algorithms is a current challenge in the area of cryptography. Recently, several candidates on post-quantum signature ...
NICU Medication Errors: Describing the Cause and Nature of Medication Errors in a NICU in Qatar
NICU Medication Errors: Describing the Cause and Nature of Medication Errors in a NICU in Qatar
IntroductionA medication error can be defined as “any error occurring in the medication use process” and focuses on problems with the delivery of medication to a patient [1]. Medic...
Self-healing and secure low-power memory systems
Self-healing and secure low-power memory systems
The main objective of this thesis is to bring new contributions to the self-healing and secure systems domain. In particular, to develop a self-healing technique for memory systems...
Generalised array low‐density parity‐check codes
Generalised array low‐density parity‐check codes
In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of pr...
A Novel Digital Signature based on Error Correcting Codes
A Novel Digital Signature based on Error Correcting Codes
A digital signature is a cryptographic primitive for ensuring the authenticity of digital documents. A valid digital signature allows checking that a message was created by a known...
A post-quantum digital signature scheme on groups with four-dimensional cyclicity
A post-quantum digital signature scheme on groups with four-dimensional cyclicity
Introduction: Development of practical post-quantum signature schemes is a current challenge in the applied cryptography. Recently, several different forms of the hidden discrete l...