Compact Lattice Signatures

Dipayan Das, Vishal Saraswat

2018

Abstract

Lattice-based signature schemes have seen many improvements in the past few years with recent attempts (Güneysu et al., 2012; Ducas et al., 2013; Ducas et al., 2014; Lyubashevsky, 2016; Ducas et al., 2017) to bring lattice-based signature schemes at par with the traditional number-theoretic signature schemes. However, the trade-off between the signature size and the key size, time for a signature generation, and the practical and provable security is not necessarily the optimal. We propose a compact lattice-based signature scheme with key-size and signatures of order n, where n is the dimension of the lattice. The proposed signature scheme has faster algorithms for key generation, signing, and verification than the existing schemes. The proposed scheme is simple and is competitive with the other post-quantum signature schemes.

Paper Citation

in Harvard Style

Das D. and Saraswat V. (2018). Compact Lattice Signatures.In Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT, ISBN 978-989-758-319-3, pages 490-495. DOI: 10.5220/0006861604900495

in Bibtex Style

@conference{secrypt18,
author={Dipayan Das and Vishal Saraswat},
title={Compact Lattice Signatures},
booktitle={Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT,},
year={2018},
pages={490-495},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006861604900495},
isbn={978-989-758-319-3},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT,
TI - Compact Lattice Signatures
SN - 978-989-758-319-3
AU - Das D.
AU - Saraswat V.
PY - 2018
SP - 490
EP - 495
DO - 10.5220/0006861604900495