Leveled Fully Homomorphic Signcryption From Lattices

Abstract

With the continuous and rapid development of Cloud Computing, Big Data and Internet of Things, it is extremely critical to protect data with homomorphism, privacy and integrity. For this, Rezaeibagha et al. proposed a new cryptographic primitive, called homomorphic signcryption. However, the current homomorphic signcryption schemes either only support linear computation or are built on nonstandard assumption. Therefore, it is interesting to design a leveled fully homomorphic signcryption (FHSC) scheme from the standard assumption. In this work, we present a leveled FHSC scheme from lattices. For this, we exert classical sign-then-encrypt method and surmount the difficulty of homomorphic multiplicative evaluation in the way of encrypting every elements. Moreover, we prove its indistinguishability against chosen plaintext attacks (IND-CPA) and strong unforgeability (SUF) under hard problems of standard lattices.INDEX TERMS Fully homomorphic signcryption, learning with errors, short integer solution.

A Lightweight Identity-Based Network Coding Scheme for Internet of Medical Things

“…In addition, we compare the performance differences between different schemes in the combined phase. We choose the combined scheme of Jin's [62] and Li's [63] and compare the time cost. Let us assume that the number of packet-tag pairs is 50.…”

A Publicly Verifiable Leveled Fully Homomorphic Signcryption Scheme

“…Furthermore, Li et al [12] constructed two leveled fully homomorphic signcryption (FHSC) schemes under nonstandard assumptions as they used indistinguishable obfusion, zero knowledge proof, and multiple input function encryption. Recently, Jin et al [13] proposed a leveled FHSC schemes based on lattices. However, it cannot be publicly verified, as it needs to decrypt the ciphertext first and then verify, which resulting in the waste of resources.…”