A concept of secret sharing scheme with the function of assignment is proposed. It provides great capabilities for many practical applications. In this scheme, the dealer can randomly assign one or more than one parti...A concept of secret sharing scheme with the function of assignment is proposed. It provides great capabilities for many practical applications. In this scheme, the dealer can randomly assign one or more than one participant to get the secret at any time, but these participants can get nothing about the secret before that moment. At the same time, the other participants cannot get anything about the secret by stealing the secret value when it is transferred. However, if the dealer is lost, a certain number or more partidtmnts of them can reoonstruct the secret by ccoperating. In order to clear this concept, an illustrating scheme with geometry method and a practical scheme with algebra method is given.展开更多
A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none d...A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants＇ items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified （2,2） secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.展开更多
Because the intrinsic characteristics of mobile ad hoc networks（MANETs） cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of secu...Because the intrinsic characteristics of mobile ad hoc networks（MANETs） cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks（such as interception and physical destroy attacks）.Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.展开更多
To assure the shareholders can look for their ＂legal＂ attorneys to renew the secret, once the secret sharing scheme is initialized, a secret sharing scheme with inherited characteristic is constructed. In this schem...To assure the shareholders can look for their ＂legal＂ attorneys to renew the secret, once the secret sharing scheme is initialized, a secret sharing scheme with inherited characteristic is constructed. In this scheme, each shareholder can produce a new share by his algorithm, which is equivalent to the primary one. Together with other shares, the primary secret can be renewed. Since this scheme is constructed not by replacing the primary share with a new share produced by the dealer in his primitive secret sharing scheme, so no matter how much shares the shareholder produces, these shares can not be gathered together to renew the secret in this scheme. Compared with the existing secret sharing schemes, this scheme provides more agility for the shareholders by investing each of them a function but not affect its security.展开更多
The visual secret sharing scheme proposed by Naor and Shamir provides a way to encrypt a secret black-white image into shares. A qualified group of participants can recover the secret message without using any cryptog...The visual secret sharing scheme proposed by Naor and Shamir provides a way to encrypt a secret black-white image into shares. A qualified group of participants can recover the secret message without using any cryptographic computation. But the original scheme can easily be corrupted by malicious participant. We propose an extension of VSS(visual secret sharing) to identify cheaters before the secret is recovered. Without the need for any additional information and cryptographic computation, every participant can verify the validity of shares of other participants, thus the security of VSS is enhanced.展开更多
A new threshold secret sharing scheme is constructed by introducing the concept of share vector, in which the number of shareholders can be adjusted by randomly changing the weights of them. This kind of scheme overco...A new threshold secret sharing scheme is constructed by introducing the concept of share vector, in which the number of shareholders can be adjusted by randomly changing the weights of them. This kind of scheme overcomes the limitation of the static weighted secret sharing schemes that cannot change the weights in the process of carrying out and the deficiency of low efficiency of the ordinary dynamic weighted sharing schemes for its resending process. Thus, this scheme is more suitable to the case that the number of shareholders needs to be changed randomly during the scheme is carrying out.展开更多
This paper theoretically analyzes a deficiency of the existing scheme, and proposes a distributed multi-hop certification authority scheme for mobile Ad Hoc networks. In our design, we distribute the certification aut...This paper theoretically analyzes a deficiency of the existing scheme, and proposes a distributed multi-hop certification authority scheme for mobile Ad Hoc networks. In our design, we distribute the certification authority functions through a threshold secret sharing mechanism, in which each node holds a secret share and multiple nodes jointly provide complete services. Certification authority is not limited in a local neighborhood but can be completed within multi-hop location. In addition, we replace broadcast by multicast to improve system performance and reduce communication overhead. This paper resolves some technical problems of ubiquitous certification authority services, and presents a wieldy multi-hop certification authority algorithm. Simulation results confirm the availability and effectiveness of our design.展开更多
Protection of private key is the most critical part in public key infrastructure(PKI) system since it depends on the confidentiality of private key. Thread of password detection has been known as the vulnerability in ...Protection of private key is the most critical part in public key infrastructure(PKI) system since it depends on the confidentiality of private key. Thread of password detection has been known as the vulnerability in this PKI system. Recently, studies have been conducted on Bio PKI system that uses the biometric information of users in order to replace the password type of private key protection in PKI system. However, Bio PKI system also has vulnerability in that biometric information used for protection of private key cannot be reused once it is stolen or lost. So, we propose the method to protect the private key using FIDSEQi which binds sequence to biometric information. The proposed method enhances reusability of biometric information and presents higher attack complexity than the method of authentication by cross matching single biometric information.展开更多
基金This project was supported by Liuhui Applied Mathematics Center of Nankai University .
文摘A concept of secret sharing scheme with the function of assignment is proposed. It provides great capabilities for many practical applications. In this scheme, the dealer can randomly assign one or more than one participant to get the secret at any time, but these participants can get nothing about the secret before that moment. At the same time, the other participants cannot get anything about the secret by stealing the secret value when it is transferred. However, if the dealer is lost, a certain number or more partidtmnts of them can reoonstruct the secret by ccoperating. In order to clear this concept, an illustrating scheme with geometry method and a practical scheme with algebra method is given.
基金This project was partially supported by the National Natural Science Foundation of China (60273049, 90104005).
文摘A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants＇ items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified （2,2） secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.
基金supported by the National Basic Research Program of China(973 Program)(2011CB302903)the Key Program of Natural Science for Universities of Jiangsu Province(10KJA510035)+2 种基金the Science and Technology Innovation Group Foundation of Jiangsu Province ("Qing and Lan" Project)the Postgraduate Innovation Project Foundation of Jiangsu Province(CX10B 194ZCX09B 152Z)
文摘Because the intrinsic characteristics of mobile ad hoc networks（MANETs） cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks（such as interception and physical destroy attacks）.Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.
基金This project was supported by Young Teacher Foundation of North China Elec. Power Univ.(200521001)
文摘To assure the shareholders can look for their ＂legal＂ attorneys to renew the secret, once the secret sharing scheme is initialized, a secret sharing scheme with inherited characteristic is constructed. In this scheme, each shareholder can produce a new share by his algorithm, which is equivalent to the primary one. Together with other shares, the primary secret can be renewed. Since this scheme is constructed not by replacing the primary share with a new share produced by the dealer in his primitive secret sharing scheme, so no matter how much shares the shareholder produces, these shares can not be gathered together to renew the secret in this scheme. Compared with the existing secret sharing schemes, this scheme provides more agility for the shareholders by investing each of them a function but not affect its security.
文摘The visual secret sharing scheme proposed by Naor and Shamir provides a way to encrypt a secret black-white image into shares. A qualified group of participants can recover the secret message without using any cryptographic computation. But the original scheme can easily be corrupted by malicious participant. We propose an extension of VSS(visual secret sharing) to identify cheaters before the secret is recovered. Without the need for any additional information and cryptographic computation, every participant can verify the validity of shares of other participants, thus the security of VSS is enhanced.
基金supported by the National Preeminent Youth Foundation(70225002)the Doctor Foundation of North China Electric Power University(200822029).
文摘A new threshold secret sharing scheme is constructed by introducing the concept of share vector, in which the number of shareholders can be adjusted by randomly changing the weights of them. This kind of scheme overcomes the limitation of the static weighted secret sharing schemes that cannot change the weights in the process of carrying out and the deficiency of low efficiency of the ordinary dynamic weighted sharing schemes for its resending process. Thus, this scheme is more suitable to the case that the number of shareholders needs to be changed randomly during the scheme is carrying out.
文摘This paper theoretically analyzes a deficiency of the existing scheme, and proposes a distributed multi-hop certification authority scheme for mobile Ad Hoc networks. In our design, we distribute the certification authority functions through a threshold secret sharing mechanism, in which each node holds a secret share and multiple nodes jointly provide complete services. Certification authority is not limited in a local neighborhood but can be completed within multi-hop location. In addition, we replace broadcast by multicast to improve system performance and reduce communication overhead. This paper resolves some technical problems of ubiquitous certification authority services, and presents a wieldy multi-hop certification authority algorithm. Simulation results confirm the availability and effectiveness of our design.
基金supported by the Sharing and Diffusion of National R&D Outcome funded by the Korea Institute of Science and Technology Information
文摘Protection of private key is the most critical part in public key infrastructure(PKI) system since it depends on the confidentiality of private key. Thread of password detection has been known as the vulnerability in this PKI system. Recently, studies have been conducted on Bio PKI system that uses the biometric information of users in order to replace the password type of private key protection in PKI system. However, Bio PKI system also has vulnerability in that biometric information used for protection of private key cannot be reused once it is stolen or lost. So, we propose the method to protect the private key using FIDSEQi which binds sequence to biometric information. The proposed method enhances reusability of biometric information and presents higher attack complexity than the method of authentication by cross matching single biometric information.
