A Publicly Verifiable Leveled Fully Homomorphic Signcryption Scheme

被引：0
|
作者：
Bian, Zhaoxuan [1 ,2 ]
Wang, Fuqun [1 ,2 ]
Zhang, Renjun [1 ,2 ]
Lian, Bin [3 ]
Han, Lidong [2 ]
Chen, Kefei [1 ,2 ]
机构：
[1] Hangzhou Normal Univ, Sch Math, Hangzhou 31121, Peoples R China
[2] Hangzhou Normal Univ, Key Lab Cryptog Zhejiang Prov, Hangzhou 31121, Peoples R China
[3] NingboTech Univ, Ningbo 315199, Zhejiang, Peoples R China
来源：
IET INFORMATION SECURITY | 2023年 / 2023卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Public verifiability - Publicly verifiable - Signcryption schemes - Standard assumptions - Waste of resources;
D O I：
10.1049/2023/1377042
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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, it is supposed to unsigncrypt first as they utilize sign-then-encrypt method. This leads to users being unable to verify the authenticity of the data first, which resulting in the waste of resources. This raises another question of how to construct an fully homomorphic signcryption (FHSC) scheme with public verifiability. To solve this problem, we propose a leveled fully homomorphic signcryption scheme that can be publicly verified and show its completeness, IND-CPA security, and strong unforgeability.
引用
收藏
页数：8
相关论文
共 50 条
  • [1] Leveled Fully Homomorphic Signcryption From Lattices
    Jin, Xiaodan
    Wang, Fuqun
    Zhang, Renjun
    Lian, Bin
    Chen, Kefei
    IEEE ACCESS, 2023, 11 : 35232 - 35242
  • [2] Improved publicly verifiable signcryption scheme using hash function
    Zhou, Huihua
    Yang, Muxiang
    Zheng, Minghui
    Cui, Guohua
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2008, 36 (12): : 1 - 4
  • [3] An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
    Sun, Xiaoqiang
    Zhang, Peng
    Yu, Jianping
    Xie, Weixin
    INFORMATION SECURITY PRACTICE AND EXPERIENCE, ISPEC 2017, 2017, 10701 : 835 - 846
  • [4] A New Efficient Publicly Verifiable Signcryption Scheme and its Multiple Recipients Variant
    Elkamchouchi, H. M.
    Nasr, M. E.
    Ismail, Roayat
    2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION, VOL I, PROCEEDINGS, 2008, : 904 - +
  • [5] A Verifiable Fully Homomorphic Encryption Scheme for Cloud Computing Security
    El-Yahyaoui, Ahmed
    Ech-Cherif El Kettani, Mohamed Dafir
    TECHNOLOGIES, 2019, 7 (01):
  • [6] A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
    Luo, Fucai
    Wang, Fuqun
    Wang, Kunpeng
    Chen, Kefei
    INFORMATION SCIENCES, 2019, 480 : 70 - 89
  • [7] A New Efficient Publicly Verifiable Signcryption Scheme and Its Multiple Recipients Variant for Firewalls Implementation
    Elkamchouchi, H. M.
    Nasr, M. E.
    Ismail, Roayat
    NRSC: 2009 NATIONAL RADIO SCIENCE CONFERENCE: NRSC 2009, VOLS 1 AND 2, 2009, : 511 - 519
  • [8] A (Leveled) Fully Homomorphic Encryption Scheme Based on Error-Free Approximate GCD
    Li, Xing
    Yu, Jianping
    Zhang, Peng
    Sun, Xiaoqiang
    PROCEEDINGS OF 2015 IEEE 5TH INTERNATIONAL CONFERENCE ON ELECTRONICS INFORMATION AND EMERGENCY COMMUNICATION, 2015, : 224 - 227
  • [9] Verifiable Decryption for Fully Homomorphic Encryption
    Luo, Fucai
    Wang, Kunpeng
    INFORMATION SECURITY (ISC 2018), 2018, 11060 : 347 - 365
  • [10] Publicly Verifiable Homomorphic Secret Sharing for Polynomial Evaluation
    Chen, Xin
    Zhang, Liang Feng
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2023, 18 : 4609 - 4624
12345