Abstract
A learning with error problem based encryption scheme that allows secure searching over the cipher text is proposed. Both the generation of cipher text and the trapdoor of the query are based on the problem of learning with errors. By performing an operation over the trapdoor and the cipher text, it is able to tell if the cipher text is the encryption of a plaintext. The secure searchable encryption scheme is both cipher text and trapdoor indistinguishable. The probabilities of missing and failing match occurrence in searching are both exponentially small.
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 callDisclaimer: 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.
