Abstract
We present the results of preliminary experiments implementing the Candidate Indistinguishability Obfuscation algorithm recently proposed by Garg et al. [1]. We show how different parameters of the input circuits impact the performance and the size of the obfuscated programs. On the negative side, our benchmarks show that for the time being the algorithm is far away from being practical. On the positive side, there is still much room for improvement in our implementation. We discuss bottlenecks encountered and optimization possibilities. In order to foster further improvements by the community, we make our implementation public.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garg, S., Gentry, C., Halevi, S., Raykova, M.: A Sahai, and B. Waters. Candidate indistinguishability obfuscation and functional encryption for all circuits. In: Proc. of the 54th Annual Symp. on Foundations of Computer Science, pp. 40–49 (2013)
Zhou, W., Wang, Z., Zhou, Y., Jiang, X.: Divilar: Diversifying intermediate language for anti-repackaging on android platform. In: Proc. of the 4th ACM Conf. on Data and Application Security and Privacy, pp. 199–210. ACM (2014)
Collberg, C., Thomborson, C., Low, D.: A taxonomy of obfuscating transformations. Technical report, Department of Computer Science, The University of Auckland, New Zealand (1997)
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (Im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1–18. Springer, Heidelberg (2001)
Edwards, C.: Researchers probe security through obscurity. Communications of the ACM 57(8), 11–13 (2014)
Arora, S., Barak, B.: Computational complexity: a modern approach. Cambridge University Press (2009)
Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in nc1. In: Proc. of the 18th Annual ACM Symp. on Theory of Computing, STOC 1986, pp. 1–5. ACM, New York (1986)
Kilian, J.: Founding crytpography on oblivious transfer. In: Proc. of the 20th Annual ACM Symp. on Theory of Computing, pp. 20–31. ACM (1988)
Schneider, T.: Practical secure function evaluation. Master’s thesis, Friedrich-Alexander-Universität Erlangen-Nürnberg (2008)
Valiant, L.G.: Universal circuits (preliminary report). In: Proc. of the 8th Annual ACM Symp. on Theory of Computing, pp. 196–203. ACM (1976)
Ananth, P., Gupta, D., Ishai, Y., Sahai, A.: Optimizing obfuscation: Avoiding barrington’s theorem. IACR Cryptology ePrint Archive 2014, 222 (2014)
Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proc. of the 3rd ACM Workshop on Cloud Computing Security, pp. 113–124. ACM (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Banescu, S., Ochoa, M., Kunze, N., Pretschner, A. (2015). Idea: Benchmarking Indistinguishability Obfuscation – A Candidate Implementation. In: Piessens, F., Caballero, J., Bielova, N. (eds) Engineering Secure Software and Systems. ESSoS 2015. Lecture Notes in Computer Science, vol 8978. Springer, Cham. https://doi.org/10.1007/978-3-319-15618-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-15618-7_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15617-0
Online ISBN: 978-3-319-15618-7
eBook Packages: Computer ScienceComputer Science (R0)