An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation

Akleylek, Sedat; Bindel, Nina; Buchmann, Johannes; Krämer, Juliane; Marson, Giorgia Azzurra

doi:10.1007/978-3-319-31517-1_3

Cited by 50 publications

(36 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thirdly, Ring-TESLA competes well in terms of throughput, with the other lattice-based signatures GLP and BLISS in software, despite having larger input and output sizes [2].…”

Section: Ideal Lattice-based Signaturesmentioning

confidence: 99%

“…A tight security reduction implies the cryptoscheme is no easier to solve than its hardness problem. Ring-TESLA competes well with GLP and BLISS in software [2], but as yet no hardware designs exist. This paper presents the first hardware designs of the Ring-TESLA signature scheme.…”

Section: Introductionmentioning

confidence: 99%

“…However, the hardness assumptions of NTRU is not related to the hardness of worst-case lattice problems, a useful property of Ring-LWE [8]. Accordingly, a lattice-based DSS based on the Ring-LWE problem has been proposed by Akleylek et al [2], named Ring-TESLA. Ring-TESLA provides three appealing properties.…”

Section: Ideal Lattice-based Signaturesmentioning

confidence: 99%

“…There are several practical proposals based on varying hard lattice-based problems, such as the NTRU cryptosystem and and Ring-LWE [1], [2]. For further background on practical lattice-based DSSs, the reader is referred to a recent survey on the state-of-the-art [3].…”

Section: Introductionmentioning

confidence: 99%

“…An alternative lattice-based signature scheme, Ring-TESLA [2], has been proposed which does not require discrete Gaussian sampling during sign or verify, and offers averagecase to worst-case hardness with a tight security reduction and a provably secure instantiation. A tight security reduction implies the cryptoscheme is no easier to solve than its hardness problem.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Compact and provably secure lattice-based signatures in hardware

Howe¹,

Rafferty²,

Khalid³

et al. 2017

2017 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

Abstract-Lattice-based cryptography is a quantum-safe alternative to existing classical asymmetric cryptography, such as RSA and ECC, which may be vulnerable to future attacks in the event of the creation of a viable quantum computer. The efficiency of lattice-based cryptography has improved over recent years, but there has been relatively little investigation into hardware designs of digital signature schemes. In this paper, the first hardware design of the provably secure Ring-LWE digital signature scheme, Ring-TESLA, is presented, targeting a Xilinx Spartan-6 FPGA. The results better compactness of all previous lattice-based digital signature schemes in hardware, and can achieve between 104-785 signatures and 102-776 verifications per second.

show abstract

“…Thirdly, Ring-TESLA competes well in terms of throughput, with the other lattice-based signatures GLP and BLISS in software, despite having larger input and output sizes [2].…”

Section: Ideal Lattice-based Signaturesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Ideal Lattice-based Signaturesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Compact and provably secure lattice-based signatures in hardware

Howe¹,

Rafferty²,

Khalid³

et al. 2017

2017 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

show abstract

A provably secure code‐based short signature scheme and its nontransferable variant

Asaar

Salmasizadeh

Aref

2018

Int J Communication

View full text Add to dashboard Cite

SummarySignatures with partially message recovery in which some parts of messages are not transmitted with signatures to make them shorter are helpful where bandwidth is one of the critical concern. This primitive is especially used for signing short messages in applications such as time stamping, certified email services, and identity‐based cryptosystems. In this paper, to have quantum‐attack‐resistant short signatures, the first signature scheme with partially message recovery based on coding theory is presented. Next, it is shown that the proposal is secure under Goppa Parametrized Bounded Decoding and the Goppa Code Distinguishing assumptions in the random oracle model. Relying on the partially message recovery property, the proposal is shorter than Dallot signature scheme, the only provably secure and practical code‐based signature scheme, while it preserves Dallot signature efficiency. We should highlight that our scheme can be used as a building block to construct short code‐based signature schemes with special properties. To show this, we present a provably secure short designated verifier signature scheme, a nontransferable form of short signatures, which is used in electronic voting and deniable authentication protocols.

show abstract

Design of lattice‐based ElGamal encryption and signature schemes using SIS problem

Gupta

2017

Trans Emerging Tel Tech

View full text Add to dashboard Cite

The emerging technologies like quantum computing and cloud computing have a complex computing power and can break the security of the classical cryptographic constructions (like ElGamal's cryptosystem). Thus, we were motivated to work on hard lattice problems, which are more complex and can resist these new modern technologies. In this proposal, we present a lattice‐based version of discrete logarithm problem‐based ElGamal public‐key encryption and signature schemes that exhibit strong security features and efficient implementation. The security of these presented schemes is based on the worst‐case hardness of approximating a small integer vector in their corresponding lattice. Furthermore, this proposed work illustrates a security proof of the proposed schemes and shows that the presented schemes are well protected in the modern computing environment. The performance analysis and comparison with classical ElGamal schemes and recent lattice‐based schemes are also made, and it is seen that the proposed schemes achieve better performance.

show abstract

An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation

Cited by 50 publications

References 31 publications

Compact and provably secure lattice-based signatures in hardware

Compact and provably secure lattice-based signatures in hardware

A provably secure code‐based short signature scheme and its nontransferable variant

Design of lattice‐based ElGamal encryption and signature schemes using SIS problem

Contact Info

Product

Resources

About