Abstract
AbstractMany identity-based encryption schemes under the \(k\)-LIN assumption contain \(2k+1\) group elements in the ciphertext overhead and private keys. In this paper, We push the limit further by constructing an IBE scheme under the \(k\)-LIN assumption with \(2k\) group elements in the ciphertext overhead and private keys. Our technique additionally expands to the scheme of Boneh, Raghunathan, and Segev (CRYPTO 2013) to yield more efficient function-private IBE under the DLIN assumption. The shortened size inherently leads to less exponentiations and pairings in encryption and decryption, and hence yielding schemes with better computational efficiency under \(k\)-LIN.KeywordsIdentity-based encryption \(k\)-LIN assumptionFunction privacy
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.
