Paper 2024/919

Multi-Input Functional Encryption for Unbounded Inner Products

Bishnu Charan Behera, Indian Institute of Technology Kharagpur
Somindu C. Ramanna, Indian Institute of Technology Kharagpur
Abstract

In this work, we propose a construction for $ Multi~Input~Inner ~Product ~Encryption$ (MIPFE) that can handle vectors of variable length in different encryption slots. This construction is the first of its kind, as all existing MIPFE schemes allow only equal length vectors. The scheme is constructed in the private key setting, providing privacy for both message as well as the function, thereby achieving the so-called $full-hiding$ security. Our MIPFE scheme uses bilinear groups of prime order and achieves security under well studied cryptographic assumptions, namely, the symmetric external Diffie-Hellman assumption.

Note: This article is published in the 17th International Conference on Provable Security, ProvSec 2023, Wuhan, China

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Minor revision. 17th International Conference on Provable and Practical Security, ProvSec 2023
DOI
10.1007/978-3-031-45513-1_15
Keywords
Functional encryption (FE)inner-product FEmulti- input FEunbounded vectors
Contact author(s)
bishnu_charan_behera @ iitkgp ac in
somindu @ cse iitkgp ac in
History
2024-06-10: approved
2024-06-09: received
See all versions
Short URL
https://ia.cr/2024/919
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/919,
      author = {Bishnu Charan Behera and Somindu C. Ramanna},
      title = {Multi-Input Functional Encryption for Unbounded Inner Products},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/919},
      year = {2024},
      doi = {10.1007/978-3-031-45513-1_15},
      url = {https://eprint.iacr.org/2024/919}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.