[RSS17] Can PPAD Hardness be Based on Standard Cryptographic Assumptions?

Authors: Alon Rosen, Gil Segev, Ido Shahaf | Venue: TCC 2017 | Source

Notes

• Journal version: Journal of Cryptology 34(1), article 8, 2021, doi:10.1007/s00145-020-09369-6 (cryptobib JC:RosSegSha21).

BibTeX

Copy

@Inproceedings{TCC:RosSegSha17,
  author = {Alon Rosen and Gil Segev and Ido Shahaf},
  title = {Can {PPAD} Hardness be Based on Standard Cryptographic Assumptions?},
  pages = {747--776},
  editor = {Yael Kalai and Leonid Reyzin},
  booktitle = {TCC~2017: 15th Theory of Cryptography Conference, Part~II},
  volume = {10678},
  series = {Lecture Notes in Computer Science},
  address = {Baltimore, MD, USA},
  month = {nov~12--15},
  publisher = {Springer, Cham, Switzerland},
  year = {2017},
  doi = {10.1007/978-3-319-70503-3_25},
}