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.展开更多
针对现有用户协作算法存在共谋攻击、背景知识攻击以及用户协作意愿等问题,基于可验证秘密共享与智能合约提出了一种用户协作隐私保护算法(privacy protection algorithm based on verifiable secret sharing and smart contracts,VSS-S...针对现有用户协作算法存在共谋攻击、背景知识攻击以及用户协作意愿等问题,基于可验证秘密共享与智能合约提出了一种用户协作隐私保护算法(privacy protection algorithm based on verifiable secret sharing and smart contracts,VSS-SCPPA)。该算法首先利用可验证秘密共享算法对用户查询信息进行加密和分裂,并提供系数承诺以验证子秘密数据的完整性。其次,结合智能合约与差分隐私技术设计了一种用户选择算法,构建匿名集。对该算法在抵御串通攻击方面的有效性进行了分析。通过在Geolife与BerlinMOD数据集上的实验,结果显示VSS-SCPPA的隐私保护性更高。与Tr-privacy、Ik-anonymity和GCS相比,VSS-SCPPA的效率分别提高了约86.34%、99.27%和99.19%。VSS-SCPPA在提高隐私保护性的同时显著提升了算法效率,证明了其在用户协作隐私保护中的有效性。展开更多
随着应用场景的多样化和私有数据共享规模的扩大,多方隐私集合交集计算(private set intersection,PSI)成为协同数据处理中的一个研究热点。然而,现有的多方PSI协议大多存在着参与方之间开销不平衡的问题,这不仅影响参与方之间的公平性...随着应用场景的多样化和私有数据共享规模的扩大,多方隐私集合交集计算(private set intersection,PSI)成为协同数据处理中的一个研究热点。然而,现有的多方PSI协议大多存在着参与方之间开销不平衡的问题,这不仅影响参与方之间的公平性,还影响协议的总体效率。针对该问题,基于不经意键值存储和秘密分享技术,提出了一个高效、平衡的多方PSI协议(EBMPSI)。该协议具备面向所有半诚实敌手的安全性,且可抵抗多个参与方的合谋攻击。理论和实验分析表明,EBMPSI协议有效地平衡了各个参与方之间的计算和通信开销。与现有方案的实验对比表明,EBMPSI协议在资源分布均匀的环境中展现出更高的执行效率。展开更多
基金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.
文摘针对现有用户协作算法存在共谋攻击、背景知识攻击以及用户协作意愿等问题,基于可验证秘密共享与智能合约提出了一种用户协作隐私保护算法(privacy protection algorithm based on verifiable secret sharing and smart contracts,VSS-SCPPA)。该算法首先利用可验证秘密共享算法对用户查询信息进行加密和分裂,并提供系数承诺以验证子秘密数据的完整性。其次,结合智能合约与差分隐私技术设计了一种用户选择算法,构建匿名集。对该算法在抵御串通攻击方面的有效性进行了分析。通过在Geolife与BerlinMOD数据集上的实验,结果显示VSS-SCPPA的隐私保护性更高。与Tr-privacy、Ik-anonymity和GCS相比,VSS-SCPPA的效率分别提高了约86.34%、99.27%和99.19%。VSS-SCPPA在提高隐私保护性的同时显著提升了算法效率,证明了其在用户协作隐私保护中的有效性。
文摘随着应用场景的多样化和私有数据共享规模的扩大,多方隐私集合交集计算(private set intersection,PSI)成为协同数据处理中的一个研究热点。然而,现有的多方PSI协议大多存在着参与方之间开销不平衡的问题,这不仅影响参与方之间的公平性,还影响协议的总体效率。针对该问题,基于不经意键值存储和秘密分享技术,提出了一个高效、平衡的多方PSI协议(EBMPSI)。该协议具备面向所有半诚实敌手的安全性,且可抵抗多个参与方的合谋攻击。理论和实验分析表明,EBMPSI协议有效地平衡了各个参与方之间的计算和通信开销。与现有方案的实验对比表明,EBMPSI协议在资源分布均匀的环境中展现出更高的执行效率。
