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.
The concept of the multi-signature was first proposed by Itakura and Nakamura, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature. After that, a lot of multi-signature schemes were proposed, but almost all of the multi-signature schemes are either sequence multi-signature or broadcasting multi-signature, but a lot of examples...
Authenticated key agreement protocols are a foundation for delivering an authenticated session key between the intended two-party participants from a set of parties over an insecure network. Wang et al proposed protocol ECKE-1N to overcome KCI-R attacks in ECKE-1 as an implicit authenticated key agreement protocol based on Diffie-Hellman elliptic curve. In this paper, we show that ECKE-1N is vulnerable...
In this paper we show how modular reduction for integers with Barrett and Montgomery algorithms can be implemented efficiently without using a precomputational phase. We propose four distinct sets of moduli for which this method is applicable. The proposed modifications of existing algorithms are very suitable for fast software and hardware implementations of some public-key cryptosystems and in particular...
In 1998, Blaze, Bleumer and Strauss proposed two kinds of cryptographic primitives called proxy re-encryption and proxy re-signature [4]. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. In proxy re-signature, a proxy can transform a signature computed under Alice's secret key into one that can be verified...
In 2004, Peyravian et al. presented three simple solutions to X.509 PKI method that these three solutions could save storage, bandwidth and reduce the complexity of the operations. However, we find that Peyravian et al. second scheme suffers from the masquerade attack and this paper will propose a slight improvement to their scheme to resist this weakness.
In modern grids, authentication is usually implemented via an X.509 PKI. Proxy certificates are employed to facilitate interaction with the grid, especially for purposes of delegation and single sign-on. However, due to the nature of proxy credentials, these can be obtained by an unauthorized third party and abused for disruptive actions or unauthorized resource consumption. We propose modifications...
The technology of instant messaging (IM) is becoming an important means of communication nowadays. However, some inherit security weaknesses have been recognized as a serious barrier for IM building up its position as an Internet key application. This paper presents a security design for IM on the basis of comparison between the RSA algorithm and the 3DES algorithm that satisfy the requirements at...
In this paper, we present an efficient, effective, and secure mechanism for key-distribution in homogeneous wireless sensor network (WSNs). The scheme is based on multipath key reinforcement. We introduce the concept of a keyed-hash-chain to use a different key in each session between a pair of sensors, without allocating a large amount of memory space to store the keys. First, each sensor node is...
Signcryption is a public key cryptographic primitive that combines the functionalities of encryption and digital signatures in a single logical step at low computational and communications costs. This paper presents a new efficient multi-recipient identity-based signcryption scheme. The scheme provides public verifiability of ciphertext origin which is an essential requirement in firewall authentication...
Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In this paper, we address a question whether it is possible to construct a hybrid signcryption scheme in identity-based setting. This question seems to have never...
In IEEE ISI 2008, an anonymous attribute authentication scheme has been proposed using a self-blindable certificate scheme. This scheme enables the anonymity and certificate revocation. A Certificate Revocation List (CRL) is used in the revocation check. Even if an attacker can obtain a CRL, the attacker cannot execute the revocation check. This means that this scheme enables the designated revocation...
Modular Exponentiation is at the heart of various arithmetic architectures used in most Public Key cryptography algorithms. Modular Exponentiation of large numbers requires excessive processing. An efficient implementation of modular exponentiation may help overcome the speed issues of public Key Cryptography. in this work, the most promising technique of Montgomery modular exponentiation and its...
Oblivious transfer (OT) is a fundamental primitive in cryptography. It is known that unconditionally secure OT is impossible, even with the help of quantum mechanics. Furthermore, no classical OT scheme has been proven to offer computational security in the usual super-polynomial model, and there is evidence that such schemes cannot be based on one-way permutations. Nevertheless, inspired by Ralph...
Decoding attacks are subjected to McEliece code-based public key cryptosystems. Nowadays, complexity of order 280 is considered to be immune. However, the original McEliece cryptosystem has work factor of order 264 against this kind of attacks. There aren't any immune methods to avoid this kind of attacks except increasing code parameters, whereas, this modifications make McEliece cryptosystem impractical...
While Shamirpsilas identity-based public key cryptosystem does not need the certificates, the key escrow of userpsilas private keys is inherent in such scheme. In 2003,the concept of certificateless signature scheme was introduced. In this new paradigm, the necessity of certificates has been successfully removed and the key escrow problem does not exist. Based on the ideas of certificateless signatures...
Hill cipher's susceptibility to cryptanalysis has rendered it unusable in practice, it still serves an important pedagogical role in both cryptology and linear algebra. Hill cipher requires inverse of the key matrix while decryption. In fact that not all the matrices have an inverse and therefore they will not be eligible as key matrices in the Hill cipher scheme. Furthermore, due to its linear nature,...
In this paper proposed a new secret-key block cipher method, in the proposed method, the plaintext and the ciphertext are 33152 bit blocks or multiple of 33152. The ciphertext are 33152 bit blocks or multiple of 33152. The secret key is dynamic key with 33152 bit long or multiple of 33152. The proposed method is combine of RSA, DES, TowFish, Caesar and Reversed ciphers.
Key establishment plays a central role in authentication and encryption in wireless sensor networks, especially when they are mainly deployed in hostile environments. Because of the strict constraints in power, processing and storage, designing an efficient key establishment protocol is not a trivial task. Compared with public key cryptography, symmetric key cryptographic with key predistribution...
This paper analyzes the limitation of conventional digital multi-signature. By utilizing the structure predominance of the XML documents and the security of conventional digital signature, we propose a multi-signature scheme of XML documents based on RSA. In our scheme, we use the Xpath to transform an XML document into subdocument, and each participant signer signs the sub-document that they are...
Mashups are next generation of Web applications; they integrate and remix different sources on the Web in a creative approach to provide rich and novel experiences for users. Furthermore, mashups introduce a new class of integration technologies for implementing situational applications (i.e. applications that come together for solving some immediate business problems). While mashup services provide...
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.