On the Compressibility of NP Instances and Cryptographic Applications

Danny Harnik, Moni Naor. On the Compressibility of NP Instances and Cryptographic Applications. Electronic Colloquium on Computational Complexity (ECCC), 13(022), 2006. [doi]

@article{HarnikN06,
  title = {On the Compressibility of NP Instances and Cryptographic Applications},
  author = {Danny Harnik and Moni Naor},
  year = {2006},
  url = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-022/index.html},
  researchr = {https://researchr.org/publication/HarnikN06},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {13},
  number = {022},
}