The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Pairing-based Homomorphic Encryption Scheme for Multi-User Settings
Abstract
A new method is presented to privately outsource computation of different users. As a significant cryptographic primitive in cloud computing, homomorphic encryption (HE) can evaluate on ciphertext directly without decryption, thus avoid information leakage. However, most of the available HE schemes are single-user, which means that they could only evaluate on ciphertexts encrypted by the same public key. Adopting the idea of proxy re-encryption, and focusing on the compatibility of computation, the authors provide a pairing-based multi-user homomorphic encryption scheme. The scheme is a somewhat homomorphic one, which can do infinite additions and one multiplication operation. Security of the scheme is based on subgroup decision problem. The authors give a concrete security model and detailed security analysis.
Related Content
Preeti Mariam Mathews, Anjali Sandeep Gaikwad, Mathu Uthaman, B. Sreelekshmi, V. Dankan Gowda.
© 2024.
26 pages.
|
Dankan Gowda V., Joohi Garg, Shaifali Garg, K. D. V. Prasad, Sampathirao Suneetha.
© 2024.
20 pages.
|
K. Sriprasadh.
© 2024.
24 pages.
|
R. Valarmathi, R. Uma, P. Ramkumar, Srivatsan Venkatesh.
© 2024.
20 pages.
|
R. Jayashree, J. Venkata Subramanian.
© 2024.
14 pages.
|
M. Indira, K. S. Mohanasundaram, M. Saranya.
© 2024.
14 pages.
|
R. Thenmozhi, D. Vetriselvi, A. Arokiaraj Jovith.
© 2024.
26 pages.
|
|
|