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.
Cloud storage has been gaining tremendous popularity, which provides facilitative data storage and sharing services for distributed clients. To maximize the availability and reliability, some customers may store multiple replicas of critical data on cloud servers. However, cloud servers may collude to make it look like they are storing multiple copies of data, whereas in fact they only store a single...
Undeniability is an essential security property of the traditional digital signature. Strong designated verifier signature(DSVS) is a special digital signature in where the validity of a signature can only be checked by the designated verifier. However, most strong DSVS schemes do not have the undeniability property which leads to dispute between a designated verifier and a signer. In this study,...
ID-based authenticated key exchange (ID-AKE) is a cryptographic tool to establish a common session key between parties with authentication based on their IDs. If IDs contain some hierarchical structure such as an email address, hierarchical ID-AKE (HID-AKE) is especially suitable because of scalability. However, most of existing HID-AKE schemes do not satisfy advanced security properties such as forward...
Efficient design of a complex heterogeneous system requires detailed knowledge about the periodicity properties of its components and understanding the interaction patterns in their data exchange. Some of this information is usually available at the design time and facilitates basic optimisation through the insertion of sufficiently deep buffers between the communicating sub-systems. However, most...
To construct a suitable and secure proxy re-signature scheme is not an easy job, up to now, there exist only a few schemes. None of these schemes is unidirectional identity-based proxy re-signature, where a semi-trusted proxy can transform a signature under an identity to another signature under another identity on the same message, while the proxy cannot generate any signature on behalf of any of...
In BEI 2009, Wang and Kim proposed a new fuzzy identity-based signature (FIBS) scheme and proved that it is existentially unforgeable under chosen message attack and fuzzy identity attack in the random oracle model if the discrete logarithm problem is computationally hard. In NSS 2009, Chen et al. proposed a fuzzy identity-based signature with dynamic threshold which is proven secure against unforgeability...
In order to improve the security and performance of authentication protocol in manufacturing grid, identity-based authentication protocol under standard model is constructed. Combining with the environment of manufacturing grid, this protocol can work under escrow and non-escrow models and different trust domains model. By introducing pseudo random function set, new authentication protocol realizes...
Digital signature is an important authentication technique. Most of digital signature schemes don't satisfy strong unforgeability and only are proven secure in the random oracle model. It is a challenge to construct an ID-based digital signature scheme with strong unforgeability in the standard model. To overcome this problem, in this paper, we propose a strongly unforgeable identity-based signature...
Recently, Libert and Quisquater proposed an efficient signcryption scheme based on the hardness of q-Diffie-Hellman problems in Gap Diffie-Hellman groups. Their scheme is quite efficient: the signcryption operation has almost the same cost as an ElGamal encryption while the reverse operation only requires one pairing evaluation and three exponentiations. However, Tan showed that their scheme is not...
The notion of Divisible Online/Offline Signature (DOS) was recently introduced by Gao et al. in CT-RSA 2009. In a DOS system, the idea is to perform the signing process in two phases. The first phase outputs offline tokens before the arrival of a message to be signed, where the offline tokens are regarded as a part of full signature, and the second phase is performed very efficiently after knowing...
In this paper, we present a two-party attribute-based key agreement protocol, which is secure in random oracle model under the Bilinear Diffe-Hellman assumption. It is inspired by a fuzzy identity-based encryption scheme first proposed by Sahai and Waters. The attribute-based key agreement scheme is a new type of identity-based key agreement scheme, in which we can view identity as a set of descriptive...
In the grid security infrastructure (GSI), cross-domain authentication is based on traditional PKI cross certificate, which brings about problems of certificates management. Encouragingly, identity-based cryptography (IBC) can overcome these problems for its certificate-free feature. Therefore, an identity-based signcryption scheme is proposed in order to meet the requirement of cross-domain authentication...
The verifiably encrypted signature schemes proposed by Asokan solved the fairness problem in the fair exchange process. In the work, we propose an ID-based strong unforgeability verifiably encrypted signature scheme without random oracles, and show that the security of the scheme is based on the difficulty of solving the computational Diffie-Hellman problem. Our scheme is obtained from a modification...
Ring signature is an anonymous signature which allows a user to anonymously sign on behalf of a group. In some cases, we only hope that our signatures were anonymously verified by the designated users, such as hospital records. In this works, by combining ring signature and designated verifier signature scheme, a ring signature scheme with Multi-designated verifiers are proposed to satisfy the multi-user...
Designated verifier signature (DVS) does not provide non-repudiation property of traditional digital signatures. Multi-signers strong designated verifier signature (MS-SDVS) scheme is required in some cases for the privacy consideration. In this paper the definition and security model of MS-SDVS scheme are presented, and a concrete MS-SDVS scheme is proposed from bilinear pairing. The proposed scheme...
Hierarchical identity-based encryption (HIBE) is a generalization of IBE that mirrors an organizational hierarchy, which consists of a root private key generator (PKG), domain PKGs and users. In a traditional HIBE system, users retrieve private keys from their domain PKGs, while domain PKGs request domain secret keys from the root PKG. What's more, the manager of each private key is a single one....
The Diffie and Hellman model of a Public Key Cryptosystem has received much attention as a way to provide secure network communication. In this paper, we show that the original Diffie and Hellman model does not guarantee security against other users in the system. It is shown how users, which are more powerful adversarys than the traditionally considered passive eavesdroppers, can decrypt other users...
New definitions are proposed for the security of Transient-Key Cryptography (a variant on Public-Key Cryptography) that account for the possibility of super-polynomial-time, Monte Carlo cryptanalytic attacks. The basic question we address is: how can one relate the amount of time a cryptanalyst is willing to spend decoding cryptograms to his likelihood of success? This question and others are partially...
It seems very difficult to give a formal definition of computational security for Public Key Cryptography. We define a slightly different notion, called Transient-Key Cryptography, for which a natural definition of security against chosen-plaintext-attacks can be given. The main result presented here is the existence of a relativized model of computation under which there exists a provably secure...
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.