{"title":"On Generic Groups and Related Bilinear Problems","authors":"D. Lubicz, Thomas Sirvent","doi":"10.3233/978-1-58603-947-9-169","DOIUrl":"https://doi.org/10.3233/978-1-58603-947-9-169","url":null,"abstract":"Groups with pairing are now considered as standard building blocks for cryptographic primitives. The security of schemes based on su ch groups relies on hypotheses related to the discrete logarithm problem. As the e ypotheses are not proved, one would like to have some positive security argument for them. It is usual to assess their security in the so called generic group model i ntroduced by Nechaev and Shoup. Over the time, this model has been extended in differ ent directions to cover new features. The relevance of this model is nevertheless subject to critic isms: in particular, the fact that the answer to any fresh query is a random bit stri ng is not what one expects from a usual group law. In this paper, we develop a generic group model with pairing wh ich generalizes all the models seen so far in the literature. We provide a gener al framework in order to prove difficulty assumptions in this setting. In order to imp rove the realism of this model, we introduce the notion of pseudo-random families of groups. We show how to reduce the security of a problem in such a family to the se curity of the same problem in the generic group model and to the security of an und erlying strong pseudo-random family of permutations.","PeriodicalId":202657,"journal":{"name":"Identity-Based Cryptography","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124633314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Maurice Keller, Robert Ronan, A. Byrne, Colin C. Murphy, W. Marnane
{"title":"Hardware Implementation of Pairings","authors":"Maurice Keller, Robert Ronan, A. Byrne, Colin C. Murphy, W. Marnane","doi":"10.3233/978-1-58603-947-9-207","DOIUrl":"https://doi.org/10.3233/978-1-58603-947-9-207","url":null,"abstract":"","PeriodicalId":202657,"journal":{"name":"Identity-Based Cryptography","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131250067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Forward-Secure Hierarchical IBE with Applications to Broadcast Encryption","authors":"D. Yao, Nelly Fazio, Y. Dodis, Anna Lysyanskaya","doi":"10.3233/978-1-58603-947-9-100","DOIUrl":"https://doi.org/10.3233/978-1-58603-947-9-100","url":null,"abstract":"A forward-secure encryption scheme protects secret keys fr om exposure by evolving the keys with time. Forward security has several unique requirements in hierarchical identity-based encryption (HIBE) scheme: (1 ) users join dynamically; (2) encryption is joining-time-oblivious; (3) users evolv e secret keys autonomously. We define and construct a scalable pairing-based forward-se cure HIBE (fsHIBE) scheme satisfying all of the above requirements. We al so show how our fs-HIBE scheme can be used to realize a forward-secure publi c-key broadcast encryption scheme, which protects the secrecy of prior transm is ions in the broadcast encryption setting. We further generalize fs-HIBE into a co llusion-resistant multiple hierarchical ID-based encryption scheme, which can be u sed for secure communications with entities having multiple roles in role-ba sed access control. The security of our schemes is based on the bilinear Diffie-Hellm an assumption in the random oracle model.","PeriodicalId":202657,"journal":{"name":"Identity-Based Cryptography","volume":"35 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113942800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Claire Whelan, D. Page, F. Vercauteren, Michael Scott, W. Marnane
{"title":"Implementation Attacks & Countermeasures","authors":"Claire Whelan, D. Page, F. Vercauteren, Michael Scott, W. Marnane","doi":"10.3233/978-1-58603-947-9-226","DOIUrl":"https://doi.org/10.3233/978-1-58603-947-9-226","url":null,"abstract":"","PeriodicalId":202657,"journal":{"name":"Identity-Based Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132312308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Flexible IBE and Beyond in the Commutative-Blinding Framework","authors":"Xavier Boyen","doi":"10.3233/978-1-58603-947-9-65","DOIUrl":"https://doi.org/10.3233/978-1-58603-947-9-65","url":null,"abstract":"The cryptographic community has, of late, shown much inventiveness in the creation of powerful new IBE-like primitives that go beyond the basic IBE notion and extend it in many new directions. Virtually all of these “super-IBE” schemes rely on bilinear pairings for their implementation, which they tend to use in a surprisingly small number of different ways: three of them as of this writing. \u0000 \u0000What is interesting is that, among the three main frameworks that we know of so far, one has acted as a veritable magnet for the construction of many of these “generalized IBE” primitives, whereas the other two have not been nearly as fruitful in that respect. This refers to the Commutative Blinding framework defined by the Boneh-Boyen [Bscr ][Bscr ]1 IBE scheme from 2004. \u0000 \u0000The aim of this chapter is to try to shed some light on this approach's popularity, first by comparing its key properties with those of the competing frameworks, and then by providing a number of examples that illustrate how those properties have been used.","PeriodicalId":202657,"journal":{"name":"Identity-Based Cryptography","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127256886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Attribute-Based Encryption","authors":"A. Sahai, Brent Waters, Steve Lu","doi":"10.3233/978-1-58603-947-9-156","DOIUrl":"https://doi.org/10.3233/978-1-58603-947-9-156","url":null,"abstract":"Attribute-based encryption (ABE) is a type of public key encryption that allows users to encrypt and decrypt messages based on user attributes. For instance, one can encrypt a message to any user satisfying the boolean formula (“crypto conference attendee” AND “PhD student”) OR “IACR member”. One drawback is that encryption and key generation computational costs scale with the complexity of the access policy or number of attributes. In practice, this makes encryption and user key generation a possible bottleneck for some applications. To address this problem, we develop new techniques for ABE that split the computation for these algorithms into two phases: a preparation phase that does the vast majority of the work to encrypt a message or create a secret key before it knows the message or the attribute list/access control policy that will be used (or even the size of the list or policy). A second phase can then rapidly assemble an ABE ciphertext or key when the specifics become known. This concept is sometimes called “online/offline” encryption when only the message is unknown during the preparation phase; we note that the addition of unknown attribute lists and access policies makes ABE significantly more challenging. One motivating application for this technology is mobile devices: the preparation work can be performed while the phone is plugged into a power source, then it can later rapidly perform ABE operations on the move without significantly draining the battery.","PeriodicalId":202657,"journal":{"name":"Identity-Based Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115764700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Identity-Based Signatures","authors":"Eike Kiltz, G. Neven","doi":"10.3233/978-1-58603-947-9-31","DOIUrl":"https://doi.org/10.3233/978-1-58603-947-9-31","url":null,"abstract":"This chapter gives an overview of the literature on identitybased signature (IBS) schemes, from Shamir’s seminal scheme to the current state-of-the-art. Rather than presenting all schemes separately, we present three generic transformations that together cover the majority of known IBS schemes as special cases. The first transformation follows a certification approach based on standard signatures; the second is a transformation in the random oracle model from “convertible” identification schemes; and the third is based on hierarchical identitybased encryption. We also discuss a number of direct schemes that escape being covered by any of the generic transformations. Finally, we show how the principles of the first transformation can be extended to a hierarchical setting and to IBS schemes with special properties.","PeriodicalId":202657,"journal":{"name":"Identity-Based Cryptography","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130633897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
