@article{DBLP:journals/iacr/AsharovEKP18,
  author    = {Gilad Asharov and
               Naomi Ephraim and
               Ilan Komargodski and
               Rafael Pass},
  title     = {On the Complexity of Compressing Obfuscation},
  journal   = {{IACR} Cryptology ePrint Archive},
  volume    = {2018},
  pages     = {552},
  year      = {2018},
  url       = {https://eprint.iacr.org/2018/552},
  timestamp = {Mon, 09 Jul 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/iacr/AsharovEKP18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"JDdr6s46vsmoaWcb7","bibbaseid":"asharov-ephraim-komargodski-pass-onthecomplexityofcompressingobfuscation-2018","downloads":0,"creationDate":"2018-08-01T01:02:28.573Z","title":"On the Complexity of Compressing Obfuscation","author_short":["Asharov, G.","Ephraim, N.","Komargodski, I.","Pass, R."],"year":2018,"bibtype":"article","biburl":"https://dblp.org/pid/49/11433.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Gilad"],"propositions":[],"lastnames":["Asharov"],"suffixes":[]},{"firstnames":["Naomi"],"propositions":[],"lastnames":["Ephraim"],"suffixes":[]},{"firstnames":["Ilan"],"propositions":[],"lastnames":["Komargodski"],"suffixes":[]},{"firstnames":["Rafael"],"propositions":[],"lastnames":["Pass"],"suffixes":[]}],"title":"On the Complexity of Compressing Obfuscation","journal":"IACR Cryptology ePrint Archive","volume":"2018","pages":"552","year":"2018","url":"https://eprint.iacr.org/2018/552","timestamp":"Mon, 09 Jul 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/bib/journals/iacr/AsharovEKP18","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/iacr/AsharovEKP18,\n author = {Gilad Asharov and\n Naomi Ephraim and\n Ilan Komargodski and\n Rafael Pass},\n title = {On the Complexity of Compressing Obfuscation},\n journal = {{IACR} Cryptology ePrint Archive},\n volume = {2018},\n pages = {552},\n year = {2018},\n url = {https://eprint.iacr.org/2018/552},\n timestamp = {Mon, 09 Jul 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/iacr/AsharovEKP18},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Asharov, G.","Ephraim, N.","Komargodski, I.","Pass, R."],"key":"DBLP:journals/iacr/AsharovEKP18","id":"DBLP:journals/iacr/AsharovEKP18","bibbaseid":"asharov-ephraim-komargodski-pass-onthecomplexityofcompressingobfuscation-2018","role":"author","urls":{"Paper":"https://eprint.iacr.org/2018/552"},"downloads":0},"search_terms":["complexity","compressing","obfuscation","asharov","ephraim","komargodski","pass"],"keywords":[],"authorIDs":[],"dataSources":["WkouaWowTAZvaSMYX"]}