The differences among the extended Canetti & Krawezyk 2007 model (ECK2007) and other four models, i.e., the Bellare & Rogaway (1993, 1995)models (BR93,BR95), the Bellare, Pointcheval & Rogaway (2000) model ...The differences among the extended Canetti & Krawezyk 2007 model (ECK2007) and other four models, i.e., the Bellare & Rogaway (1993, 1995)models (BR93,BR95), the Bellare, Pointcheval & Rogaway (2000) model (BPR2000) and the Canetti & Krawczyk (2001) model (CK2001) are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided.展开更多
Key agreement and identification protocols are much applicable among current protocols in cryptography. These protocols are used for a secure communication through an insecure channel in a network like Internet. Chall...Key agreement and identification protocols are much applicable among current protocols in cryptography. These protocols are used for a secure communication through an insecure channel in a network like Internet. Challenge-response identification protocol is an important identification method. In this paper, by making some slight changes in the public-key-based challenge-response identification protocol, we have introduced a new scheme in which the users in addition to authenticating each other can also agree on multiple keys. Then, this protocol's security from both aspects regarding the identification and key agreement will be analyzed. At the end, we will prove our scheme has a high security and efficiency in comparison with some famous and similar protocols.展开更多
A multi-party quantum secret sharing protocol using two entangled states, φ0〉 = 1/√2 (1+)n + 1-)n) and (φ1)1) =1/√2 (1+)n -1-〉n), is proposed and analyzed. In this protocol, without requiring to gen...A multi-party quantum secret sharing protocol using two entangled states, φ0〉 = 1/√2 (1+)n + 1-)n) and (φ1)1) =1/√2 (1+)n -1-〉n), is proposed and analyzed. In this protocol, without requiring to generate any photon or do any local unitary operation, an agent can obtain a shadow of the secret key by simply performing a measurement of single photon. Furthermore, the security of the protocol is analyzed. It shows that no agent can obtain the manager's secret without the help of the other agents, and any eavesdropper will be detected if he/she tries to steal the manager's secret under ideal or noisy quantum channels.展开更多
文摘The differences among the extended Canetti & Krawezyk 2007 model (ECK2007) and other four models, i.e., the Bellare & Rogaway (1993, 1995)models (BR93,BR95), the Bellare, Pointcheval & Rogaway (2000) model (BPR2000) and the Canetti & Krawczyk (2001) model (CK2001) are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided.
文摘Key agreement and identification protocols are much applicable among current protocols in cryptography. These protocols are used for a secure communication through an insecure channel in a network like Internet. Challenge-response identification protocol is an important identification method. In this paper, by making some slight changes in the public-key-based challenge-response identification protocol, we have introduced a new scheme in which the users in addition to authenticating each other can also agree on multiple keys. Then, this protocol's security from both aspects regarding the identification and key agreement will be analyzed. At the end, we will prove our scheme has a high security and efficiency in comparison with some famous and similar protocols.
基金supported by the National Science Council of the Republic of China,Taiwan,China (Grant No. NSC 98-2221-E-006-097-MY3)
文摘A multi-party quantum secret sharing protocol using two entangled states, φ0〉 = 1/√2 (1+)n + 1-)n) and (φ1)1) =1/√2 (1+)n -1-〉n), is proposed and analyzed. In this protocol, without requiring to generate any photon or do any local unitary operation, an agent can obtain a shadow of the secret key by simply performing a measurement of single photon. Furthermore, the security of the protocol is analyzed. It shows that no agent can obtain the manager's secret without the help of the other agents, and any eavesdropper will be detected if he/she tries to steal the manager's secret under ideal or noisy quantum channels.