2012
DOI: 10.1007/978-3-642-31448-3_16
|View full text |Cite
|
Sign up to set email alerts
|

Leakage-Resilience of Stateless/Stateful Public-Key Encryption from Hash Proofs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…To overcome this obstacle, they showed that variants of the Cramer-Shoup cryptosystem are CCA1-secure with leakage rate 1/4, and CCA2-secure with leakage rate 1/6. In [21], the authors generalized Naor and Segev's KL-CCA2-secure PKE scheme using HPS and extended it to stateful PKE schemes. In 2010, Dodis et al [13] introduced the notion of 'true-simulation extractable' NIZKs which can be realised using regular NIZK instead of using expensive ss-NIZKs.…”
Section: Prior Constructions On Leakage-resilient Encryptionmentioning
confidence: 99%
“…To overcome this obstacle, they showed that variants of the Cramer-Shoup cryptosystem are CCA1-secure with leakage rate 1/4, and CCA2-secure with leakage rate 1/6. In [21], the authors generalized Naor and Segev's KL-CCA2-secure PKE scheme using HPS and extended it to stateful PKE schemes. In 2010, Dodis et al [13] introduced the notion of 'true-simulation extractable' NIZKs which can be realised using regular NIZK instead of using expensive ss-NIZKs.…”
Section: Prior Constructions On Leakage-resilient Encryptionmentioning
confidence: 99%
“…Kurosawa et al exploited an efficient approach to design CCA secure LR‐PKE schemes. Nguyen et al provided a new construction of CCA secure LR‐PKE scheme based on the hash proof system. Later, Liu et al and Sun et al provided another type of construction of CCA‐secure LR‐PKE scheme and LR‐IBE scheme, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Exposure‐resilient cryptography solved attackers who could obtain some related information by the bits representation of the secret key. Various leakage models have been presented in the literature . The bounded memory–leakage model was firstly proposed by Akavia et al in TCC'09, which does not permit users to refresh their secret keys within the limited lifetime.…”
Section: Introductionmentioning
confidence: 99%
“…In this model, the inactive part of the system may leak information. In the “bounded leakage” model, there are some LR schemes that have been constructed such as LR public key encryption schemes , LR identity‐based encryption schemes , and LR signature schemes . Naor and Segev gave the concept of entropy leakage, which generalized the “bounded leakage” concept.…”
Section: Introductionmentioning
confidence: 99%