Probabilistic relational verification for cryptographic implementations. Barthe, G., Fournet, C., Grégoire, B., Strub, P., Swamy, N., & Béguelin, S. Z. In Jagannathan, S. & Sewell, P., editors, The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014, pages 193–206, 2014. ACM.
Probabilistic relational verification for cryptographic implementations [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/popl/BartheFGSSB14,
  author = {Gilles Barthe and C{\'{e}}dric Fournet and
Benjamin Gr{\'{e}}goire and Pierre{-}Yves Strub and
Nikhil Swamy and Santiago Zanella B{\'{e}}guelin},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl = {https://dblp.org/rec/conf/popl/BartheFGSSB14.bib},
  booktitle = {The 41st Annual {ACM} {SIGPLAN-SIGACT} Symposium on
Principles of Programming Languages, {POPL} '14, San
Diego, CA, USA, January 20-21, 2014},
  doi = {10.1145/2535838.2535847},
  editor = {Suresh Jagannathan and Peter Sewell},
  isbn = {978-1-4503-2544-8},
  pages = {193--206},
  publisher = {{ACM}},
  timestamp = {Thu, 24 Jun 2021 16:19:31 +0200},
  title = {Probabilistic relational verification for
cryptographic implementations},
  url = {https://doi.org/10.1145/2535838.2535847},
  year = {2014}
}

Downloads: 0