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.
In a multistage secret sharing (MSSS) scheme, the authorised subsets of participants could recover a number of secrets in different stages. A one‐stage multisecret sharing (OSMSS) scheme is a special case of MSSS schemes in which all the secrets are recovered simultaneously. In these schemes, in addition to the individual shares, the dealer should provide the participants with a number of public values associated with the secrets. The less the number of public values, the more efficient is the scheme. It is desired that the MSSS and OSMSS schemes provide computational security. In this study, the authors show that in the OSMSS schemes any unauthorised coalition of the participants can reduce the uncertainty of the secrets. In addition, in MSSS schemes recovering a secret causes reducing uncertainty of the unrecovered secrets. Furthermore, by introducing a new multi‐use MSSS scheme based on weil pairing, they reduce the number of public values comparing with the previous schemes.
Secret sharing is a cryptographic technique used in many different applications such as cloud computing, multi‐party computation and electronic voting. Security concerns in these applications are data privacy, availability, integrity and verifiability, where secret sharing provides proper solutions. The authors address some important features like verifiability and being multi‐stage to make it usable in various field of application. Here, the authors propose an anonymous threshold signature scheme based on the trapdoor function introduced by Micciancio and Peikert by sharing the private key using a lattice‐based threshold multi‐stage secret sharing (TMSSS) scheme. Then, the authors improve the previously proposed TMSSS scheme, in such a way that less public values are required to publish on the bulletin board which makes the scheme more efficient while preserving the security of the scheme based on the lattice hard problems. The proposed scheme inherits the desired features such as anonymity and verifiability from the improved TMSSS scheme. Furthermore, both schemes use simple matrix operations, which additionally increase the efficiency.
22 May 2020 in IEEE Transactions on Communications
We propose a new nonlinear Rao-Nam like symmetric key encryption scheme. In our design, we employ a specific type of coded modulation schemes namely quasi-cyclic low-density parity-check (QC-LDPC) lattice-codes which have low-complexity encoding and decoding algorithms. Due to the application of coded modulation schemes in our design, the proposed scheme performs encryption, encoding and modulation simultaneously. Therefore, we regard the proposed scheme as a joint cryptosystem. The proposed joint cryptosystem withstands all variants of chosen plaintext attacks applied on Rao-Nam like cryptosystems due to its nonlinearity. Moreover, some conditions implying the uniformity of the ciphertexts distribution are introduced through our analysis. Our scheme is efficient and admits small key size. These features are obtained due to several reasons including the quasi-cyclic form of the generator and the parity-check matrices of QC-LDPC lattice-codes, and the simple hardware structure for generating the permutation matrix, the intentional error vector and the nonlinear functions used in our design. The QC-LDPC lattice-codes facilitate high-rate transmission which is suitable for bandlimited AWGN channels. Our simulations indicate that QC-LDPC lattice-codes outperform the error performance of high-order coded modulation schemes based on QAM modulations. Hence, our scheme provides secure, reliable and efficient data transmission in bandlimited AWGN channels.
In this paper, we propose a threshold increasing algorithm for a (t; n) latticebased Threshold Multi-Stage Secret Sharing (TMSSS) scheme. To realize the changeability feature, we use the zero addition protocol to construct a new (t0; n) TMSSS scheme. Therefore, the new scheme enjoys the signi cant feature of threshold changeability along with the inherited features of being multi-stage, multi-use, and veri able derived fromour previously proposed lattice-based TMSSS scheme. Furthermore, we use the improved TMSSS scheme to propose a threshold decryption algorithm for the Learning With Error (LWE) based public key encryption scheme based on the study of Lindner and Peikert. For threshold decryption, each authorized subset of participants decrypts the ciphertext partially and sends the result to the combiner. The combiner can decrypt the ciphertext using the partial decryptions. The security of both schemes is based on hardness of lattice problems, i.e. LWE and Inhomogeneous Small Integer Solution (ISIS) problems, which are believed to resist against the quantum algorithms. The proposed schemes are eficient, especially on the participants' side, making them suitable for the applications in which the participants have limited processing capacities.