Based on the difficulty in computing discrete logarilhm and square 1001 onsome special conditions,we propose a basic threshold seeret sharing scheme for multiple secretswith multiple policies,which allows a group of u...Based on the difficulty in computing discrete logarilhm and square 1001 onsome special conditions,we propose a basic threshold seeret sharing scheme for multiple secretswith multiple policies,which allows a group of users to share multiple secrttkeys and only onesecret shadow to be ktpt by each user.An efficient threshold decryption scheme with multiplepolicies is designed on the basis of the basic threshold scheme.This decryption scheme allowsmultiple secret keys to he shared among a groupof users,and each user to ketp only one secretshadow.Different public keys can be used to encrypt documents.If and only if the number ofcooperated users who koop the secret shadows is greater than or c-qual to the threshold value of thecorresponding secret key,they can cooperate to decrypt the documents.It is proved that theproposed scheme has very strong security,unless the attackers can solve the discrete logarithmproblem and the square root problem.展开更多
A multiple multi-qubit quantum states sharing scheme is proposed,in which the dealer can share multiple multi-qubit quantum states among the participants through only one distribution and one recovery.The dealer encod...A multiple multi-qubit quantum states sharing scheme is proposed,in which the dealer can share multiple multi-qubit quantum states among the participants through only one distribution and one recovery.The dealer encodes the secret quantum states into a special entangled state,and then distributes the particles of the entangled state to the participants.The participants perform the single-particle measurements on their particles,and can cooperate to recover the multiple multi-qubit quantum states.Compared to the existing schemes,our scheme is more efficient and more flexible in practice.展开更多
基金the National Natural Sciencc F0un datiell Of China(90101005.90204011)the Natural Science Found dation of Hubei Province(2002AB0039).
文摘Based on the difficulty in computing discrete logarilhm and square 1001 onsome special conditions,we propose a basic threshold seeret sharing scheme for multiple secretswith multiple policies,which allows a group of users to share multiple secrttkeys and only onesecret shadow to be ktpt by each user.An efficient threshold decryption scheme with multiplepolicies is designed on the basis of the basic threshold scheme.This decryption scheme allowsmultiple secret keys to he shared among a groupof users,and each user to ketp only one secretshadow.Different public keys can be used to encrypt documents.If and only if the number ofcooperated users who koop the secret shadows is greater than or c-qual to the threshold value of thecorresponding secret key,they can cooperate to decrypt the documents.It is proved that theproposed scheme has very strong security,unless the attackers can solve the discrete logarithmproblem and the square root problem.
文摘A multiple multi-qubit quantum states sharing scheme is proposed,in which the dealer can share multiple multi-qubit quantum states among the participants through only one distribution and one recovery.The dealer encodes the secret quantum states into a special entangled state,and then distributes the particles of the entangled state to the participants.The participants perform the single-particle measurements on their particles,and can cooperate to recover the multiple multi-qubit quantum states.Compared to the existing schemes,our scheme is more efficient and more flexible in practice.
