作者: Antonio Faonio , Jesper Buus Nielsen
DOI: 10.1007/978-3-662-54365-8_14
关键词:
摘要: Leakage resilient codes (LRCs) are probabilistic encoding schemes that guarantee message hiding even under some bounded leakage on the codeword. We introduce notion of fully (FLRCs), where adversary can leak \(\lambda _0\) bits from process, namely, and randomness involved during process. In addition as usual give a simulation-based definition requiring adversary’s process codeword be simulated given just message. fairly general impossibility result for FLRCs in popular split-state model, is broken into independent parts occurs independently parts. then two feasibility results weaker models. First, we show \(\mathsf {NC}^0\)-bounded arbitrary poly-time inner-product construction proposed by Davi et al. (SCN’10) successively improved Dziembowski Faust (ASIACRYPT’11) FLRC model. Second, provide compiler any LRC to common reference string model comes fixed family small cardinality. particular, this applies but also other