Due to the compromise of the security of the underlying system or machine stonng the key, exposure of the private key can be a devastating attack on a cryptosystem. Key insulation is an important technique to protect ...Due to the compromise of the security of the underlying system or machine stonng the key, exposure of the private key can be a devastating attack on a cryptosystem. Key insulation is an important technique to protect private keys. To deal with the private (signing) key exposure problem in identity-based signature systems, we propose an identity-based threshold key-insulated signature (IBTKIS) scheme. It strengthens the security and flexibility of existing identity-based key-insulated signature schemes. Our scheme' s security is proven in the random oracle model and rests on the hardness of the computational Diffie-Helhnan problem in groups equipped with a pairing. To the best of our knowledge, it is the first IBTKIS scheme up to now.展开更多
The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol compositio...The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol composition operation.In the paper,we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area.The proposed scheme is suitable for the mobile agents,which should migrate across different environment through network.Furthermore,we give the concrete analysis of the reduction to prove the security of the proposed scheme.展开更多
In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised...In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.展开更多
基金Supported by the National Natural Science Foundation of China (No. 60970111, 61133014, 60903189, 60903020).
文摘Due to the compromise of the security of the underlying system or machine stonng the key, exposure of the private key can be a devastating attack on a cryptosystem. Key insulation is an important technique to protect private keys. To deal with the private (signing) key exposure problem in identity-based signature systems, we propose an identity-based threshold key-insulated signature (IBTKIS) scheme. It strengthens the security and flexibility of existing identity-based key-insulated signature schemes. Our scheme' s security is proven in the random oracle model and rests on the hardness of the computational Diffie-Helhnan problem in groups equipped with a pairing. To the best of our knowledge, it is the first IBTKIS scheme up to now.
基金the National Natural Science Foundation of China(Nos.60703031,60703004)the National High Technology Research and Development Program(863)of China(No.2006AA01Z4220the National Basic Research Program(973)of China(No.2007CB311201)
文摘The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol composition operation.In the paper,we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area.The proposed scheme is suitable for the mobile agents,which should migrate across different environment through network.Furthermore,we give the concrete analysis of the reduction to prove the security of the proposed scheme.
基金Supported in part by an International Macquarie University Research Excellence Scholarship(i MQRES),Australian Research Council Grant DP0987734also supported by the National Basic Research Program of China(973 Program)under Grant No.2010CB923200+2 种基金the National Natural Science Foundation of China under No.61377067Fund of State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications,China,National Natural Science Foundation of China under Grant Nos.61202362,61262057,61472433China Postdoctora Science Foundation under Grant No.2013M542560
文摘In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.