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.
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,...
As many ID-based verifiably encrypted signature schemes have key escrow problem and low efficiency, we propose a new efficient verifiably encrypted signature scheme using pairing operation. The half-trust private key generator generates user's private key components, and user generates another private key in the scheme, thus the key escrow is solved, the private key generator is prevented forging...
In the process of formal analysis based on strand space model, it is generally based on the assumption that the cryptographic algorithm used in protocol is secure. By introducing an insecure signature algorithm, we extend the penetrator model of strand space and improve the authentication test method based on parameters consistency, and then extend the expression and analysis ability of the strand...
The Many cryptographic protocols require random or pseudorandom inputs at various points, e.g., for auxiliary quantities used in generating digital signatures, or for generating challenges in authentication protocols. Security of an algorithm rests in keys. If cryptographically weak process is used to generate keys then the whole system will be weak. Only the key should be secret. Cryptographic mechanisms...
Batch verification is used in cases of verifying many signatures at the same time, for it can speedup the verification of signature significantly. It is well known that if the verifier uses batch verification to verify n different signatures, he needs to pick n exponents at random. Through the study on batch verification, we find that picking n-1 random exponents is enough, and the last one is chosen...
First, based on the bilinear pairings, a new computing problem, inverse bilinear paring operation problem (IBPOP), is proposed, which is proved to be not easier than the computing diffie-Hellman problem (CDHP) and not harder than discrete logarithm problem (DLP). So, if the symbol ldquolesrdquo denotes the increase of the hardness of computing problem, it can be deduced that CDHPlesIBPOPlesDLP. Then,...
Most of pairing-based schemes need two or more operations of pairings. To find an efficient randomized certificate-based signature from pairings, by constructing a fraction such that a random element of the gap Diffie-Hellman group is included in the numerator and the sum of the master key and the output of the hash function is included in the denominator, a new signature scheme from pairings is proposed,...
We present alternative realizations of the factoring-based transitive signature schemes introduced by Bellare and Neven, providing performance improvements over existent schemes to a certain extent. Specifically, our new schemes, FactTS-3 and FactTS-4, make the algorithms of signing and verifying easier but make the algorithm of composition more inconvenient. Note that verifying operations are more...
Identity-based (ID based) public key cryptosystem gives an efficient alternative for key management as compared to certificate based public key settings. A proxy signature is a method for an entity to delegate signing capabilities to other participants so that they can sign on behalf of the entity with in a given context. In this paper, we have proposed a new ID-based proxy signature which is more...
In the last couple of years, identity based cryptography has got fruitful achievements. Proxy blind signature scheme enables a proxy signer to make blind signature on behalf of the original signer. This paper proposes an ID-based proxy blind signature scheme based on the bilinear pairings. We also analyses the scheme??s correctness efficiency and blindness property.
Recently, Wang et. al presented a short group signature scheme without random oracles, and Kang et al. gave an efficient ID-based strong designated verifier signature scheme. And security proof of the two signature schemes were provided. Unfortunately, in this work we show that Wang et al.'s group signature is universally forgeable. Namely, any one can forge a group signature on arbitrary message,...
In this paper, the authors put forward an efficient certificateless designated verifier signature scheme, in which only two pairing operations are needed in the signing and verification processes. Our scheme is one of schemes with the shortest signatures length compared with any schemes available in the literature. Our scheme satisfies all the requirements of the designated verifier signature. At...
There are only two possible signers in designated verifier signature(DVS) scheme, thus anyone else can not know who is the real signer according to signature/message pairs. Lipmaa et al. discovered delegatability attack on almost all existing designated verifier signature according to original definition of DVS, and later Li et al. subdivided the delegation and defined verifier-only delegatability...
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...
As two special digital signatures, group signature and designatedverifier signature play very important roles in the e-commerce. A group signature scheme allows a group member to anonymously sign message on behalf of the group, In case of a dispute, the group manager can reveal the actual identity of signer. Group signature is widely used in e-cash, e-voting, e-bid and so on. In a designated verifier...
In order to encapsulate data and to convey information more efficiently and more security, a draft frame based on active block ciphers for application layer of Internet which could transmit orange data into semantic security and semantic integrity was designed according to scalable purpose. To different network environment, there were different intelligent choices about block cipher algorithms to...
There are only two possible signers in designated verifier signature(DVS) scheme, thus anyone else can not know who is the real signer according to signature/message pairs. Lipmaa et al. discovered delegatability attack on almost all existing designated verifier signature. In fact all DVS scheme based on pairings are delegatable. In this paper we first formally define DVS in the standard model. Then...
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.