Let Me Prove It to You: RO PUFs Are Provably Learnable

Fatemeh Ganji, Shahin Tajik, Jean-Pierre Seifert. Let Me Prove It to You: RO PUFs Are Provably Learnable. In Soonhak Kwon, Aaram Yun, editors, Information Security and Cryptology - ICISC 2015 - 18th International Conference, Seoul, South Korea, November 25-27, 2015, Revised Selected Papers. Volume 9558 of Lecture Notes in Computer Science, pages 345-358, Springer, 2015. [doi]

@inproceedings{GanjiTS15-1,
  title = {Let Me Prove It to You: RO PUFs Are Provably Learnable},
  author = {Fatemeh Ganji and Shahin Tajik and Jean-Pierre Seifert},
  year = {2015},
  doi = {10.1007/978-3-319-30840-1_22},
  url = {http://dx.doi.org/10.1007/978-3-319-30840-1_22},
  researchr = {https://researchr.org/publication/GanjiTS15-1},
  cites = {0},
  citedby = {0},
  pages = {345-358},
  booktitle = {Information Security and Cryptology - ICISC 2015 - 18th International Conference, Seoul, South Korea, November 25-27, 2015, Revised Selected Papers},
  editor = {Soonhak Kwon and Aaram Yun},
  volume = {9558},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-30839-5},
}