A Practical Implementation of Identity-Based Encryption Over NTRU Lattices

@article{McCarthy2017API,
  title={A Practical Implementation of Identity-Based Encryption Over NTRU Lattices},
  author={Sarah McCarthy and Neil Smyth and Elizabeth O'Sullivan},
  journal={IACR Cryptol. ePrint Arch.},
  year={2017},
  volume={2017},
  pages={1049}
}
An identity-based encryption scheme enables the efficient distribution of keys in a multi-user system. Such schemes are particularly attractive in resource constrained environments where critical resources such as processing power, memory and bandwidth are severely limited. This research examines the first pragmatic lattice-based IBE scheme presented by Ducas, Lyubashevsky and Prest in 2014 and brings it into the realm of practicality for use on small devices. This is the first standalone ANSI… 
Lattice-Based Cryptoprocessor for CCA-Secure Identity-Based Encryption
TLDR
A lattice-based encryption scheme for Identity-Based Encryption (IBE) which is secure against Chosen-Ciphertext Attacks (CCA), and it is deduced from a previous Chosen-Plaintext Attack (CPA) secure IBE scheme by applying Fujisaki-Okamoto transform.
Practical Implementation of Ring-SIS/LWE Based Signature and IBE
TLDR
This paper mixes standard IBE scheme, a la ABB on Ring-SIS/LWE assumptions with the efficient trapdoor of Peikert and Micciancio (EUROCRYPT 2012) and provides an efficient implementation and describes and implements the underlying signature scheme, which is provably secure in the standard model and efficient.
A New Trapdoor over Module-NTRU Lattice and its Application to ID-based Encryption
TLDR
A trapdoor over MNTRU lattice brings more efficient IBE scheme than the previously best one of Ducas, Lyubashevsky and Prest, while providing the same security level.
Quantum-resistant Designated-ciphertext Searchable Encryption
TLDR
The notion of designated-ciphertext searchable encryption (DCSE) is introduced and a generic construction that employs an anonymous identity-based encryption and key encapsulation mechanism is proposed that satisfies the indistinguishability under chosen-keyword attack (IND-CKA) and indistinguishesability under insider keyword guessing attack (ind-IKGA) in the standard model.
Efficient Post-Quantum TLS Handshakes using Identity-Based Key Exchange from Lattices
TLDR
This work builds on the well-known lattice-based DLP-IBE scheme to construct an ID-based certificateless authenticated key exchange for post-quantum Transport Layer Security (TLS) handshakes, and shows that the ID- based handshake is 3.7 times more energy-efficient than the traditional certificate-based handshake.
Quantum-safe HIBE: does it cost a Latte?
TLDR
This paper provides the first complete C implementation and benchmarking of Latte, a promising HIBE scheme proposed by the United Kingdom The National Cyber Security Centre (NCSC) in 2017 and endorsed by European Telecommunications Standards Institute (ETSI).
Designated-ciphertext searchable encryption
A Random Oriented Identity Based Encryption Process
TLDR
In this work user id is represented in the form of integer along with Global parameter like n and the Master Private Key (MSK) be the Euler's totient function to support for necessary security at the user’s side without the necessity of CA, Certificates and Authentication to data transferred.
Efficient Parallel Implementation of Matrix Multiplication for Lattice-Based Cryptography on Modern ARM Processor
TLDR
This paper proposes an efficient parallel implementation of matrix multiplication and vector addition with matrix transpose using ARM NEON instructions on ARM Cortex-A platforms and achieves performance enhancements of 36.32% over previous state-of-the-art implementations.
Key Recovery from Gram-Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices
In this paper, we initiate the study of side-channel leakage in hash-and-sign lattice-based signatures, with particular emphasis on the two efficient implementations of the original GPV
...
...

References

SHOWING 1-10 OF 32 REFERENCES
Efficient Identity-Based Encryption over NTRU Lattices
TLDR
This work presents the first lattice-based IBE scheme with practical parameters and obtains digital signature schemes which are shorter than the previously most-compact ones of Ducas, Durmus, Lepoint, and Lyubashevsky from Crypto 2013.
Towards lightweight Identity-Based Encryption for the post-quantum-secure Internet of Things
  • T. Güneysu, Tobias Oder
  • Computer Science, Mathematics
    2017 18th International Symposium on Quality Electronic Design (ISQED)
  • 2017
TLDR
This work adopts the IBE scheme proposed by Ducas et al. at ASIACRYPT 2014 based on the RLWE problem and gives evidence that the implementations of the basic scheme are efficient, as for a security level of 80 bits it requires 103 ms and 36 ms for encryption and decryption, respectively, on the smallest ARM Cortex-M0 microcontroller.
The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
TLDR
This paper shows that by simultaneously considering the secrecy and authenticity requirements of an AKE, a scheme is constructed that is more secure and with smaller communication complexity than a scheme created by a generic combination of a KEM with a signature scheme.
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
TLDR
This work shows how to modify NTRUEncrypt to make it provably secure in the standard model, under the assumed quantum hardness of standard worst-case lattice problems, restricted to a family of lattices related to some cyclotomic fields.
A Homomorphic LWE Based E-voting Scheme
TLDR
The use of lattice-based primitives greatly simplifies the proofs of correctness, privacy and verifiability, as no zero-knowledge proof are needed to prove the validity of individual ballots or the correctness of the final election result.
Identity-Based Cryptosystems and Signature Schemes
  • A. Shamir
  • Computer Science, Mathematics
    CRYPTO
  • 1984
TLDR
A novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other’s signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party.
Lattice Signatures and Bimodal Gaussians
TLDR
A construction of a lattice-based digital signature scheme that represents an improvement over today’s most efficient lattice schemes and has shorter signature and public key sizes than all previously proposed lattice signature schemes.
Lattice Signatures Without Trapdoors
TLDR
This work provides an alternative method for constructing lattice-based digital signatures which does not use the "hash-and-sign" methodology, and shows that by slightly changing the parameters, one can get even more efficient signatures that are based on the hardness of the Learning With Errors problem.
Bi-Deniable Inner Product Encryption from LWE
TLDR
This work constructs a bi-deniable inner product encryption (IPE) in the multi-distributional model without relying on obfuscation as a black box, and involves new ways of manipulating Gaussian noise, which lead to a significantly tighter analysis of noise growth in Dual Regev type encryption schemes.
Compact Identity Based Encryption from LWE
TLDR
An identity-based encryption (IBE) scheme from the standard Learning with Errors (LWE) assumption that has compact public-key and achieves adaptive security in the standard model and can be adapted to construct a compact digital signature scheme.
...
...