Loading...
Search for:
code-based-cryptography
0.005 seconds
Secret key cryptosystem based on polar codes over Binary Erasure Channel
, Article 2013 10th International ISC Conference on Information Security and Cryptology, ISCISC 2013 ; 2013 ; Shooshtari, M. K ; Aref, M. R ; Sharif University of Technology
2013
Abstract
This paper proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure and reliable communication using finite-length polar codes. The proposed cryptosystem has a significant security advantage against chosen plaintext attacks in comparison with the Rao-Nam cryptosystem. Also, the key length is decreased after applying a new compression algorithm. Moreover, this scheme benefits from high code rate and proper error performance for reliable communication
Reducing the key length of mceliece cryptosystem using polar codes
, Article 2014 11th International ISC Conference on Information Security and Cryptology, ISCISC 2014 ; Sept , 2014 , pp. 104-108 ; ISBN: 9781479953837 ; Koochak Shooshtari, M ; Eghlidos, T ; Aref, M. R ; Sharif University of Technology
Abstract
This paper introduces a public key scheme based on polar codes to improve the performance of McEliece cryptosystem. By exploiting the interesting properties of polar codes, we put the encryption matrix of the proposed scheme in systematic form. Moreover, the nonsingular matrix is constructed from the generator matrix of used polar code. These proceedings lead to decrease the public and private key lengths compared with the original McEliece public key cryptosystem. We analyze the proposed scheme against known attacks on the public key cryptosystems based on channel coding. Moreover, it benefits from high code rate and proper error correction capability for reliable communication
Secret key cryptosystem based on non-systematic polar codes
, Article Wireless Personal Communications ; Volume 84, Issue 2 , September , 2015 , Pages 1345-1373 ; 09296212 (ISSN) ; Aref, M. R ; Eghlidos, T ; Sharif University of Technology
Springer New York LLC
2015
Abstract
Polar codes are a new class of error correcting linear block codes, whose generator matrix is specified by the knowledge of transmission channel parameters, code length and code dimension. Moreover, regarding computational security, it is assumed that an attacker with a restricted processing power has unlimited access to the transmission media. Therefore, the attacker can construct the generator matrix of polar codes, especially in the case of binary erasure channels, on which this matrix can be easily constructed. In this paper, we introduce a novel method to keep the generator matrix of polar codes in secret in a way that the attacker cannot access the required information to decode the...
Provably secure strong designated verifier signature scheme based on coding theory
, Article International Journal of Communication Systems ; Volume 30, Issue 7 , 2017 ; 10745351 (ISSN) ; Ahmadian Attari, M ; Aref, M. R ; Sharif University of Technology
John Wiley and Sons Ltd
2017
Abstract
Strong Designated Verifier Signature (SDVS) provides authentication for the signer and the verifier such that the signer is assured that what s/he has signed, is only verified by the designated verifier. Currently, the security of most of the SDVS schemes is based on hard problems in the number theory. As it is proved that all kinds of cryptosystems which are based on the number theory will not tolerate quantum attacks, here, an SDVS scheme based on hard problems in coding theory is presented. We have proved that the suggested scheme is unforgeable under a chosen message attack in Random Oracle Model. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd
Smooth projective hash function from codes and its applications
, Article IEEE Transactions on Services Computing ; 2021 ; 19391374 (ISSN) ; Aref, M. R ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
Nowadays, Smooth Projective Hash Functions (SPHFs) play an important role in constructing cryptographic tools such as secure Password-based Authenticated Key Exchange (PAKE) protocol in the standard model, oblivious transfer, and zero-knowledge proofs. Specifically, in this paper, we focus on constructing PAKE protocol; that is, a kind of key exchange protocol which needs only a low entropy password to produce a cryptographically strong shared session key. In spite of relatively good progress of SPHFs in applications, it seems there has been little effort to build them upon quantum-resistant assumptions such as lattice-based cryptography and code-based cryptography to make them secure...
Smooth projective hash function from codes and its applications
, Article IEEE Transactions on Services Computing ; Volume 15, Issue 6 , 2022 , Pages 3541-3553 ; 19391374 (ISSN) ; Aref, M. R ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2022
Abstract
Nowadays, Smooth Projective Hash Functions (SPHFs) play an important role in constructing cryptographic tools such as secure Password-based Authenticated Key Exchange (PAKE) protocol in the standard model, oblivious transfer, and zero-knowledge proofs. Specifically, in this article, we focus on constructing PAKE protocol; that is, a kind of key exchange protocol which needs only a low entropy password to produce a cryptographically strong shared session key. In spite of relatively good progress of SPHFs in applications, it seems there has been little effort to build them upon quantum-resistant assumptions such as lattice-based cryptography and code-based cryptography to make them secure...