Boaz Barak
- Apon, D., Huang, Y., Katz, J., Malozemoff, A.J. Implementing cryptographic program obfuscation. Cryptology ePrint Archive, Report 2014/779, 2014. http://eprint.iacr.org/.Google Scholar
- Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A. Protecting obfuscation against algebraic attacks. In EUROCRYPT, 2014, pp. 221--238.Google ScholarCross Ref
- Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K. On the (im) possibility of obfuscating programs. J. ACM 59, 2 (2012), 6. Preliminary version in CRYPTO 2001. Google ScholarDigital Library
- Barrington, D.A.M. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38, 1 (1989), 150--164. Preliminary version in STOC 1986. Google ScholarDigital Library
- Boneh, D., Sahai, A., Waters, B. Functional encryption: A new vision for public-key cryptography. Commun. ACM 55, 11 (2012), 56--64. Google ScholarDigital Library
- Boneh, D., Silverberg, A. Applications of multilinear forms to cryptography. Contemp. Math. 324, 1 (2003), 71--90. Preliminary version posted on eprint on 2002, see https://eprint.iacr.org/2002/080.Google Scholar
- Brakerski, Z., Rothblum, G.N. Obfuscating conjunctions. In CRYPTO, 2013, 416--434.Google Scholar
- Brakerski, Z., Rothblum, G.N. Virtual black-box obfuscation for all circuits via generic graded encoding. In TCC, 2014, 1--25.Google Scholar
- Coron, J., Gentry, C., Halevi, S., Lepoint, T., Maji, H.K., Miles, E., Raykova, M., Sahai, A., Tibouchi, M. Zeroizing without low-level zeroes: New MMAP attacks and their limitations. In Proceedings of the Advances in Cryptology -- CRYPTO 2015 -- 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16--20, 2015, Part I, 2015, 247--266.Google ScholarCross Ref
- Coron, J.-S. Cryptanalysis of GGH15 multilinear maps. Cryptology ePrint Archive, Report 2015/1037, 2015. http://eprint.iacr.org/.Google Scholar
- Diffie, W., Hellman, M.E. New directions in cryptography. IEEE Trans. Inform. Theory 22, 6 (1976), 644--654. Google ScholarDigital Library
- Garg, S., Gentry, C., Halevi, S. Candidate multilinear maps from ideal lattices. In EUROCRYPT, 2013. See also CRyptology ePrint Archive, Report 2012/610.Google Scholar
- Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B. Candidate indistinguishability obfuscation and functional encryption for all circuits. In FOCS, 2013, 40--49. Google ScholarDigital Library
- Gentry, C. Fully homomorphic encryption using ideal lattices. In STOC, 2009, 169--178. Google ScholarDigital Library
- Gentry, C. Computing on the edge of Chaos: Structure and randomness in encrypted computation. Proceedings of the 2014 International Congress of Mathematicians (ICM), 2014. Also available online at http://eprint.iacr.org/2014/610.Google Scholar
- Gentry, C., Sahai, A., Waters, B. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In CRYPTO, 2013, 75--92.Google Scholar
- Goldwasser, S., Micali, S. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2 (1984), 270--299. Preliminary version in STOC 1982.Google ScholarCross Ref
- Green, M. Cryptographic obfuscation and 'unhackable' software, 2014. Blog post. Available at: http://blog.cryptographyengineering.com/2014/02/cryptographic-obfuscation-and.html.Google Scholar
- Jacob, M., Boneh, D., Felten, E. Attacking an obfuscated cipher by injecting faults. In Digital Rights Management. Springer, 2003, 16--31.Google Scholar
- Joux, A. A one round protocol for tripartite Diffie-Hellman. J. Cryptol. 17, 4 (2004), 263--276. Preliminary version in ANTS 2000. Google ScholarDigital Library
- Popa, R.A., Redfield, C.M.S., Zeldovich, N., Balakrishnan, H. CryptDB: Processing queries on an encrypted database. Commun. ACM 55, 9 (2012), 103--111. Google ScholarDigital Library
- Regev, O. On lattices, learning with errors, random linear codes, and cryptography. J. ACM 55, 6 (2009). Preliminary version in STOC 2005. Google ScholarDigital Library
- Rivest, R.L., Adleman, L., Dertouzos, M.L. On data banks and privacy homomorphisms. Found. Secure Comput. 4, 11 (1978), 169--180.Google Scholar
- Rivest, R.L., Shamir, A., Adleman, L.M. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (1978), 120--126. Google ScholarDigital Library
Index Terms
- Hopes, fears, and software obfuscation
Recommendations
Protecting Software through Obfuscation: Can It Keep Pace with Progress in Code Analysis?
Software obfuscation has always been a controversially discussed research area. While theoretical results indicate that provably secure obfuscation in general is impossible, its widespread application in malware and commercial software shows that it is ...
Code Obfuscation: Why is This Still a Thing?
CODASPY '18: Proceedings of the Eighth ACM Conference on Data and Application Security and PrivacyEarly developments in code obfuscation were chiefly motivated by the needs of Digital Rights Management (DRM). Other suggested applications included intellectual property protection of software and code diversification to combat the monoculture problem ...
Obfuscation: The Hidden Malware
A cyberwar exists between malware writers and antimalware researchers. At this war's heart rages a weapons race that originated in the 80s with the first computer virus. Obfuscation is one of the latest strategies to camouflage the telltale signs of ...
Comments