期刊文献+

基于ECC的有消息关联的可验证的(t,n)门限签密方案 被引量:1

Authenticated (t, n) threshold signature encryption scheme with message linkage based on ECC
下载PDF
导出
摘要 提出了一种新的有消息关联的可验证的门限签密方案,其中分工签密技术的应用大大降低了签密者的负担。把消息分成若干可读的消息子块,组内任意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
  • 相关文献

参考文献11

二级参考文献43

  • 1[1]Koblitz N.Elliptic Curve Cryprosystems. Mathematics of Computation, 1987, 48:203-209
  • 2[2]Miller V S.Use of Elliptic Curves in Cryptography. Advances in Cryptology-CRYPTO'85, New York: Spring-Verlag, 1986, LNCS 218:417-426
  • 3[3]Robshaw M,Yin Y.Elliptic Curve Cryptosystems. An RSA Laboratories Technical Note, 1997-06
  • 4[4]IEEE P1363/D13(Draft Version 13). Standard Specifications for Public Key Cryptography. http://grouper. ieee.org/p 1363,1999
  • 5[5]Shamir A.How to Share a Secret. Communications of the ACM, 1979, 24(1 1): 612-613
  • 6[6]Blakley G R.Safeguarding Cryptographic Keys. Proceedings of the National Computer Conference,American Federation of Information Processing Societies, 1979, 48:313-317
  • 7[7]Pollard J M.Monte Carlo Methods for Index Computation(mod p).Mathematics of Computation, 1978, 32:918-924
  • 8[8]Pohlig S C,Hllman M E.An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance. IEEE Transactions on Information Theory, 1978, 24:106-110
  • 9[9]Menezes A L,Okamoto T,Vanstone S A.Reducing Elliptic Curves Logarithms in a Finite Field. IEEE Transactions on Information Theory, 1993, 39(5): 1639-1646
  • 10[10]Smart N P.The Discrete Logarithm Problem of Elliptic Curves of Trace One. H P Laboratories Bristol, HPL-97-128, 1997

共引文献40

同被引文献9

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部