On the impossibility of approximate obfuscation and applications to resettable cryptography

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Conference

Publisher: ACM

Publication date (Print): June 2013

Publication date (Online): June 2013

Publication date (Print): June 2013

Publication date (Electronic): June 2013

Pages: 241-250

Affiliations

[1 ]Tel Aviv University, Tel Aviv, MA, USA

[2 ]Boston University, Boston, MA, USA

Article

DOI: 10.1145/2488608.2488639

SO-VID: 913ff036-6485-4ef2-a351-1fff371bfcd9

Conference name: STOC'13: Symposium on Theory of Computing

Conference acronym: STOC'13

Conference location: Palo Alto California USA

Conference date: 01 06 2013 04 06 2013

Conference sponsor: SIGACT ACM Special Interest Group on Algorithms and Computation Theory

History

ScienceOpen disciplines: Quantitative & Systems biology,Biophysics

Data availability:

ScienceOpen disciplines: Quantitative & Systems biology, Biophysics

On the impossibility of approximate obfuscation and applications to resettable cryptography

Read this article at

Related collections

iGEM

Author and article information

Conference

Affiliations

Article

History

Comments

Comment on this article

Similar content 2,174

Cited by 4