对偶单调张成方案的有效构造

EFFICIENT CONSTRUCTION OF DUAL MONOTONE SPAN PROGRAMS

导出

摘要由线性码和线性秘密分享体制的对应关系,利用线性码的对偶码,分别从单秘密分享和多秘密分享两个方面给出对偶单调张成方案的有效构造.作为一个应用,可以得到线性多秘密分享的乘性构造. This paper is concerned with an efficient construction of monotone span programs,from single secret and multisecret espectively,by using the connection of linear codes and linear secret sharing schemes.As an application,a general multiplicative construction of linear multisecret sharing schemes is proposed.

作者高莹

机构地区北京航空航天大学数学与系统科学学院

出处《系统科学与数学》 CSCD 北大核心 2011年第4期466-474,共9页 Journal of Systems Science and Mathematical Sciences

基金 973项目资助(2007CB807901) 中央高校基本科研业务费专项资金(YWF-10-02-072,YWF-10-01-A28)资助课题

关键词线性码线性秘密分享体制单调张成方案对偶码对偶单调张成方案 Linear codes linear secret sharing schemes monotone span program dual codes dual monotone span program

分类号 TN918.1 [电子电信—通信与信息系统]

引文网络
相关文献

参考文献14

1Shamir A. How to share a secret. Commun. ACM, 1979, 22: 612-213.
2Blakley G R. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference 48, 1979.
3Yao A. C. Protocols for secure computations. Proceedings of FOCS'82, Chicago, 1982.
4Cramer R, Damgard I, and Maurer U. General secure multi-party computation from any linear secret-sharing scheme. Proc. of EUROCRYPT'00, LNCS 1807, 316-334, 2000.
5Fehr S. Efficient construction of the dual span program. ETH Zurich (May 1999), http://homepages. cwi.nl/fehr/mypapers/Feh99.pdf.
6Nikov V, Nikova S, and Preneel B. On the size of monotone span programs. 4th Conference on Security in Communication Networks ( SCN), Amalfi, Italy, 2004, 3352: 252-265.
7Crescenzo G D. Sharing one secret vs. sharing many secrets. Theoretical Computer Science, 2003, 295: 123-140.
8Simmons G J, Jackson W, and Martin K. The geometry of shared secret schemes. Bulletin of the Institute of Combinatorics and Its Applications, 1991, (1): 71-88.
9Beimel A. Secure schemes for secret sharing and key distribution. Ph.D.thesis, Techniorr Israel Institute of Technology, 1996.
10Massey J L. Minimal codewords and secret sharing. 6th Joint Swedish-Russian Workshop On Information Theory, 1993.

1赵玉娟.秘密分享方案的一般结构[J].科技信息,2011(11).
2刘木兰,肖亮亮,张志芳.一类基于图上随机游动的密钥共享体制[J].中国科学（E辑）,2007,37(2):199-208. 被引量：3
3吴振寰,Gao,Ying,Wu,Zhehui.Set (k, n)-Exactly covering problem[J].High Technology Letters,2010,16(4):433-436.
4刁大生,张成杰,张永生,郭光灿.Class of Unlockable Bound Entangled States and Their Applications[J].Chinese Physics Letters,2008,25(7):2366-2369.
5张英俏,金星日,张寿.Secret sharing of quantum information via entanglement swapping[J].Chinese Physics B,2006,15(10):2252-2255. 被引量：3
6郑仕标.Teleportation of Quantum States through Mixed Entangled Pairs[J].Chinese Physics Letters,2006,23(9):2356-2359.
7Selda Calkavur.A New Method to Construct Secret Sharing Schemes Based on Linear Codes[J].Computer Technology and Application,2015,6(2):89-94.
8王国俊.数论在密码学中的应用[J].工程数学学报,2002,19(1):14-20. 被引量：3
9Selda Calkavur.Secret Sharing Schemes Based on the Dual Code of the Code of a Symmetric （v, k, λ）-Design and Minimal Access Sets[J].Computer Technology and Application,2015,6(2):95-100.
10任鸿秋.测量塌缩问题在信息秘密共享中的应用[J].山西大学学报（自然科学版）,2009,32(1):53-55.

系统科学与数学

2011年第4期

浏览历史

内容加载中请稍等...

对偶单调张成方案的有效构造

参考文献14

相关作者

相关机构

相关主题

浏览历史