Results 1 - 10 of 802

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps

by Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham , 2002
"... An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into a single short signature. This single signature (and the n original messages) will convince the verif ..."
Abstract - Cited by 336 (12 self) - Add to MetaCart
construct an efficient aggregate signature from a recent short signature scheme based on bilinear maps due to Boneh, Lynn, and Shacham. Aggregate signatures are useful for reducing the size of certificate chains (by aggregating all signatures in the chain) and for reducing message size in secure routing

Short group signatures

by Dan Boneh, Xavier Boyen, Hovav Shacham - In proceedings of CRYPTO ’04, LNCS series , 2004
"... Abstract. We construct a short group signature scheme. Signatures in our scheme are approximately the size of a standard RSA signature with the same security. Security of our group signature is based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision ..."
Abstract - Cited by 386 (19 self) - Add to MetaCart
Abstract. We construct a short group signature scheme. Signatures in our scheme are approximately the size of a standard RSA signature with the same security. Security of our group signature is based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision

Aggregate Signatures using Bilinear Maps

by Frank Wang
"... Bilinear maps have been used in many revolutionary cryptographic schemes in the past decade. In fact, ever since the emergence of Identity Based Encryption by Boneh and Franklin [1], bilinear maps have been consistently used to construct shorter signatures [3], more powerful encryption schemes, such ..."
Abstract - Add to MetaCart
Bilinear maps have been used in many revolutionary cryptographic schemes in the past decade. In fact, ever since the emergence of Identity Based Encryption by Boneh and Franklin [1], bilinear maps have been consistently used to construct shorter signatures [3], more powerful encryption schemes

Signature schemes and anonymous credentials from bilinear maps

by Jan Camenisch, Anna Lysyanskaya , 2004
"... We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption put forth by Lysyanskaya, Rivest, Sahai, and Wolf (LRSW) who also showed that it holds for generic groups and is independent of th ..."
Abstract - Cited by 234 (23 self) - Add to MetaCart
of the decisional Diffie-Hellman assumption. We prove security of our scheme under the LRSW assumption for groups with bilinear maps. We then show how our scheme can be used to construct efficient anonymous credential systems as well as group signature and identity escrow schemes. To this end, we provide efficient

Efficient identity-based encryption without random oracles

by Brent Waters , 2005
"... We present the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. We first present our IBE construction and reduce the security of our scheme to the decisional Bilinear Diffie-Hellman (BDH) problem. Additionally, we show that our techniques can be use ..."
Abstract - Cited by 346 (19 self) - Add to MetaCart
We present the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. We first present our IBE construction and reduce the security of our scheme to the decisional Bilinear Diffie-Hellman (BDH) problem. Additionally, we show that our techniques can

Practical Certificateless Aggregate Signatures From Bilinear Maps ⋆

by Zheng Gong, Yu Long, Xuan Hong, Kefei Chen
"... Abstract. In some restrictive environments, such as sensor networks, each sensor submits the newest information to the server, every message must be authenticated to immune forgery and replay attacks. But the regular signatures need to be saved and verified individually, which will heavily add the c ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
compact signature σ. In this paper, two practical certificateless aggregate signature schemes, which are the first aggregate signature schemes in the CL-PKC, are proposed from bilinear maps. The first scheme CAS-1 reduces the costs of communication and signer-side computation but loses on the storage

Hierarchical ID-Based Cryptography

by Craig Gentry, Alice Silverberg , 2002
"... We present hierarchical identity-based encryption schemes and signature schemes that have total collusion resistance on an arbitrary number of levels and that have chosen ciphertext security in the random oracle model assuming the difficulty of the Bilinear Diffie-Hellman problem. ..."
Abstract - Cited by 257 (3 self) - Add to MetaCart
We present hierarchical identity-based encryption schemes and signature schemes that have total collusion resistance on an arbitrary number of levels and that have chosen ciphertext security in the random oracle model assuming the difficulty of the Bilinear Diffie-Hellman problem.

Signature bouquets: Immutability for aggregated/condensed signatures

by Einar Mykletun, Maithili Narasimha, Gene Tsudik - In ESORICS , 2004
"... Abstract. Database outsourcing is a popular industry trend which involves organizations delegating their data management needs to an external service provider. Since a service provider is almost never fully trusted, security and privacy of outsourced data are important concerns. This paper focuses o ..."
Abstract - Cited by 32 (0 self) - Add to MetaCart
. To this end, some recent work [19] examined two relevant signature schemes: a condensed variant of batch RSA [3] and an aggregated signature scheme based on bilinear maps [6] In this paper, we introduce the notion of immutability for aggregated signature schemes. Immutability refers to the difficulty

Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing

by Cong Wang, Qian Wang, Kui Ren, Wenjing Lou - In INFOCOM , 2010
"... Abstract. Cloud Computing is the long dreamed vision of computing as a utility, where users can remotely store their data into the cloud so as to enjoy the on-demand high quality applications and services from a shared pool of configurable computing resources. By data outsourcing, users can be relie ..."
Abstract - Cited by 135 (1 self) - Add to MetaCart
handling of multiple auditing tasks, we further explore the technique of bilinear aggregate signature to extend our main result into a multi-user setting, where TPA can perform multiple auditing tasks simultaneously. Extensive security and performance analysis shows the proposed schemes are provably secure

Certificateless Public Key Cryptography

by Sattam S. Al-riyami, Kenneth G. Paterson - ASIACRYPT'03 , 2003
"... This paper introduces the concept of certificateless public key cryptography (CL-PKC). In contrast to traditional public key cryptographic systems, CL-PKC does not require the use of certificates to guarantee the authenticity of public keys. It does rely on the use of a trusted third party (TTP) who ..."
Abstract - Cited by 240 (4 self) - Add to MetaCart
cryptography that is intermediate between traditional certificated PKC and ID-PKC. We make concrete the concept of CL-PKC by introducing certificateless public key encryption (CL-PKE), signature and key exchange schemes. We also demonstrate how hierarchical CL-PKC can be supported. The schemes are all derived
Results 1 - 10 of 802