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.
A blind signature is a very important technology in e-commerce. This paper uses an ideal cipher with a smaller block size to design a secure two-move blind signature with an optimal padding. Our new scheme has the message recovery property with less bandwidth, which means the user can recover the message from the signature signed by the signer, but costs no other bandwidth to save power and battery...
An efficient multi-signature scheme secure in the random oracle model is proposed, which is the first multi-signature scheme with tight security reduction to the hardness of computational Diffie-Hellman (CDH) problem. The scheme only needs the proof-of-possession (POP) key registration assumption to prevent the notorious rogue key attacks and obtain existentially unforgeable security against the adaptively...
How to design efficient signature schemes with tight security reductions has attracted many cryptologists' attention during the past several decades. In this paper, we propose a new deterministic signature scheme based on the computational Diffie-Hellman problem. Comparing with the previously signatures' security reduction, ours is much tighter. Moreover, a new improved Rabin signature scheme is proposed...
Recently, Chang, Lin and Lam proposed an ID-based multisignature scheme without reblocking and predetermined signing order. Their scheme adopts users' id information as the public keys instead of random integers. They have claimed that it is computationally infeasible to derive the private key of Key Authentication Center (KAC) from the private keys of the authorized users, and the scheme has the...
In this paper we analyze an ID-based key issuing protocol due to Gangishetti et al., designed for eliminating the need of secure channel between PKG and users and avoiding the key escrow problem. Their protocol consists of five sub-protocols, namely system setup, system public key setup, key issuing, key securing and key retrieving. We show that both the key issuing and the key securing sub-protocols...
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.