Learn More
The focus of this paper is to formalize the concept of identity-based threshold signature and give the first provably secure scheme based on the bilinear pairings. An important feature of our scheme is that a private key associated with an identity rather than a master key of the Public Key Generator is shared among signature generation servers, which is(More)
Signcryption is an asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a low computational and communication overhead. In this paper we propose realistic security models for sign-cryption, which give the attacker power to choose both messages/signcryptexts as well as recipient/sender public keys(More)
The public key encryption with keyword search (PEKS) scheme recently proposed by Boneh, Di Crescenzo, Ostrovsky, and Persiano enables one to search encrypted keywords without compromising the security of the original data. In this paper, we address three important issues of a PEKS scheme, " refreshing keywords " , " removing secure channel " , and "(More)
In this paper, we present an online/offline identity-based signature scheme for the wireless sensor network (WSN). We argue that due to significant reduction in costs of computation and storage, our scheme is particularly suitable for the WSN environment with severely constrained resources. One of the interesting features of our scheme is that it provides(More)
In this paper, we construct an efficient " multi-receiver identity-based encryption scheme ". Our scheme only needs one (or none if pre-computed and provided as a public parameter) pairing computation to encrypt a single message for n receivers, in contrast to the simple construction that re-encrypts a message n times using Boneh and Franklin's(More)
In this paper we construct two new fuzzy identity-based encryption (IBE) schemes in the random oracle model. Not only do our schemes provide public parameters whose size is <i>independent</i> of the number of attributes in each identity (used as public key) but they also have useful structures which result in more efficient key extraction and/or encryption(More)
In this paper, we propose two new certificate-based signature (CBS) schemes with new features and advantages. The first one is very efficient as it does not require any pairing computation and its security can be proven using Discrete Logarithm assumption in the random oracle model. We also propose another scheme whose security can be proven in the standard(More)