Secret-sharing is a common method to protect important data, such as the private key of a public-key system. Dynamic Group Secret-sharing (DGS) is a system where all of the members in a group hold a subsecret of the k...Secret-sharing is a common method to protect important data, such as the private key of a public-key system. Dynamic Group Secret-sharing (DGS) is a system where all of the members in a group hold a subsecret of the key information and where the number of members in the group is variable. This kind of secret-sharing is broadly used in many special distribution systems, such as Self-secure Ad-hoc Network. Distributing this subsecret to a new member when he enters the group is the common method that ensures all the members participate in the same secret-sharing. However, no’atisfactory subsecret distribution scheme exists at present. This paper proposes a new protocol that tries to satisfy both security and efficiency.展开更多
A publicly verifiable secret sharing （PVSS） scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS pl...A publicly verifiable secret sharing （PVSS） scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryp- tographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-HeUman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.展开更多
文摘Secret-sharing is a common method to protect important data, such as the private key of a public-key system. Dynamic Group Secret-sharing (DGS) is a system where all of the members in a group hold a subsecret of the key information and where the number of members in the group is variable. This kind of secret-sharing is broadly used in many special distribution systems, such as Self-secure Ad-hoc Network. Distributing this subsecret to a new member when he enters the group is the common method that ensures all the members participate in the same secret-sharing. However, no’atisfactory subsecret distribution scheme exists at present. This paper proposes a new protocol that tries to satisfy both security and efficiency.
文摘A publicly verifiable secret sharing （PVSS） scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryp- tographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-HeUman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.
