Efficient Identity-Based Key Encapsulation to Multiple Parties

Barbosa, Manuel; Farshim, Pooya

doi:10.1007/11586821_28

Cited by 31 publications

(27 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, the schemes of [17] reuse randomness to enhance efficiency, and this is not formally addressed in the security analysis. Barbosa and Farshim [3] do consider the security of multi-recipient IBE with randomness re-use, but only in the single-TA setting.…”

Section: A Related Workmentioning

confidence: 99%

Flexible and secure communications in an identity-based coalition environment

Boklan

Klagsbrun

Paterson

et al. 2008

MILCOM 2008 - 2008 IEEE Military Communications Conference

View full text Add to dashboard Cite

Abstract-In this paper we consider the problem of how entities operating under distinct roots of trust in a coalition environment can flexibly and securely communicate with one another. We consider the identity-based setting, with each entity being preconfigured with a private key from a particular Trusted Authority (TA), but where multiple, independent TAs are involved in the coalition. Our solution to the problem adapts the Boneh-Franklin identity-based encryption (IBE) scheme. It allows any entity to securely communicate with any other entity, even without knowing the TA with which the intended recipient is associated. To enable this, we assume that the TAs co-operate to distribute certain additional public information to all entities which allows entities to decrypt a ciphertext that was composed using the public parameters of one TA, using a private key issued by another. We include a security analysis of our new approach.

show abstract

Section: A Related Workmentioning

confidence: 99%

Flexible and secure communications in an identity-based coalition environment

Boklan

Klagsbrun

Paterson

et al. 2008

MILCOM 2008 - 2008 IEEE Military Communications Conference

View full text Add to dashboard Cite

show abstract

“…Subsequently, Bentahar et al Extended the concept of key encapsulation to identitybased cryptography primitives, who proposed a general construction method based on identity key encapsulation (ID-KEM). In 2005, Barbosa and Farshim [6] proposed in conjunction with the identity key encapsulation and multi-recipient key encapsulation in order to deduce the identitybased multi-recipient key encapsulation (ID-KEM). Meanwhile, Several elegant revocation constructions [7,8,9,10] have been proposed.…”

Section: Introductionmentioning

confidence: 99%

Anonymous Identity-Based Key Scheme in Application of Privacy Protection

Shen¹,

Yang²,

Chuan-sheng³

2017

Proceedings of the 2017 2nd International Conference on Education, Sports, Arts and Management Engineering (ICESAME 2017)

View full text Add to dashboard Cite

With the advancement of cloud computing application and research, there is a lot of data interaction between the users and the cloud computing platforms where exists a threat to the transmission and storage of users' data. Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important since a user's credential (or private key) can be expired or revealed. For the current identity-based encryption program is not anonymous. We construct a new identity-based anonymous encryption scheme (AIBKE) based on the character of bilinear group and the bilinear DH. The new scheme not only solves the problem that the existing scheme can not protect the privacy of the receiver, but also ensures anonymous that both sender and receiver of the signcryption program. The scheme can satisfy both semantic security, unforgeability, and anonymity.

show abstract

“…The notion of mKEM was introduced by Smart in [24]. Later, in [4], the notion of mKEM was extended to multi-receiver identity based key encapsulation (mID-KEM), i.e. mKEM in the identity-based setting.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Identity-Based Signcryption Scheme for Multiple Receivers

Selvi

Vivek

Srinivasan

et al. 2009

Advances in Information and Computer Security

View full text Add to dashboard Cite

Abstract. This paper puts forward a new efficient construction for Multi-Receiver Signcryption in the Identity-based setting. We consider a scenario where a user wants to securely send a message to a dynamically changing subset of the receivers in such a way that non-members of the of this subset cannot learn the message. The obvious solution is to transmit an individually signcrypted message to every member of the subset. This requires a very long transmission (the number of receivers times the length of the message) and high computation cost. Another simple solution is to provide every possible subset of receivers with a key. This requires every user to store a huge number of keys. In this case, the storage efficiency is compromised. The goal of this paper is to provide solutions which are efficient in all three measures i.e. transmission length, storage of keys and computation at both ends. We propose a new scheme that achieve both confidentiality and authenticity simultaneously in this setting and is the most efficient scheme to date, in the parameters described above. It breaks the barrier of ciphertext length of linear order in the number of receivers, and achieves constant sized ciphertext, independent of the size of the receiver set. This is the first Multi-receiver Signcryption scheme to do so. We support the scheme with security proofs under a precisely defined formal security model.

show abstract

Efficient Identity-Based Key Encapsulation to Multiple Parties

Cited by 31 publications

References 12 publications

Flexible and secure communications in an identity-based coalition environment

Flexible and secure communications in an identity-based coalition environment

Anonymous Identity-Based Key Scheme in Application of Privacy Protection

An Efficient Identity-Based Signcryption Scheme for Multiple Receivers

Contact Info

Product

Resources

About