Welcome to the InfoSci Platform
Reference Hub1
A Pairing-based Homomorphic Encryption Scheme for Multi-User Settings

A Pairing-based Homomorphic Encryption Scheme for Multi-User Settings

Zhang Wei
Copyright: © 2020 |Pages: 11
ISBN13: 9781799817635|ISBN10: 1799817636|EISBN13: 9781799817642
DOI: 10.4018/978-1-7998-1763-5.ch017
Cite Chapter Cite Chapter

MLA

Wei, Zhang. "A Pairing-based Homomorphic Encryption Scheme for Multi-User Settings." Cryptography: Breakthroughs in Research and Practice, edited by Information Resources Management Association, IGI Global, 2020, pp. 295-305. https://doi.org/10.4018/978-1-7998-1763-5.ch017

APA

Wei, Z. (2020). A Pairing-based Homomorphic Encryption Scheme for Multi-User Settings. In I. Management Association (Ed.), Cryptography: Breakthroughs in Research and Practice (pp. 295-305). IGI Global. https://doi.org/10.4018/978-1-7998-1763-5.ch017

Chicago

Wei, Zhang. "A Pairing-based Homomorphic Encryption Scheme for Multi-User Settings." In Cryptography: Breakthroughs in Research and Practice, edited by Information Resources Management Association, 295-305. Hershey, PA: IGI Global, 2020. https://doi.org/10.4018/978-1-7998-1763-5.ch017

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.