A new scheme to verifiably redistribute a secret from the old to new shareholders without reconstruction of the secret is presented in this paper. The scheme allows redistribution between different access structures a...A new scheme to verifiably redistribute a secret from the old to new shareholders without reconstruction of the secret is presented in this paper. The scheme allows redistribution between different access structures and between different threshold schemes. A point worth mentioning is that this verifiable secret redistribution (VSR) scheme can identify dishonest old shareholders during redistribution without any assumption. A certain technique is adopted to verify the correctness of the old shares of the secret. As a result, the scheme is very efficient. It can be applied to proactive secret sharing (PSS) schemes to construct more flexible and practical proactive secret sharing schemes.展开更多
A new efficient forward secure signature scheme based on bilinear pairings is presented in this paper. Each complexity of key generation, key update, signing and verifying algorithms in this scheme is O(1) in terms of...A new efficient forward secure signature scheme based on bilinear pairings is presented in this paper. Each complexity of key generation, key update, signing and verifying algorithms in this scheme is O(1) in terms of the total number of time periods T. Because a new structure in node secret key storage and a unique strategy in key update are employed, the signing and verifying costs don’t grow when T increases. At the same time, the key generation and key update algorithms are efficiently constructed thanks to using the pre-order traversal technique of binary trees. Compared with other schemes based on bilinear pairings, the signature size in this scheme is very short, which doesn’t change with T increasing. The scheme is forward secure in random oracle model assuming CDH problem is hard.展开更多
文摘A new scheme to verifiably redistribute a secret from the old to new shareholders without reconstruction of the secret is presented in this paper. The scheme allows redistribution between different access structures and between different threshold schemes. A point worth mentioning is that this verifiable secret redistribution (VSR) scheme can identify dishonest old shareholders during redistribution without any assumption. A certain technique is adopted to verify the correctness of the old shares of the secret. As a result, the scheme is very efficient. It can be applied to proactive secret sharing (PSS) schemes to construct more flexible and practical proactive secret sharing schemes.
文摘A new efficient forward secure signature scheme based on bilinear pairings is presented in this paper. Each complexity of key generation, key update, signing and verifying algorithms in this scheme is O(1) in terms of the total number of time periods T. Because a new structure in node secret key storage and a unique strategy in key update are employed, the signing and verifying costs don’t grow when T increases. At the same time, the key generation and key update algorithms are efficiently constructed thanks to using the pre-order traversal technique of binary trees. Compared with other schemes based on bilinear pairings, the signature size in this scheme is very short, which doesn’t change with T increasing. The scheme is forward secure in random oracle model assuming CDH problem is hard.