首页 | 本学科首页   官方微博 | 高级检索  
     检索      


An efficient multi-use multi-secret sharing scheme based on hash function
Authors:Angsuman Das  Avishek Adhikari
Institution:Department of Pure Mathematics, University of Calcutta, 35, Ballygunge Circular Road, Kolkata-700019, India
Abstract:In this work, a renewable, multi-use, multi-secret sharing scheme for general access structure based on the one-way collision resistant hash function is presented in which each participant has to carry only one share. As it applies the collision resistant one-way hash function, the proposed scheme is secure against conspiracy attacks even if the pseudo-secret shares are compromised. Moreover, high complexity operations like modular multiplication, exponentiation and inversion are avoided to increase its efficiency. Finally, in the proposed scheme, both the combiner and the participants can verify the correctness of the information exchanged among themselves.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号