A Multisecret-Sharing Scheme Based on LCD Codes

Alahmadi, Adel; Altassan, Alaa; Al-Kenani, Ahmad N.; Çalkavur, Selda; Shoaib, Hatoon; Solé, Patrick

doi:10.3390/math8020272

Cited by 15 publications

(7 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Carlet and Guilley examined an implementation of LCD codes against side-channel attacks in [6]. Alahmadi et al [1] constructed a multisecretsharing scheme based on LCD codes.…”

Section: Several Alternative Systems Have Been Proposed Aftermentioning

confidence: 99%

A New Public-Key Cryptosystem Based on LCD Codes

Çalkavur¹

2021

European Journal of Science and Technology

Self Cite

View full text Add to dashboard Cite

A cryptosystem is a structure or scheme consisting of a set of algorithms that converts plaintext to ciphertext to encode or decode messages securely. The cryptosystem points at a computer system that employs cryptography. Cryptosystems are classified by the method they use to encrypt data. One of them is symmetric key encryption. While the symmetric key algorithm uses the same key for encryption and decryption, asymmetric key encryption or public-key encryption uses the different keys. So it is more reliable than symmetric cipher algorithm. In this paper, we propose a new public-key cryptosystem by using LCD codes and explain the signature protocol based on this system which is reliable.

show abstract

“…Carlet and Guilley examined an implementation of LCD codes against side-channel attacks in [6]. Alahmadi et al [1] constructed a multisecretsharing scheme based on LCD codes.…”

Section: Several Alternative Systems Have Been Proposed Aftermentioning

confidence: 99%

A New Public-Key Cryptosystem Based on LCD Codes

Çalkavur¹

2021

European Journal of Science and Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…There is a lot of work on the ramp secret sharing scheme. Some of them are given in [8,9]. Alahmadi et al [8] explain a multisecret-sharing scheme based on LCD codes.…”

Section: Secret Sharing Schemesmentioning

confidence: 99%

“…Some of them are given in [8,9]. Alahmadi et al [8] explain a multisecret-sharing scheme based on LCD codes. They use Blakley's method to construct their scheme.…”

Section: Secret Sharing Schemesmentioning

confidence: 99%

Secret Sharing, Zero Sum Sets, and Hamming Codes

Çalkavur

Solé

2020

Mathematics

Self Cite

View full text Add to dashboard Cite

A (t,n)-secret sharing scheme is a method of distribution of information among n participants such that any t>1 of them can reconstruct the secret but any t−1 cannot. A ramp secret sharing scheme is a relaxation of that protocol that allows that some (t−1)-coalitions could reconstruct the secret. In this work, we explore some ramp secret sharing schemes based on quotients of polynomial rings. The security analysis depends on the distribution of zero-sum sets in abelian groups. We characterize all finite commutative rings for which the sum of all elements is zero, a result of independent interest. When the quotient is a finite field, we are led to study the weight distribution of a coset of shortened Hamming codes.

show abstract

“…Later, Calkavur et al [6] construct an image SSS based on Shamir [19] secret sharing. Recently Alahmadi et al [1] presented a multi-secret sharing scheme on LCD code C with length n over finite field F q . In the scheme, the secret key is chosen from F k q , which is a limitation of the scheme, where k is the dimension of C.…”

Section: Introductionmentioning

confidence: 99%

Linear complementary dual code-based Multi-secret sharing scheme

Ghosh¹,

Bhowmick²,

Maurya³

et al. 2021

Preprint

View full text Add to dashboard Cite

Hiding a secret is needed in many situations. Secret sharing plays an important role in protecting information from getting lost, stolen, or destroyed and has been applicable in recent years. A secret sharing scheme is a cryptographic protocol in which a dealer divides the secret into several pieces of share and one share is given to each participant. To recover the secret, the dealer requires a subset of participants called access structure. In this paper, we present a multi-secret sharing scheme over a local ring based on linear complementary dual codes using Blakley's method. We take a large secret space over a local ring that is greater than other code-based schemes and obtain a perfect and almost ideal scheme.Multi-secret sharing scheme (MSSS) is an important family of SSSs. It is a case in which many secrets need to be shared. In other words, a multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s 1 , s 2 , . . . , s m among a

show abstract

A Multisecret-Sharing Scheme Based on LCD Codes

Cited by 15 publications

References 21 publications

A New Public-Key Cryptosystem Based on LCD Codes

A New Public-Key Cryptosystem Based on LCD Codes

Secret Sharing, Zero Sum Sets, and Hamming Codes

Linear complementary dual code-based Multi-secret sharing scheme

Contact Info

Product

Resources

About