TY - GEN
T1 - Fully Leakage-Resilient Codes
AU - Faonio, Antonio
AU - Nielsen, Jesper Buus
PY - 2017
Y1 - 2017
N2 - Leakage resilient codes (LRCs) are probabilistic encoding schemes that guarantee message hiding even under some bounded leakage on the codeword. We introduce the notion of fully leakage resilient codes (FLRCs), where the adversary can leak λ
0 bits from the encoding process, namely, the message and the randomness involved during the encoding process. In addition the adversary can as usual leak from the codeword. We give a simulation-based definition requiring that the adversary’s leakage from the encoding process and the codeword can be simulated given just λ
0 bits of leakage from the message. We give a fairly general impossibility result for FLRCs in the popular split-state model, where the codeword is broken into independent parts and where the leakage occurs independently on the parts. We then give two feasibility results for weaker models. First, we show that for NC
0-bounded leakage from the randomness and arbitrary poly-time leakage from the parts of the codeword the inner-product construction proposed by Daví et al. (SCN’10) and successively improved by Dziembowski and Faust (ASIACRYPT’11) is a FLRC for the split-state model. Second, we provide a compiler from any LRC to a FLRC in the common reference string model where the leakage on the encoding comes from a fixed leakage family of small cardinality. In particular, this compiler applies to the split-state model but also to other models.
AB - Leakage resilient codes (LRCs) are probabilistic encoding schemes that guarantee message hiding even under some bounded leakage on the codeword. We introduce the notion of fully leakage resilient codes (FLRCs), where the adversary can leak λ
0 bits from the encoding process, namely, the message and the randomness involved during the encoding process. In addition the adversary can as usual leak from the codeword. We give a simulation-based definition requiring that the adversary’s leakage from the encoding process and the codeword can be simulated given just λ
0 bits of leakage from the message. We give a fairly general impossibility result for FLRCs in the popular split-state model, where the codeword is broken into independent parts and where the leakage occurs independently on the parts. We then give two feasibility results for weaker models. First, we show that for NC
0-bounded leakage from the randomness and arbitrary poly-time leakage from the parts of the codeword the inner-product construction proposed by Daví et al. (SCN’10) and successively improved by Dziembowski and Faust (ASIACRYPT’11) is a FLRC for the split-state model. Second, we provide a compiler from any LRC to a FLRC in the common reference string model where the leakage on the encoding comes from a fixed leakage family of small cardinality. In particular, this compiler applies to the split-state model but also to other models.
KW - Feasibility results
KW - Fully-leakage resilience
KW - Impossibility
KW - Leakage-resilient cryptography
KW - Simulation-based definition
UR - http://www.scopus.com/inward/record.url?scp=85014465753&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-54365-8_14
DO - 10.1007/978-3-662-54365-8_14
M3 - Article in proceedings
SN - 978-3-662-54365-8
VL - 10174
T3 - Lecture Notes in Computer Science
SP - 333
EP - 358
BT - Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
A2 - Fehr, Serge
PB - Springer VS
CY - Berlin, Heidelberg
T2 - 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017
Y2 - 28 March 2017 through 31 March 2017
ER -