Revocable Identity-Based Encryption from Lattices

Chen, Jie; Lim, Hoon Wei; Ling, San; Wang, Huaxiong; Nguyen, Khoa

doi:10.1007/978-3-642-31448-3_29

Cited by 73 publications

(85 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Identity based blind signature and ring signature was introduced by Zhang et.al [6]. Other non-Identity based Later other variations of IBE have proposed like HIBE [15,16], Fuzzy based IBE, and revocation identity based encryption schemes [20,22].…”

Section: Non-repudiationmentioning

confidence: 99%

See 1 more Smart Citation

Survey on Identity based and Hierarchical Identity based Encryption Schemes

Kalyani¹,

Sridevi²

2016

IJCA

View full text Add to dashboard Cite

In this paper, we present a comprehensive picture and the state of the art of Identity Based Cryptography (IBC) and their security implications with applications. First, we introduce the basic concepts of security and principles of cryptography and then move into identity-based cryptography, an overview of its development process and research progress. We explain identity-based encryption (IBE) schemes and identity-based signature (IBS) schemes and their security analysis. Later, we discuss the hierarchical identity-based encryption (HIBE) present in standard model as well as in random oracle model. We also discuss Revocable Identity Based Encryption (RIBE) schemes from the view point of security models and constructions.We review several encryption schemes and their advantages and disadvantages along with their efficiency and security considerations General TermsCryptography, Security.

show abstract

Section: Non-repudiationmentioning

confidence: 99%

“…In this, overhead of the KGC is based on the number of users participating in the scheme logarithmically increased. Later subsequent scalable RIBE schemes have been studied in the literatures [18,20,22].…”

Section: Revocable and Fuzzy Identity Based Encryptionmentioning

confidence: 99%

Survey on Identity based and Hierarchical Identity based Encryption Schemes

Kalyani¹,

Sridevi²

2016

IJCA

View full text Add to dashboard Cite

show abstract

“…In our RIBE scheme, whenever a new identity joins the system, KGC assigns a random leaf node among the undefined nodes. 13 In the security proof, this simple random node assignment technique allows the simulator to pre-assign a random leaf node for the target identity (therefore nodes on the path to the root node are also pre-determined) and to simulate for a secret key, decryption key, and key update queries before receiving queries regarding ID * . When the first query regarding ID * is issued, the simulator can use the pre-assigned leaf node for ID * .…”

Section: Our Constructionmentioning

confidence: 99%

“…However, the BF-RIBE does not scale well; that is, the overhead on KGC is linearly increased in the number of users. Recently, some studies [7,28,13] have aimed at offering scalability in the RIBE scheme while preserving the same security level as the BF-RIBE.…”

Section: Introductionmentioning

confidence: 99%

“…After the Boneh-Franklin RIBE scheme [11] and the Boldyreva et al scalable (but selectively secure) RIBE scheme [7], there were some results. Libert and Vergnaud [28] proposed the first adaptively secure RIBE scheme (LV-RIBE) without assuming any stronger assumption compared with that of the Boldyreva et al 5 Later an RIBE scheme from lattices [13] also have proposed. All these RIBE schemes are proven secure in the security model proposed by Boldyreva et al [7].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Revocable Identity-Based Encryption Revisited: Security Model and Construction

Seo

Emura

2013

Public-Key Cryptography – PKC 2013

117

View full text Add to dashboard Cite

In ACM CCS 2008, Boldyreva et al. proposed an elegant way of achieving an Identity-based Encryption (IBE) with efficient revocation, which we call revocable IBE (RIBE). One of the significant benefit of their construction is scalability, where the overhead of the trusted authority is logarithmically increased in the number of users, whereas that in the Boneh-Franklin naive revocation way is linearly increased. All subsequent RIBE schemes follow the Boldyreva et al. security model and syntax. In this paper, we first revisit the Boldyreva et al. security model, and aim at capturing the exact notion for the security of the naive but non-scalable Boneh-Franklin RIBE scheme. To this end, we consider a realistic threat, which we call decryption key exposure. We also show that all prior RIBE constructions except for the Boneh-Franklin one are vulnerable to decryption key exposure. As the second contribution, we revisit approaches to achieve (efficient and adaptively secure) scalable RIBE schemes, and propose a simple RIBE scheme, which is the first scalable RIBE scheme with decryption key exposure resistance, and is more efficient than previous (adaptively secure) scalable RIBE schemes. In particular, our construction has the shortest ciphertext size and the fastest decryption algorithm even compared with all scalable RIBE schemes without decryption key exposure resistance.

show abstract

Efficient revocable ID‐based encryption with cloud revocation server

Jia

Kumar

Choo

et al. 2017

Int J Communication

View full text Add to dashboard Cite

SummaryThe capability to efficiently revoke compromised/misbehaving users is important in identity-based encryption (IBE) applications, as it is not a matter of if but of when that one or more users are compromised. Existing solutions generally require a trusted third party to update the private keys of nonrevoked users periodically, which impact on scalability and result in high computation and communication overheads at the key generation center. Li et al proposed a revocable IBE scheme, which outsources most of the computation and communication overheads to a Key Update Cloud Service Provider (KU-CSP). However, their scheme is lack of scalability since the KU-CSP must maintain a secret value for each user. Tseng et al proposed another revocable IBE scheme with a cloud revocation authority, seeking to provide scalability and improve both performance and security level. In this paper, we present a new revocable IBE scheme with a cloud revocation server (CRS).The CRS holds only one secret time update key for all users, which provides the capability to scale our scheme. We demonstrate that our scheme is secure against adaptive-ID and chosen ciphertext attacks under the k-CAA assumption and outperforms both schemes mentioned above, in terms of having lower computation and communication overheads.

show abstract

Revocable Identity-Based Encryption from Lattices

Cited by 73 publications

References 39 publications

Survey on Identity based and Hierarchical Identity based Encryption Schemes

Survey on Identity based and Hierarchical Identity based Encryption Schemes

Revocable Identity-Based Encryption Revisited: Security Model and Construction

Efficient revocable ID‐based encryption with cloud revocation server

Contact Info

Product

Resources

About