On the impossibility of approximate obfuscation and applications to resettable cryptography

Nir Bitansky, Omer Paneth. On the impossibility of approximate obfuscation and applications to resettable cryptography. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 241-250, ACM, 2013. [doi]

@inproceedings{BitanskyP13,
  title = {On the impossibility of approximate obfuscation and applications to resettable cryptography},
  author = {Nir Bitansky and Omer Paneth},
  year = {2013},
  doi = {10.1145/2488608.2488639},
  url = {http://doi.acm.org/10.1145/2488608.2488639},
  researchr = {https://researchr.org/publication/BitanskyP13},
  cites = {0},
  citedby = {0},
  pages = {241-250},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
  editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
  publisher = {ACM},
  isbn = {978-1-4503-2029-0},
}