A code-based hybrid signcryption scheme
From MaRDI portal
Publication:6175435
DOI10.1515/jmc-2022-0002zbMath1518.94074arXiv2112.07130OpenAlexW4379470540MaRDI QIDQ6175435
Jean Belo Klamti, M. Anwarul Hasan
Publication date: 24 July 2023
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.07130
Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94B99) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to construct efficient signcryption schemes on elliptic curves
- Attribute-based signcryption scheme based on linear codes
- Some remarks on the security of the identification scheme based on permuted kernels
- An efficient structural attack on NIST submission DAGS
- Lattice-based signcryption without random oracles
- DAGS: key encapsulation using dyadic GS codes
- Cryptanalysis of the binary permuted kernel problem
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- A code-based signature scheme from the Lyubashevsky framework
- Durandal: a rank metric based signature scheme
- How to mask the structure of codes for a cryptographic use
- On the dimension and structure of the square of the dual of a Goppa code
- On the Security of Tag-KEM for Signcryption
- Constructions of Signcryption in the Multi-user Setting from Identity-Based Encryption
- Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes
- Signcryption Schemes Based on the Diffie–Hellman Problem
- Signcryption Schemes Based on Bilinear Maps
- Signcryption Schemes Based on the RSA Problem
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
- Decoding One Out of Many
- Monoidic Codes in Cryptography
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Reducing Key Length of the McEliece Cryptosystem
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Compact McEliece Keys from Goppa Codes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the inherent intractability of certain coding problems (Corresp.)
- A new identification scheme based on syndrome decoding
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- On the complexity of some cryptographic problems based on the general decoding problem
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Secure and Anonymous Hybrid Encryption from Coding Theory
- Secure integration of asymmetric and symmetric encryption schemes
- LESS is More: Code-Based Signatures Without Syndromes
- A Distinguisher for High-Rate McEliece Cryptosystems
- Information Security and Privacy
- Information Security
- A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography
- Efficient Implementation of Hybrid Encryption from Coding Theory
- Public Key Cryptography - PKC 2006
This page was built for publication: A code-based hybrid signcryption scheme
