A Publicly Verifiable Leveled Fully Homomorphic Signcryption Scheme
With the deepening of research, how to construct a fully homomorphic signcryption scheme based on standard assumptions is a problem that we need to solve. For this question, recently, Jin et al. proposed a leveled fully homomorphic signcryption scheme from standard lattices. However, when verifying,...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-IET
2023-01-01
|
| Series: | IET Information Security |
| Online Access: | http://dx.doi.org/10.1049/2023/1377042 |