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.
In the proxy signature scheme the proxy signer has the power to act on behalf of the original signer. In order to overcome the security threats and weaknesses in existing schemes, a new proxy signature based on elliptic curve cryptosystem (ECC) is presented. The scheme renders effective protection for the secrecy of proxy signers with probabilistic encryption algorithm. The one-way hash function based...
A proxy signature scheme enables a proxy signer to sign messages on behalf of the original signer. A blind signature is the concept with a salient feature that the signer cannot make a linkage between the blind signature and the identity of the requester. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm or elliptic curve...
A group signature scheme allows a group member to sign a message anonymously on behalf of the group. In case of a dispute, the group manager can reveal the actual identity of signer. In this paper, we propose an efficient group signature scheme, which divide the document M into m blocks and add some redundant bits to each message block, to avoid the conspiracy attack. The security of the proposed...
In this paper, we proposed a new signature scheme based on elliptic curve cryptography. We combined the two problems, factoring and logarithm problem into both signing and verifying equations. We also give a kind of algorithm of the zero-knowledge proof of proposed digital signature. The new scheme was shown to be secure against the known attacks for signature schemes. This algorithm has characteristics...
Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm or elliptic curve discrete logarithm problems. In this paper, we proposed a new threshold signature scheme based on multiple hard problems namely factoring and elliptic curve discrete logarithm problems. We combined the two problems into both signing and verifying equations...
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.