Bibliographic Details
| Title: |
Indistinguishable Leakage-Resilient Circuit Compiler. |
| Authors: |
Xu, Shiyou, Wang, Jian, Wang, Liangliang |
| Source: |
Computer Journal; Jul2023, Vol. 66 Issue 7, p1717-1732, 16p |
| Subject Terms: |
Compilers (Computer programs), Cryptography, Problem solving, Leakage |
| Abstract: |
Transforming any circuit into a circuit with the same functionality but resilience against well-defined classes of leakage is an essential subject of cryptography. Whereas, according to the relationship between |$VBB$| and simulated leakage-resilient circuit compiler, the compiling needs a specific mechanism to guarantee that its input is free of any leakage. Unfortunately, it makes it tough to implement this strategy in the context of actual leaks. In this work, we formally propose the indistinguishable bounded leakage-resilient circuit compiler |$\bar{C}$| to solve the problem mentioned above. Specifically, it specifies that any polynomial-time adversary who derives the bound secret information from the circuit compiler can not distinguish an equivalent compiled circuit |$\bar{C}^{\prime}$| with the same output. To achieve this goal, first, we utilize the leakage-resilient indistinguishable encoding as its input. Second, it takes advantage of the indistinguishability obfuscation |$(IO)$| program to construct an obfuscated circuit that removes the random coins of the input encoding. Its total running time is the original circuit |$C$| running time plus |$poly(\kappa)$| , and the size is independent of the original |$C$|. As this new compiler overcomes the restriction of the simulated-based leakage resilient circuit compiler,it will bring an independent interest result in leakage-resilient cryptography. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |