.png){kind=icon}
返回
Non-interactive verifiable LWE-based multi secret sharing scheme
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-022-13347-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The learning with errors (LWE) problem has emerged as the most popular hard problem for constructing lattice based cryptographic solutions. In this paper, we propose a verifiable multi secret sharing scheme based on LWE problem and prove the security of our scheme in the standard model. It is a threshold scheme and every t participants (t <= n) can recover multiple secrets, in one stage. Moreover, it has a non-interactive verification and no extra communication is needed among participants and the dealer in the verification phase. In short, it is the first LWE based threshold multi secret sharing scheme that has formal security in the standard model.
Keyword:
Threshold secret sharing scheme
Lattice-based cryptography
Learning with errors
Multi secret sharing
Non-interactive verifiable
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
暂无机构信息
引用论文
Lattice based signature with outsourced revocation for Multimedia Social Networks in cloud computing
PREAI
分享收藏An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different Stages一种不同阶段的高效可验证门限多秘密共享方案.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏Efficient NTRU Lattice-Based Certificateless Signature Scheme for Medical Cyber-Physical Systems
PREAI
分享收藏
查看更多内容