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.
It has been proven that network coding can provide significant benefits to network protocols. However, network coding is very vulnerable to pollution attacks. In recent years, many schemes have been designed to defend against these attacks, but as far as we know that almost all of them are merely suitable for single-source network coding system. In this paper, we proposed a homomorphic signature scheme...
This paper proposes a protocol which provides the ability for sharing trust data securely. The protocol avoids the escrow problem inidentity-based cryptosystem and the secure delivery of private keys. The security of protocol is based on some underlying problems closely related to the bilinear Diffie-Hellman problem are computationally hard.
A group signature scheme from Bilinear Paring equipped with Multiple Security Strategy is proposed. This scheme has forward security which minimizes the damage caused by the exposure of any group member's signing key, and does not affect the past signatures generated by this member; meanwhile, ahead signature generated by a group member before the joining date can be prevented via this strategy. Moreover,...
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...
A designated verifier signature (DVS) scheme has the property that only the designated verifier specified by the signer can check the validity of the signature instead of anyone else. Meanwhile, the designated verifier can not use this proof to convince any third party that a signature is generated by the claimed signer. Consider the application of three-party communication environment. One party...
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.
Self-healing key distribution mechanism can be used to establish session keys within a large and dynamic groups of users over an unreliable network. Mutual-healing key distribution mechanism deals with some deficiency existed in self-healing key distribution mechanism. It is a complementarity to the self-healing mechanism. In this paper, a self-healing key distribution scheme using bilinear pairings...
In this paper we present a comparative performance analysis of nine blind signature schemes that have been proposed since 1983 until 2008, spanning a total of 25 years of active research in this topic. We give a short description of all the schemes studied and their main components. This includes customary arithmetic building blocks such as modular exponentiation, elliptic curve scalar multiplication,...
The session initiation protocol (SIP) is considered as the dominant signaling protocol for calls over the Internet. However, how to authenticate each other and agree on a session key has not been efficiently solved. In 2007, Wang and Zhang proposed a key agreement protocol and a new authentication and key agreement mechanism for SIP. In this paper, we prove that Wang and Zhang's key agreement protocol...
In this paper, we describe a proxy signature scheme where a signer can delegate his signing right to a party who can then sign on behave of the original signer to generate a proxy signature. Our proxy signature scheme possesses the features of deniability and anonymity. It allows the signer to send messages to another while the latter can not prove to a third party the fact of communication and insures...
The paper proposes an ID-based encryption with keyword search scheme from bilinear pairings(IDEKS).It enables one user to send a secret key Tw derived from the receiver's identity to a server-a mail server and private key generator (MPKG) that will enable the server locate all encrypted messages containing the keyword W, but learn nothing else. The whole sending and receiving process need not have...
Ad hoc anonymous identification scheme is a multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove membership anonymously in such groups. This paper proposes a new ID-based ad-hoc anonymous identification scheme from pairings. The new scheme is efficient both in computation and communication compared to previous works.
As various applications of SIP-based VoIP networks have been proposed, security has become one of the big research challenges and is receiving increasing attention. In this paper, we present a certificate-based two party authentication key agreement protocol for SIP-based VoIP networks and prove its security in the random oracle model. Additionally, our scheme could be used for multiple CAs environment...
As online transactions become increasingly practical, a broad range of industrial and e-government applications have emerged which depend on time-based protection of confidential data. Despite theoretical progress in timed-release cryptography (TRC), there is still no implementation infrastructure that takes advantage of the latest TRC algorithms. The purpose of this paper is to propose such an infrastructure...
This paper presents a new fair contract signing protocol between two distrusted parties, which is based on a signature scheme, a verifiable and recoverable encrypted signature (VRES) from bilinear pairings. The protocol employs an off-line trusted third party (TTP), which participates in the protocol execution only in exceptional circumstances and which involvement in the protocol is invisible. It...
Most of the proposed E-cash systems require that the shop and customer belong to the same bank, which becomes the bottle-neck of E-cashpsilas wide application. Fangguo Zhang et al. proposed a model of electronic cash using multi-banks, but a trusted third party is needed in their system. To solve this problem, we propose a new electronic cash scheme based on group signature from bilinear pairings...
In the proxy signature scheme, the capability of anonymous proxy is requested for protecting the proxy signerpsilas privacy. This paper introduces a concept and model of proxy group signature and constructs a proxy group signature scheme based on bilinear pairings. The proposed scheme has the properties of hiding the identity of the signer in the signature and the signerpsilas identity can be revealed...
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...
Signcryption is a cryptographic primitive that performs digital signature and public key encryption simultaneously, at a lower computational costs and communication overheads than the signature-then-encryption approach. Recently, two identity-based threshold signcryption schemes [12], [27] have been proposed by combining the concepts of identity-based threshold signature and signcryption together...
This paper introduces a new digital signature primitive that allows a proxy signer to sign messages on behalf of the original signer, in a way that do not allow the recipient of the signature to disclose the contents of the signed information to any third party without the proxy signer's consent. The above primitive, called proxy chameleon signature enjoys all the attributes in the normal proxy signature...
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.