Abstract
Modern cryptographic schemes are constructed under the fundamental assumption that secret keys are perfectly hidden from all possible attackers. In practice, however, keys and internal states may partially be leaked. Recently, cryptographic construction with key-leakage resilience has been a crucial research topic. In this work, we proposed an anonymous hierarchical identity-based encryption that can tolerate partial leakage of secret keys. Our results were as follows. First, we provided a tolerance for continual key leakage that can capture both memory leakage and continual leakage. We extended a dual-system encryption mechanism in orthogonal subgroups to achieve key-leakage resilience and implicitly employed an update algorithm to guard against continual leakage. Second, the delegation depth is unbounded, which means that no predetermined depth was imposed in the setup algorithm, thus making the scheme very flexible in practice. We employed a secret-sharing approach to split the master key into multiple shares in key components corresponding to the elements. Third, we analyzed and discussed the performance of allowable leakage-tolerance bounds and the leakage rate of the proposed scheme and gave an evaluation that attains about 40-70% leakage rate under the Advanced Encryption Standard 112 security level.
| Original language | English |
|---|---|
| Pages (from-to) | 1974-1987 |
| Number of pages | 14 |
| Journal | Security and Communication Networks |
| Volume | 7 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - Nov 1 2014 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Networks and Communications
Cite this
Unbounded anonymous hierarchical IBE with continual-key-leakage tolerance. / Zhang, Mingwu; Yang, Bo; Wang, Chunzhi; Takagi, Tsuyoshi.
In: Security and Communication Networks, Vol. 7, No. 11, 01.11.2014, p. 1974-1987.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Unbounded anonymous hierarchical IBE with continual-key-leakage tolerance
AU - Zhang, Mingwu
AU - Yang, Bo
AU - Wang, Chunzhi
AU - Takagi, Tsuyoshi
PY - 2014/11/1
Y1 - 2014/11/1
N2 - Modern cryptographic schemes are constructed under the fundamental assumption that secret keys are perfectly hidden from all possible attackers. In practice, however, keys and internal states may partially be leaked. Recently, cryptographic construction with key-leakage resilience has been a crucial research topic. In this work, we proposed an anonymous hierarchical identity-based encryption that can tolerate partial leakage of secret keys. Our results were as follows. First, we provided a tolerance for continual key leakage that can capture both memory leakage and continual leakage. We extended a dual-system encryption mechanism in orthogonal subgroups to achieve key-leakage resilience and implicitly employed an update algorithm to guard against continual leakage. Second, the delegation depth is unbounded, which means that no predetermined depth was imposed in the setup algorithm, thus making the scheme very flexible in practice. We employed a secret-sharing approach to split the master key into multiple shares in key components corresponding to the elements. Third, we analyzed and discussed the performance of allowable leakage-tolerance bounds and the leakage rate of the proposed scheme and gave an evaluation that attains about 40-70% leakage rate under the Advanced Encryption Standard 112 security level.
AB - Modern cryptographic schemes are constructed under the fundamental assumption that secret keys are perfectly hidden from all possible attackers. In practice, however, keys and internal states may partially be leaked. Recently, cryptographic construction with key-leakage resilience has been a crucial research topic. In this work, we proposed an anonymous hierarchical identity-based encryption that can tolerate partial leakage of secret keys. Our results were as follows. First, we provided a tolerance for continual key leakage that can capture both memory leakage and continual leakage. We extended a dual-system encryption mechanism in orthogonal subgroups to achieve key-leakage resilience and implicitly employed an update algorithm to guard against continual leakage. Second, the delegation depth is unbounded, which means that no predetermined depth was imposed in the setup algorithm, thus making the scheme very flexible in practice. We employed a secret-sharing approach to split the master key into multiple shares in key components corresponding to the elements. Third, we analyzed and discussed the performance of allowable leakage-tolerance bounds and the leakage rate of the proposed scheme and gave an evaluation that attains about 40-70% leakage rate under the Advanced Encryption Standard 112 security level.
UR - http://www.scopus.com/inward/record.url?scp=84910629070&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84910629070&partnerID=8YFLogxK
U2 - 10.1002/sec.912
DO - 10.1002/sec.912
M3 - Article
AN - SCOPUS:84910629070
VL - 7
SP - 1974
EP - 1987
JO - Security and Communication Networks
JF - Security and Communication Networks
SN - 1939-0122
IS - 11
ER -