Paper 2017/1244
Corrections to ''Further Improving Efficiency of Higher-Order Masking Schemes by Decreasing Randomness Complexity''
Shuang Qiu, Rui Zhang, Yongbin Zhou, and Wei Cheng
Abstract
Provably secure masking schemes always require too many random generations, which signficantly increases the implementation cost. Recently in IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY (TIFS) (DOI:10.1109/TIFS.2017.2713323), Zhang, Qiu, and Zhou improve the efficiency of the CPRR scheme by decreasing the random generations. Recently, Barthe et al. claim that security flaws exist in both proposals and provide the counter-examples. In this paper, we fix these security flaws by changing the addition order. In this way, the two proposals are corrected with no extra random generation.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint. MAJOR revision.
- Keywords
- masking schemeside-channel attacksprobing modelrandomness complexity
- Contact author(s)
-
r-zhang @ iie ac cn
qiushuang @ iie ac cn - History
- 2017-12-27: last of 3 revisions
- 2017-12-26: received
- See all versions
- Short URL
- https://ia.cr/2017/1244
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/1244,
author = {Shuang Qiu and Rui Zhang and Yongbin Zhou and Wei Cheng},
title = {Corrections to ''Further Improving Efficiency of Higher-Order Masking Schemes by Decreasing Randomness Complexity''},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/1244},
year = {2017},
url = {https://eprint.iacr.org/2017/1244}
}
