期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

密钥共享体制与安全多方计算 被引量：4

Secret Sharing Schemes and Secure Multi-party Computation
下载PDF
导出
摘要 本文通过对密钥共享体制安全性的完整刻画,讲述了完美的、统计的和计算的三大类密钥共享体制的统一定义。进而,分析了具有乘性的线性密钥共享体制为何和如何用于安全多方计算,同时较详细地分析了安全多方计算的安全性含义。 In the paper, through a complete description of secret sharing schemes, we give definitions respectively for perfect secret sharing schemes, statistical secret sharing schemes and computational secret sharing schemes in an uniform way. Furthermore, we analyze why and how mulfiphcative linear secret sharing schemes are used in secure multi-party computation protocols, and explain the security of secure multi-party computation in detail.
作者 刘木兰
机构地区 中国科学院数学与系统科学研究院信息安全中心
出处 《北京电子科技学院学报》 2006年第4期1-8,共8页 Journal of Beijing Electronic Science And Technology Institute
基金 国家自然科学基金(90304012) 973项目(2004CB318000)
关键词 密钥共享体制 安全多方计算 secret sharing schemes secure multi-party computation
分类号 TN918.1 [电子电信—通信与信息系统]
  • 相关文献

参考文献20

  • 1[1]Shamir.How to share a secret[J].Communications of the ACM,1979,22:612-613.
  • 2[2]G.R.Blakley.Safeguarding cryptographic keys[A].the 1979 AFIPS National Computer Conference[C].1979,48:313-317.
  • 3[3]M.Ito,A.Saito and T.Nishizeki.Secret sharing schemes realizing general access structure[A].Proc.of the IEEE Global Telecommunication Conf.,Globecom 87[C].1987,99-102.
  • 4[4]A.Beimel.Secure Schemes for Secret Sharing and Key Distribution[D].PhD thesis,Technion -Israel Institute of Techonlogy,1996.
  • 5Liang-liangXiao,Mu-lanLiu.Linear Secret Sharing Schemes and Rearrangements of Access Structures[J].Acta Mathematicae Applicatae Sinica,2004,20(4):685-694. 被引量：5
  • 6[6]Zhifang Zhang,Mulan Liu,Liangliang Xiao.Rearrangements of access structures and their realizations in secret sharing schemes,to appear in Discrete Mathematics.
  • 7[7]J.Cohen Benaloh.Secret sharing homomorphisms:keeping shares of a secret secret[A].In Advances in Cryptology-CRYPTO' 86.
  • 8[8]R.Cramer,S.Fehr.Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups[A].Crypto 2002[C],LNCS 2442,pp.272-287.
  • 9[9]Ivan Damgard,Rune Thorbek.Linear integer secret sharing and distributed exponentiation[A].PKC2006[C],LNCS 3985,pp.75-90.
  • 10[10]R.Cramer,S.Fehr,Y.Ishai,etc.Efficient multi-party computation over rings[A].EUROCRYPT'03[C],LNCS 3027,2003:578-595.

二级参考文献5

  • 1Beimel, A. Secure schemes for secret sharing and key distribution. PhD thesis, Technion - Israel Institute of Techonlogy, 1996
  • 2Blackley, G.R. Safeguarding cryptographic keys. In R. E. Merwin, J.T. Zanca, and M. Smith, editors,In: Proc. of the 1979 AFIPS National Computer Conference, Vol.48 of AFIPS Conference proceedings,313-317. AFIPS Press, 1979
  • 3Ito, M., Saito, A., Nishizeki, T. Secret sharing schemes realizing general access structure. In: Proc. of the IEEE Global Telecommunication Conf., Globecom 87, 99-102, 1987 Journal version: Multiple Assignment Scheme for Sharing Secret. J. of Cryptology, 6(1): 15-20 1993
  • 4Shamir, A. How to share a secret. Communications of the ACM, 22:612-613 (1979)
  • 5Simmons, G.J. Contemporary Cryptology - The Science of Information Integrity, 1992

共引文献4

同被引文献25

引证文献4

二级引证文献1

北京电子科技学院学报
2006年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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