verifiable multi-secret sharing schemes from homogeneous linear recursion

CORC > 软件研究所 > 软件所图书馆 > 2010软件所会议论文

	verifiable multi-secret sharing schemes from homogeneous linear recursion
	He Jun ; Li Lijuan ; Li Ximei ; Tang Chunming
	2010
会议名称	2nd International Conference on e-Business and Information System Security, EBISS2010
会议日期	43973
会议地点	Wuhan, China
关键词	Cryptography Electronic commerce Information systems
页码	370-373
英文摘要	The research on secure and efficient implementation method of secret sharing has been a hotspot in the field of information security and cryptography. Based on homogeneous linear recursion, we construct two new verifiable multi-secret sharing schemes. In our schemes, all participants themselves select their shares, so the calculation amount of dealer is reduced and secure channel between the dealer and any participant is avoided. Compared with other similar schemes, our schemes have more advantage, such as low calculation amount and no secure channel. In addition, security analysis also shows that our schemes can resist ordinary attacks. ©2010 IEEE.
收录类别	EI
会议主办者	Royal Institute of Technology; Huazhong University of Science and Technology; Research Association of Modern Education and Computer Science; Wuhan University; Harbin Institute of Technology
会议录	2010 2nd International Conference on E-Business and Information System Security, EBISS2010
会议录出版地	United States
语种	英语
ISBN号	9781420000000
内容类型	会议论文
源URL	[http://124.16.136.157/handle/311060/8962]
专题	软件研究所_软件所图书馆_2010软件所会议论文
推荐引用方式 GB/T 7714	He Jun,Li Lijuan,Li Ximei,et al. verifiable multi-secret sharing schemes from homogeneous linear recursion[C]. 见:2nd International Conference on e-Business and Information System Security, EBISS2010. Wuhan, China. 43973.