摘要
提出了一种新的有消息关联的可验证的门限签密方案,其中分工签密技术的应用大大降低了签密者的负担。把消息分成若干可读的消息子块,组内任意t个签密者都可以代表整个组对消息签密。每个签密者只需对自己的消息子块操作即可,因此,其工作量大大减少,而签密速度却明显提高。
A new （t, n） threshold-authenticated encryption scheme with message linkage is proposed. The proposed scheme is based on the ECC （elliptic curve cryptosystem）. The total message is divided into a few readable submessage blocks. Any random t signer can sign the message on behalf of the whole group. Each signer needs to sign the designated sub-message block rather than the whole message. Compared with other scheme, the workload is reduced and performance is improved.
出处
《华北电力大学学报（自然科学版）》
CAS
北大核心
2006年第5期77-80,共4页
Journal of North China Electric Power University：Natural Science Edition
关键词
门限签密
分工签密
ECC
threshold signaturv encryption
division of labor signature
ECC
