An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation

DOI10.1007/978-3-319-31517-1_3zbMath1404.94034OpenAlexW3030554837MaRDI QIDQ2814694

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

Publication date: 22 June 2016

Published in: Progress in Cryptology – AFRICACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31517-1_3

zbMATH Keywords

tightnessideal latticessignatureslattice-based cryptographyring learning with errorsBLISS

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ Cryptanalysis of a round optimal lattice-based multisignature scheme ⋮ Dilithium for memory constrained devices ⋮ Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures ⋮ The lattice-based digital signature scheme qTESLA ⋮ A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor ⋮ A framework for cryptographic problems from linear algebra ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions

This page was built for publication: An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation