MARATTO

article

Secure and Efficient Code-Based Cryptography for Multi-Party Computation and Digital Signatures

20236 citationsOpen accessUniversité Sultan Moulay Slimane

Abstract

Code-based cryptography is a promising candidate for post-quantum cryptography due to its strong security guarantees and efficient implementations. In this paper, we explore the use of code-based cryptography for multi-party computation and digital signatures, two important cryptographic applications. We present several efficient and secure code-based protocols for these applications, based on the McEliece cryptosystem and its variants. Our protocols offer strong security guarantees against both classical and quantum attacks, and have competitive performance compared to other post-quantum cryptographic schemes. We also compare code-based cryptography with other post-quantum schemes, including lattice-based and hash-based cryptography, and discuss the advantages and disadvantages of each approach.

Research topics

  • Cryptography and Data Security
  • Coding theory and cryptography
  • graph theory and CDMA systems

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.3390/cmsf2023006001

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.