Public key encryption with keyword search secure against keyword guessing attacks without random oracle
From MaRDI portal
Publication:497143
DOI10.1016/j.ins.2013.03.008zbMath1321.94057OpenAlexW2014022156WikidataQ122609837 ScholiaQ122609837MaRDI QIDQ497143
Willy Susilo, Chunpeng Ge, Li-Ming Fang, Jian-Dong Wang
Publication date: 23 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://ro.uow.edu.au/cgi/viewcontent.cgi?article=2088&context=eispapers
Related Items (15)
Public key encryption with distributed keyword search ⋮ Oblivious Keyword Search with Authorization ⋮ Security-enhanced public-key authenticated searchable encryption ⋮ Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation ⋮ Witness-based searchable encryption ⋮ A Generic Construction of Integrated Secure-Channel Free PEKS and PKE ⋮ Intrusion-resilient identity-based signatures: concrete scheme in the standard model and generic construction ⋮ Improved security model for public-key authenticated encryption with keyword search ⋮ Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage ⋮ Efficient identity-based broadcast encryption with keyword search against insider attacks for database systems ⋮ On security against the server in designated tester public key encryption with keyword search ⋮ Identity-based encryption with outsourced equality test in cloud computing ⋮ An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks ⋮ An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment ⋮ Still wrong use of pairings in cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generic construction of designated tester public-key encryption with keyword search
- Proxy re-encryption with keyword search
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Decryptable Searchable Encryption
- On the Integration of Public Key Data Encryption and Public Key Encryption with Keyword Search
- Practical Identity-Based Encryption Without Random Oracles
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Efficient Public Key Encryption with Keyword Search Schemes from Pairings
- Universally Composable Adaptive Oblivious Transfer
- Applied Cryptography and Network Security
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Probability Inequalities for Sums of Bounded Random Variables
- Efficient Identity-Based Encryption Without Random Oracles
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- Generic Combination of Public Key Encryption with Keyword Search and Public Key Encryption
- Efficient Non-interactive Proof Systems for Bilinear Groups
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Efficient Pseudorandom Generators Based on the DDH Assumption
- Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
This page was built for publication: Public key encryption with keyword search secure against keyword guessing attacks without random oracle