Lattice-based certificateless encryption scheme

DOI10.1007/S11704-014-3187-6MaRDI QIDQ1633051zbMATH OpenOpenAlexWikidataFDO

Authors Mingming Jiang, Hao Lei, Baocang Wang, Qiqi Lai, Yupu Hu

Publication date 19 December 2018

Published in Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11704-014-3187-6

zbMATH Keywords

certificateless encryptionidentitybased encryption (IBE)lattice-based cryptographyLWEpost-quantum cryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient certificateless encryption schemes from lattices
• A lattice-based certificateless public key encryption with equality test in standard model
• A new certificateless public key encryption scheme
• Cryptanalysis and improvement of a certificateless encryption scheme in the standard model
• Certificateless public key encryption scheme with hybrid problems and its application to Internet of things

Cites work

• A Group Signature Scheme from Lattice Assumptions
• Better key sizes (and attacks) for LWE-based encryption
• Bonsai trees, or how to delegate a lattice basis
• Certificateless Encryption Schemes Strongly Secure in the Standard Model
• Certificateless public key cryptography
• Computational Science and Its Applications – ICCSA 2004
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Efficient lattice (H)IBE in the standard model
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption using ideal lattices
• General and Efficient Certificateless Public Key Encryption Constructions
• Generating shorter bases for hard random lattices
• Information Security
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Lattice signatures without trapdoors
• Lattice-based blind signatures
• Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
• Making NTRU as secure as worst-case problems over ideal lattices
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Public Key Cryptography - PKC 2005
• Public Key Cryptography - PKC 2006
• Public-key cryptosystems from the worst-case shortest vector problem
• Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
• Toward basing fully homomorphic encryption on worst-case hardness
• Trapdoors for hard lattices and new cryptographic constructions
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(2)

• A lattice-based certificateless public key encryption with equality test in standard model
• Efficient certificateless encryption schemes from lattices

This page was built for publication: Lattice-based certificateless encryption scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633051)