Paper 2010/202 Original: eprint.iacr.org/2010/202 ↗
Robust Combiner for Obfuscators
Abstract
Practical software hardening schemes are heuristic and are not proven to be secure. One technique to enhance security is {\em robust combiners}. An algorithm $C$ is a robust combiner for specification $S$, e.g., privacy, if for any two implementations $X$ and $Y$, of a cryptographic scheme, the combined scheme $C(X,Y)$ satisfies $S$ provided {\em either} $X$ {\em or} $Y$ satisfy $S$. We present the first robust combiner for software hardening, specifically for obfuscation \cite{barak:obfuscation}. Obfuscators are software hardening techniques that are employed to protect execution of programs in remote, hostile environment. Obfuscators protect the code (and secret data) of the program that is sent to the remote host for execution. Robust combiners are particularly important for software hardening, where there is no standard whose security is established. In addition, robust combiners for software hardening are interesting from software engineering perspective since they introduce new techniques of software only fault tolerance.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2010-04-16: last updated
- 2010-04-16: published
- Short URL
- https://ia.cr/2010/202
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/202,
author = {Amir Herzberg and Haya Shulman},
title = {Robust Combiner for Obfuscators},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/202},
year = {2010},
url = {https://eprint.iacr.org/2010/202}
}