Loading...
Search for:
lattice-based-cryptography
0.006 seconds
On constrained implementation of lattice-based cryptographic primitives and schemes on smart cards
, Article ACM Transactions on Embedded Computing Systems ; Volume 14, Issue 3 , 2015 ; 15399087 (ISSN) ; Sarmadi, S. B ; Jalili, R ; Sharif University of Technology
Association for Computing Machinery
2015
Abstract
Most lattice-based cryptographic schemes with a security proof suffer from large key sizes and heavy computations. This is also true for the simpler case of authentication protocols that are used on smart cards as a very-constrained computing environment. Recent progress on ideal lattices has significantly improved the efficiency and made it possible to implement practical lattice-based cryptography on constrained devices. However, to the best of our knowledge, no previous attempts have been made to implement lattice-based schemes on smart cards. In this article, we provide the results of our implementation of several state-of-the art lattice-based authentication protocols on smart cards and...
An efficient lattice based multi-stage secret sharing scheme
, Article IEEE Transactions on Dependable and Secure Computing ; Volume 14, Issue 1 , 2017 , Pages 2-8 ; 15455971 (ISSN) ; Eghlidos, T ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2017
Abstract
In this paper, we construct a lattice based (t, n) threshold multi-stage secret sharing (MSSS) scheme according to Ajtai's construction for one-way functions. In an MSSS scheme, the authorized subsets of participants can recover a subset of secrets at each stage while other secrets remain undisclosed. In this paper, each secret is a vector from a t-dimensional lattice and the basis of each lattice is kept private. A t-subset of n participants can recover the secret(s) using their assigned shares. Using a lattice based one-way function, even after some secrets are revealed, the computational security of the unrecovered secrets is provided against quantum computers. The scheme is multi-use in...
A Lattice based Threshold Multi-Secret Sharing Scheme and its Application to Threshold Cryptography
, Ph.D. Dissertation Sharif University of Technology ; Eghlidos, Taraneh (Supervisor)
Abstract
Secret sharing schemes are used for storage and management of sensitive data such as cryptographic keys and bank account numbers. These schemes provide both confidentiality and reliability. Advances in quantum computers have threatened the security of currently used public-key cryptographic algorithms. In this thesis, for designing quantum resistant cryptographic schemes, we construct a lattice based threshold multi-stage secret sharing (TMSSS) scheme. Using a lattice based one-way function, even after some secrets are revealed, the computational security of the unrecovered secrets is provided against quantum computers. The scheme is multi-use and verifiable meaning that the participants can...
An efficient statistical zero-knowledge authentication protocol for smart cards
, Article International Journal of Computer Mathematics ; Volume 93, Issue 3 , 2016 , Pages 453-481 ; 00207160 (ISSN) ; Jalili, R ; Sharif University of Technology
Taylor and Francis Ltd
2016
Abstract
We construct an efficient statistical zero-knowledge authentication protocol for smart cards based on general assumptions. We show how it can be instantiated using lattice-based primitives, which are conjectured to be secure against quantum attacks. We illustrate the practicality of our protocol on smart cards in terms of storage, computation, communication, and round complexities. Furthermore, we compare it to other lattice-based authentication protocols, which are either zero-knowledge or have a similar structure. The comparison shows that our protocol improves the best previous protocol in several aspects
An Improvement to Statistical Zero-Knowledge Security Protocols
, M.Sc. Thesis Sharif University of Technology ; Jalili, Rasool (Supervisor)
Abstract
In this thesis, we present a new identification protocol which is based on lattice problems. Lattice-based cryptographic algorithms are, in general, faster than those based on number theory. Moreover, instead of algorithms based on number theory problems, such as Factoring and Discrete Logarithm, lattice-based ones are resistant against quantum computers. In addition, lattice problems have worst-case/average-case hardness relation; so become suitable choices for cryptographic purposes. However, there are few lattice-based identification protocols which are efficient. The protocol introduced in this thesis, is statistical zero-knowledge which means no verifier, even computationally unbounded...
A Lattice-based Authenticated Group Key Establishment Scheme Using Secret Sharing
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor) ; Eghlidos, Taraneh (Co-Supervisor)
Abstract
Secure communication among members of a group requires a shared cryptographic key. To address this issue, group key agreement and exchange schemes are introduced. In group key exchange schemes, a trusted center generates a shared key for the group and sends it securely to the group members. But in group key agreement schemes, all members of the group are involved in generating group keys. One of the useful ways in these schemes is to use secret sharing to share keys. A public key infrastructure is used to secure the distribution of the shares in secret sharing schemes. As quantum computers threat the classic cryptographic algorithms that are based on the difficulty of factoring large numbers...
Enhancing A RISC-V Based Processor to Support Lattice-based Post-uantum Cryptography
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
The amount of data over networks are increasing rapidly, and accordingly, smart devices are being encountered severe challenges by the advancement of security threats. In order to create safe communications among smart devices, employing public-key cryptography is needed. But, public-key and classic cryptography, such as RSA, have high computation complexities and are not resistant to quantum attacks. Due to mentioned reasons, using these types of cryptography algorithms in internet-of-things (IoT) devices is unreasonable. In the past decade, lattice-based cryptography has been one of the pioneer post-quantum cryptography members, which benefits from comparatively lower computational...
On Lattice-Based Provably-Secure Authentication
, Ph.D. Dissertation Sharif University of Technology ; Jalili, Rasool (Supervisor) ; Bayat-Sarmadi, Siavash (Supervisor)
Abstract
Lattice-based cryptography, as one of the main candidates for post-quantum cryptography, has attracted much attention along with cryptography researchers. That is mostly due to the fact that building large-scale quantum computers is possible within coming decades, which leads to a break-down in widely-used number-theoretic cryptographic schemes. Vulnerable cryptosystems include RSA, ECDSA, and ECDH, which are currently utilized everyday to secure cyberspace and digital communications. In this thesis, we focus on lattice-based and provably-secure authentication. Firstly, we propose three lattice-based authenticated encryption (AE) schemes. To the best of our knowledge, these are the first...
Efficient Implementation of Post-Quantum Cryptography Based on Learning with Errors
, Ph.D. Dissertation Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Public key encryption (PKE) cryptography plays a big role in securing communication channels of internet. The security of every PKE scheme is usually based on a hard problem that has no polynomial time solution using any computational structure. However, widely used classic PKE schemes such as RSA or ECC, are based on hard problems that have polynomial solutions using a quantum computer. Therefore, such PKE schemes will not be secure in post-quantum era. Among quantum-resistant schemes, lattice-based cryptography and especially learning with errors (LWE) problem have gained high attention due to their low computational complexity. In this thesis, different LWE-based cryptosystems are...
A lattice-based threshold secret sharing scheme
, Article 2014 11th International ISC Conference on Information Security and Cryptology, ISCISC 2014 ; Sept , 2014 , pp. 173-179 ; ISBN: 9781479953837 ; Asaad, S ; Eghlidos, T ; Aref, M ; Sharif University of Technology
Abstract
In this paper, we introduce a method of threshold secret sharing scheme in which secret reconstruction is based on celebrated Babai lattice algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there is no quantum threats to these channels. One solution for this problem can be utilization of lattice cryptosystems for these channels which requires designing lattice based secret sharing schemes. We indicate that our scheme is asymptotically correct. Moreover, we analyze the security of our scheme by giving a quantitative proof of security from the view point of information theory
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...
A Lightweight Lattice-Based Searchable Encryption Scheme
, M.Sc. Thesis Sharif University of Technology ; Eghlidos, Taraneh (Supervisor)
Abstract
Many lattice-based public key encryption schemes are forced to use long keys. To deal with this problem, structured lattices such as NTRU can be used. Lattice-based searchable public key encryption schemes are no exception. Furthermore, in most existing searchable public key encryption schemes, it is assumed that the user searches documents with only one keyword. However, using a conjunctive keyword search, we can search for documents containing several keywords by executing the trapdoor generation algorithm only once. On the other hand, in most of the published searchable public key encryption schemes, storing and searching encrypted keywords are responsibility of a central entity called...
A lattice-based changeable threshold multi-secret sharing scheme and its application to threshold cryptography
, Article Scientia Iranica ; Volume 24, Issue 3 , 2017 , Pages 1448-1457 ; 10263098 (ISSN) ; Eghlidos, T ; Sharif University of Technology
Sharif University of Technology
2017
Abstract
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 significant feature of threshold changeability along with the inherited features of being multi-stage, multi-use, and verifiable derived from our 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...
Public key cryptosystem based on low density lattice codes
, Article Wireless Personal Communications ; Volume 92, Issue 3 , 2017 , Pages 1107-1123 ; 09296212 (ISSN) ; Aref, M. R ; Sharif University of Technology
Springer New York LLC
2017
Abstract
McEliece and Goldreich–Goldwasser–Halevi (GGH) cryptosystems are two instances of code and lattice-based cryptosystems whose security are based on the hardness of coding theoretic and lattice problems, respectively. However, such cryptosystems have a number of drawbacks which make them inefficient in practice. On the other hand, low density lattice codes (LDLCs) are practical lattice codes which can achieve capacity over additive white Gaussian noise channel and also can be encoded and decoded efficiently. This paper introduces a public key cryptosystem based on Latin square LDLCs, by which a relationship can be attained between code and lattice-based cryptography. In this way, we can...
Post-quantum cryptoprocessors optimized for edge and resource-constrained devices in IoT
, Article IEEE Internet of Things Journal ; Volume 6, Issue 3 , 2019 , Pages 5500-5507 ; 23274662 (ISSN) ; Bayat Sarmadi, S ; Mosanaei Boorani, H ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2019
Abstract
By exponential increase in applications of the Internet of Things (IoT), such as smart ecosystems or e-health, more security threats have been introduced. In order to resist known attacks for IoT networks, multiple security protocols must be established among nodes. Thus, IoT devices are required to execute various cryptographic operations, such as public key encryption/decryption. However, classic public key cryptosystems, such as Rivest-Shammir-Adlemon and elliptic curve cryptography are computationally more complex to be efficiently implemented on IoT devices and are vulnerable regarding quantum attacks. Therefore, after complete development of quantum computing, these cryptosystems will...
Lightweight and DPA-resistant post-quantum cryptoprocessor based on binary ring-LWE
, Article 20th International Symposium on Computer Architecture and Digital Systems, CADS 2020, 19 August 2020 through 20 August 2020 ; 2020 ; Bayat Sarmadi, S ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2020
Abstract
With the exponential growth in the internet of things (IoT) applications such as smart city and e-health, more embedded devices and smart nodes are connected to the network. In order to provide security for such resource-constrained devices, different cryptographic schemes such as public key encryption (PKE) are required. However, considering the high complexity and vulnerability of classic PKE schemes against quantum attacks, it is necessary to consider other possible options. Recently, lattice-based cryptography and especially learning with errors (LWE) have gained high attention due to resistance against quantum attacks and relatively low-complexity operations. During the past decade,...
Lightweight and fault-resilient implementations of binary ring-lwe for iot devices
, Article IEEE Internet of Things Journal ; Volume 7, Issue 8 , 2020 , Pages 6970-6978 ; Bayat Sarmadi, S ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2020
Abstract
While the Internet of Things (IoT) shapes the future of the Internet, communications among nodes must be secured by employing cryptographic schemes such as public-key encryption (PKE). However, classic PKE schemes, such as RSA and elliptic curve cryptography (ECC) suffer from both high complexity and vulnerability to quantum attacks. During the past decade, post-quantum schemes based on the learning with errors (LWEs) problem have gained high attention due to the lower complexity among PKE schemes. In addition to resistance against theoretical (quantum and classic) attacks, every practical implementation of any cryptosystem must also be evaluated against different side-channel attacks such...
High-Speed post-quantum cryptoprocessor based on RISC-V architecture for IoT
, Article IEEE Internet of Things Journal ; Volume 9, Issue 17 , 2022 , Pages 15839-15846 ; 23274662 (ISSN) ; Bayat Sarmadi, S ; Ebrahimi, S ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2022
Abstract
Public-key plays a significant role in today's communication over the network. However, current state-of-the-art public-key encryption (PKE) schemes are too complex to be efficiently employed in resource-constrained devices. Moreover, they are vulnerable to quantum attacks and soon will not have the required security. In the last decade, lattice-based cryptography has been a progenitor platform of the post-quantum cryptography (PQC) due to its lower complexity, which makes it more suitable for Internet of Things applications. In this article, we propose an efficient implementation of the binary learning with errors over ring (Ring-BinLWE) on the reduced instruction set computer-five (RISC-V)...