Abstract
Searchable encryption, which allows one to search over encrypted data, has recently become an important research direction in cryptography. According to the key generation algorithm, searchable encryption can be divided into two categories, which are referred to as secret-key setting and public-key setting. Among them, searchable public-key encryption is of particular interest since it has found numerous practical applications, such as cloud storage and outsourced computing. In this work, we propose two searchable public-key encryption schemes from lattice. One is probabilistic, while the other is deterministic. Both of them are proven secure in the random oracle model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of High Performance Systems Architecture
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
