A novel model for lattice-based authorized searchable encryption with special keyword
type: Item
instance of: scholarly article
title: A novel model for lattice-based authorized searchable encryption with special keyword
zbMATH Open document ID: 1394.68134
DOI: 10.1155/2015/314621
author: Fugeng Zeng
author: Chunxiang Xu
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: Data stored in the cloud servers, keyword search, and access controls are two important capabilities which should be supported. Public-keyword encryption with keyword search (PEKS) and attribute based encryption (ABE) are corresponding solutions. Meanwhile, as we step into postquantum era, pairing related assumption is fragile. Lattice is an ideal choice for building secure encryption scheme against quantum attack. Based on this, we propose the first mathematical model for lattice-based authorized searchable encryption. Data owners can sort the ciphertext by specific keywords such as time; data users satisfying the access control hand the trapdoor generated with the keyword to the cloud sever; the cloud sever sends back the corresponding ciphertext. The security of our schemes is based on the worst-case hardness on lattices, called learning with errors (LWE) assumption. In addition, our scheme achieves attribute-hiding, which could protect the sensitive information of data user.
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6926041
Wikidata QID: Q59117973
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/314621
OpenAlex ID: W1536707697
cites work: Fuzzy Identity-Based Encryption
cites work: Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
cites work: A Ciphertext Policy Attribute-Based Encryption Scheme without Pairings
cites work: Attribute-Based Functional Encryption on Lattices
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
cites work: Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
cites work: Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
cites work: Generating Shorter Bases for Hard Random Lattices
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: On lattices, learning with errors, random linear codes, and cryptography
Recommended article: Public-key authenticated encryption with keyword search revisited: security model and constructions
Recommended article: Attribute-based encryption with expressive and authorized keyword search
Recommended article: Improved security model for public-key authenticated encryption with keyword search
Recommended article: Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices
Recommended article: Public key authenticated encryption with keyword search from LWE
Recommended article: A New General Framework for Secure Public Key Encryption with Keyword Search
Recommended article: Public key encryption with hierarchical authorized keyword search
Recommended article: An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks
description: scientific article; zbMATH DE number 6926041