TY - JOUR
T1 - Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
AU - Gur, Kamil D.
AU - Polyakov, Yuriy
AU - Rohloff, Kurt
AU - Ryan, Gerard W.
AU - Sajjadpour, Hadi
AU - Savas, Erkay
N1 - Funding Information:
This work was sponsored by the Defense Advanced Research Projects Agency (DARPA) and the Army Research Laboratory (ARL) under Contract Numbers W911NF-15-C-0226 and W911NF-15-C-0233. The views expressed are those of the authors and do not necessarily reflect the official policy or position of the Department of Defense or the U.S. Government.
Publisher Copyright:
© 1968-2012 IEEE.
PY - 2019/4/1
Y1 - 2019/4/1
N2 - Lattice trapdoors are an important primitive used in a wide range of cryptographic protocols, such as identity-based encryption (IBE), attribute-based encryption, functional encryption, and program obfuscation. In this paper, we present software implementations of the Gentry-Peikert-Vaikuntanathan (GPV) digital signature, IBE and ciphertext-policy attribute-based encryption (CP-ABE) schemes based on an efficient Gaussian sampling algorithm for trapdoor lattices, and demonstrate that these three important cryptographic protocols are practical. One important aspect of our implementation is that it supports prime moduli, which are required in many cryptographic schemes. Also, our implementation uses bases larger than two for the gadget matrix whereas most previous implementations use the binary base. We show that the use of higher bases significantly decreases execution times and storage requirements. We adapt IBE and CP-ABE schemes originally based on learning with errors (LWE) hardness assumptions to a more efficient Ring LWE (RLWE) construction. To the best of our knowledge, ours are the first implementations employing the Gaussian sampling for non-binary bases of the gadget matrix. The experimental results demonstrate that our lattice-based signature, IBE and CP-ABE implementations, which are based on standard assumptions with post-quantum security, provide a performance comparable to the recent state-of-The-Art implementation works based on stronger/non-post-quantum assumptions.
AB - Lattice trapdoors are an important primitive used in a wide range of cryptographic protocols, such as identity-based encryption (IBE), attribute-based encryption, functional encryption, and program obfuscation. In this paper, we present software implementations of the Gentry-Peikert-Vaikuntanathan (GPV) digital signature, IBE and ciphertext-policy attribute-based encryption (CP-ABE) schemes based on an efficient Gaussian sampling algorithm for trapdoor lattices, and demonstrate that these three important cryptographic protocols are practical. One important aspect of our implementation is that it supports prime moduli, which are required in many cryptographic schemes. Also, our implementation uses bases larger than two for the gadget matrix whereas most previous implementations use the binary base. We show that the use of higher bases significantly decreases execution times and storage requirements. We adapt IBE and CP-ABE schemes originally based on learning with errors (LWE) hardness assumptions to a more efficient Ring LWE (RLWE) construction. To the best of our knowledge, ours are the first implementations employing the Gaussian sampling for non-binary bases of the gadget matrix. The experimental results demonstrate that our lattice-based signature, IBE and CP-ABE implementations, which are based on standard assumptions with post-quantum security, provide a performance comparable to the recent state-of-The-Art implementation works based on stronger/non-post-quantum assumptions.
KW - GPV digital signature
KW - Gaussian sampler
KW - Lattice-based cryptography
KW - RLWE
KW - attribute-based encryption
KW - identity-based encryption
UR - http://www.scopus.com/inward/record.url?scp=85055040169&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85055040169&partnerID=8YFLogxK
U2 - 10.1109/TC.2018.2874479
DO - 10.1109/TC.2018.2874479
M3 - Article
AN - SCOPUS:85055040169
SN - 0018-9340
VL - 68
SP - 570
EP - 584
JO - IEEE Transactions on Computers
JF - IEEE Transactions on Computers
IS - 4
M1 - 8493319
ER -