Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952275 | Theoretical Computer Science | 2017 | 34 Pages |
Abstract
Our main constructions have leakage rate 1âo(1), and are proven secure in the standard model. We additionally give a construction in the BRM, relying on a random oracle. All of our schemes are described in terms of generic building blocks, but also admit efficient instantiations under fairly standard number-theoretic assumptions. Finally, we explain how to extend some of our schemes to the setting of noisy leakage, where the only restriction on the leakage functions is that the output does not decrease the min-entropy of the secret key by too much.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi,