Achieving Leakage Resilience through Dual System Encryption

Lewko, Allison; Rouselakis, Yannis; Waters, Brent

doi:10.1007/978-3-642-19571-6_6

Cited by 120 publications

(129 citation statements)

References 68 publications

Supporting

Mentioning

129

Contrasting

Order By: Relevance

“…It was further developed in several subsequent works [27,25,33,26,29,28]. Most of these works have used composite order groups as a convenient setting for instantiating the dual system methodology, with the exception of [33].…”

Section: Related Workmentioning

confidence: 99%

“…For example, the systems presented in [27,25,29,28,26] provide diverse and advanced functionalities like identity-based encryption (IBE), hierarchical identity-based encryption (HIBE), and attribute-based encryption with strong security guarantees (e.g. full security, leakage-resilience) proven from static assumptions.…”

Section: Introductionmentioning

confidence: 99%

“…A reduction to DLIN is only provided for the most basic variant of the subgroup decision assumption, and does not extend (for example) to the general subgroup decision assumption from [3]. Second, the step of translating the proof fails for many schemes, including all of the recent composite order schemes employing the dual system encryption proof methodology [27,25,29,28,26]. These schemes use only canceling and not projecting, and so this is unrelated to the limitations discussed in [30].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting

Lewko

2012

Lecture Notes in Computer Science

Self Cite

186

206

View full text Add to dashboard Cite

In this paper, we explore a general methodology for converting composite order pairingbased cryptosystems into the prime order setting. We employ the dual pairing vector space approach initiated by Okamoto and Takashima and formulate versatile tools in this framework that can be used to translate composite order schemes for which the prior techniques of Freeman were insufficient. Our techniques are typically applicable for composite order schemes relying on the canceling property and proven secure from variants of the subgroup decision assumption, and will result in prime order schemes that are proven secure from the decisional linear assumption. As an instructive example, we obtain a translation of the Lewko-Waters composite order IBE scheme. This provides a close analog of the BonehBoyen IBE scheme that is proven fully secure from the decisional linear assumption. We also provide a translation of the Lewko-Waters unbounded HIBE scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting

Lewko

2012

Lecture Notes in Computer Science

Self Cite

186

206

View full text Add to dashboard Cite

show abstract

“…1 The CML model is indeed a very powerful model since it allows the attacker to potentially learn unbounded leakage on the system's secret memory. In addition to constructions of randomized PKE mentioned above, leakage-resilient schemes for several tasks in a variety of leakage models are now known, e.g., digital signatures [LW10,BSW11,LLW11], identity-based encryption [BKKV10,CDRW10,LRW11], interactive proofs [GJS11,Pan14,AGP14], secure computation [FRR + 10, BGJK12,GR12], and so on. We remark that the study of leakage-resilient cryptography was initiated in [DP08,MR04,ISW03] as an attempt to provide an algorithmic defense against side-channel attacks [Koc96,AK97,QS01,OST06].…”

Section: Introductionmentioning

confidence: 99%

Deterministic Public-Key Encryption Under Continual Leakage

Koppula

Pandey

Rouselakis

et al. 2016

Applied Cryptography and Network Security

Self Cite

View full text Add to dashboard Cite

Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O'Neill (CRYPTO 2007), is an important technique for searchable encryption; it allows quick, logarithmic-time, search over encrypted data items. The technique is most effective in scenarios where frequent search queries are performed over a huge database of unpredictable data items. We initiate the study of deterministic public-key encryption (D-PKE) in the presence of leakage. We formulate appropriate security notions for leakage-resilient D-PKE, and present constructions that achieve them in the standard model. We work in the continual leakage model, where the secret-key is updated at regular intervals and an attacker can learn arbitrary but bounded leakage on the secret key during each time interval. We, however, do not consider leakage during the updates. Our main construction is based on the (standard) linear assumption in bilinear groups, tolerating up to 0.5 − o(1) fraction of arbitrary leakage. The leakage rate can be improved to 1 − o(1) by relying on the SXDH assumption.At a technical level, we propose and construct a "continual leakage resilient" version of the all-but-one lossy trapdoor functions, introduced by Peikert and Waters (STOC 2008). Our formulation and construction of leakage-resilient lossy-TDFs is of independent general interest for leakage-resilient cryptography.

show abstract

“…Therefore, the number of bits leaked between updates is still restricted. secure with auxiliary input, even though there are a number of (bounded) leakageresilient IBE schemes [1,2,8,6,13]. A distinctive feature of IBE is that any string can be used as a public key and potentially an exponential number of identities can be supported.…”

Section: Introductionmentioning

confidence: 99%

Identity-Based Encryption Resilient to Continual Auxiliary Leakage

Yuen

Chow

Zhang

et al. 2012

Advances in Cryptology – EUROCRYPT 2012

View full text Add to dashboard Cite

Abstract.We devise the first identity-based encryption (IBE) that remains secure even when the adversary is equipped with auxiliary input (STOC '09) -any computationally uninvertible function of the master secret key and the identity-based secret key. In particular, this is more general than the tolerance of Chow et al.'s IBE schemes (CCS '10) and Lewko et al.'s IBE schemes (TCC '11), in which the leakage is bounded by a pre-defined number of bits; yet our construction is also fully secure in the standard model based on only static assumptions, and can be easily extended to give the first hierarchical IBE with auxiliary input.Furthermore, we propose the model of continual auxiliary leakage (CAL) that can capture both memory leakage and continual leakage. The CAL model is particularly appealing since it not only gives a clean definition when there are multiple secret keys (the master secret key, the identity-based secret keys, and their refreshed versions), but also gives a generalized definition that does not assume secure erasure of secret keys after each key update. This is different from previous definitions of continual leakage (FOCS '10, TCC '11) in which the length-bounded leakage is only the secret key in the current time period. Finally, we devise an IBE scheme which is secure in this model. A major tool we use is the modified Goldreich-Levin theorem (TCC '10), which until now has only been applied in traditional public-key encryption with a single private key.

show abstract

Achieving Leakage Resilience through Dual System Encryption

Cited by 120 publications

References 68 publications

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting

Deterministic Public-Key Encryption Under Continual Leakage

Identity-Based Encryption Resilient to Continual Auxiliary Leakage

Contact Info

Product

Resources

About