Name
Abstract | ||
|---|---|---|
Public-key encryption with keyword search (PEKS) schemes are useful to delegate searching capabilities on encrypted data to a third party, who does not hold the entire secret key, but only an appropriate token which allows searching operations but preserves data privacy. We propose an efficient and practical integrated public-key encryption (PKE) and public-key encryption with keyword search (PEKS) scheme (PKE+PEKS) which we prove to be secure in the strongest security notion for PKE+PEKS schemes. In particular, we provide a unified security proof of its joint CCA-security in standard model. The security of our scheme relies on Symmetric eXternal Diffie-Hellman (SXDH) assumption which is a much simpler and more standard hardness assumption than the ones used in most of the comparable schemes. Ours is the first construction to use asymmetric pairings which enable an extremely fast implementation useful for practical applications. Finally we compare our scheme with other proposed integrated PKE+PEKS schemes and provide a relative analysis of its efficiency. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.5220/0005577104480453 | SECRYPT |
Keywords | Field | DocType |
PKE plus PEKS, Searchable Encryption, Perfect Keyword Privacy, Asymmetric Pairings (Type 3), Provable Security, Standard Model, SXDH, E-governance, Privacy in the Cloud | Delegate,Computer science,Computer security,Keyword search,Third party,Encryption,Information privacy,Security token,Provable security | Conference |
Volume | ISBN | Citations |
04 | 978-989-758-117-5 | 1 |
PageRank | References | Authors |
0.35 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesco Buccafurri | 1 | 998 | 95.97 |
| Gianluca Lax | 2 | 358 | 38.52 |
| Rajeev Anand Sahu | 3 | 13 | 6.02 |
| Vishal Saraswat | 4 | 18 | 6.14 |