A novel model for lattice-based authorized searchable encryption with special keyword
From MaRDI portal
Publication:1665334
DOI10.1155/2015/314621zbMath1394.68134OpenAlexW1536707697WikidataQ59117973 ScholiaQ59117973MaRDI QIDQ1665334
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/314621
Related Items (1)
Cites Work
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- A Ciphertext Policy Attribute-Based Encryption Scheme without Pairings
- Attribute-Based Functional Encryption on Lattices
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Generating Shorter Bases for Hard Random Lattices
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A novel model for lattice-based authorized searchable encryption with special keyword