Abstract
Abstract The security and utilization of cloud storage are well-known open issues. Public key encryption with keyword search (PEKS) provides an important primitive to discuss applications in the field of cloud storage, where the receiver can use the trapdoor of the keyword to search. However, the internal attack derived by the cloud server is an inherent issue of PEKS. There are two breakthroughs, so-called authenticated PEKS (APKES) and witness-based searchable encryption (WBSE), to tackle this issue by modifying framework of PEKS. The existing schemes of APEKS and WBSE can offer security against the internal attacks, but they require the trapdoor size is proportional to c n where n is the total number of senders, and c is the constant size of the ciphertext or proportion to the security parameter. In this paper, we propose a new WBSE scheme with constant overhead as long as n is bounded. We analyze the security of our scheme based on homomorphic encryption and digital signature. Finally, we provide implementations to show the effectiveness on the cloud-edge 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 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.
