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.
Short signature schemes are useful for systems where signatures are typed in by a human or for systems with low-bandwidth channels and/or low-computation power such as PDAs or cell phones. In this paper, a new short signature scheme is proposed. Our scheme is more efficient than Zhang et al.'s scheme and BLS scheme. Based on the hardness of k-CAA problem, we provide a rigorous proof for our scheme...
The notion of limited verifier signature (LVS) was first introduced by Araki et al. in 1999. It is a useful cryptographic primitive to limit the publicly verifiable property of ordinary digital signatures. In a LVS, the signature can be verified by a limited verifier. When necessary, the signer or the limited verifier can provide a proof to convince a designated verifier (eg., a judge) that the signer...
In this paper, we study the duality of two primitives between broadcast encryption with sender authentication (BESA) and 1-out-of-n designated verifier signature ((1,n)- DVS). In our study, we first construct the model of both BESA and (1,n)-DVS strictly. Then we point out the existence of duality. This paper provides not only the model and discussions on the duality, but also two practical schemes...
This paper shows that three cryptographic channels, secure channels (SC), anonymous channels (AC) and direction-indeterminable channels (DIC), are reduced to each other in the UC (universally composable) framework. We first define ideal functionalities for these channels, FSC, FAC and FDIC. We then prove that a SC protocol UC-realizes FSC in the FDIC -hybrid model, that a DIC protocol UC-realizes...
A modification of the public-key cryptosystem proposed by Okamoto is presented. This modification appears to be resistant to Shamir's cryptanalytic attacks on the original cryptosystem. In addition, a variant whose data expansion rate due to encryption is less than that of the modification is also proposed.
A fast public-key cryptosystem is proposed which is based on congruent polynomial equations. This scheme is much faster than the RSA scheme. Moreover, the encryption and decyption algorithms for this scheme are very simple. The task of breaking this scheme appears to be as difficult as that of factoring a large composite integer, although this has not yet been proven.
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.