The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Traditional asymmetric encryption algorithms involve only two parties: one party is a sender (encrypter) and the other a receiver (decrypter), in which each party has two different keys: a private key and a public key. However, if applied in some multiparty‐oriented environments, there may be a serious problem that each party needs to store and manage many keys, which is not only an overload but also...
In this paper, we propose a distributed group signature scheme with traceable signers for mobile Ad hoc networks. In such scheme, there isn't a trusted center, and all members of Ad hoc group cooperate to generate all system parameters and all private/public keys. Any t members in Ad hoc group can collaboratively generate the group signature with the help of a designated clerk, where the signer respectively...
In this paper, we investigate the problem of increasing the threshold value of the Shamirpsilas (t, n)-threshold scheme without the dealerpsilas helps, and present a new secret sharing scheme with the threshold value increasing. In this scheme, the dealer needs not to pre-compute or publish any information in advance, all participants cooperate to take on the dealerpsilas role and to complete the...
In real world, there are many important applications for the secret sharing with the quasi-threshold multipartite access structure. But there was still not a very efficient scheme proposed in the past. In this paper, we combine the multi-secret sharing and the quasi-threshold multipartite access structure, and present an efficient multi-secret sharing scheme with the quasi-threshold multipartite access...
In 2004, Yang et al. proposed an efficient multi-secret sharing scheme based on two-variable one-way function and Shamirpsilas secret sharing, which needs to reconstruct a (t-1) or (p-1)th degree Lagrange interpolation polynomial. This paper proposes a more efficient multi-secret sharing scheme based on Yang et al.'s scheme and the Stern-Brocot tree, which needs to reconstruct a (t-1) or (p/2-1)th...
This paper introduces a new (t, n) secret sharing scheme for image encryption. The proposed method encrypts the secret image into two images as the same size of the original image, which one is the public image (called the encrypted image) and another is to be shared among n participants using a new secret sharing method based on the Shamir’s secret sharing. In the new secret sharing scheme, t (or...
In this article, we propose a (t,n) threshold verifiable multi-secret sharing scheme, in which to reconstruct t secrets needs to solve t simultaneous equations. The analysis results show that our scheme is as easy as Yang's scheme [8] in the secret reconstruction and requires less public values than Chien's [7] and Yang's schemes. Furthermore, the shares in our scheme can be verified their validity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.