Authors:
Francesco Buccafurri
1
;
Gianluca Lax
1
;
Rajeev Anand Sahu
2
and
Vishal Saraswat
2
Affiliations:
1
University of Reggio Calabria, Italy
;
2
C.R.Rao Advanced Institute of Mathematics Statistics and Computer Science, India
Keyword(s):
PKE+PEKS, Searchable Encryption, Perfect Keyword Privacy, Asymmetric Pairings (Type 3), Provable Security, Standard Model, SXDH, E-governance, Privacy in the Cloud.
Related
Ontology
Subjects/Areas/Topics:
Applied Cryptography
;
Cryptographic Techniques and Key Management
;
Data Engineering
;
Database Security and Privacy
;
Databases and Data Security
;
Information and Systems Security
;
Security and Privacy in the Cloud
;
Security in Information Systems
;
Security Protocols
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 integ
rated PKE+PEKS schemes and provide a relative analysis
of its efficiency.
(More)