Mechanized Proofs of Adversarial Complexity and Application to Universal Composability. Barbosa, M., Barthe, G., Grégoire, B., Koutsos, A., & Strub, P. In Kim, Y., Kim, J., Vigna, G., & Shi, E., editors, CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021, pages 2541–2563, 2021. ACM.
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability [link]Paper  doi  bibtex   1 download  
@inproceedings{DBLP:conf/ccs/BarbosaBGKS21,
  author = {Manuel Barbosa and Gilles Barthe and
Benjamin Gr{\'{e}}goire and Adrien Koutsos and
Pierre{-}Yves Strub},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl = {https://dblp.org/rec/conf/ccs/BarbosaBGKS21.bib},
  booktitle = {{CCS} '21: 2021 {ACM} {SIGSAC} Conference on Computer
and Communications Security, Virtual Event, Republic
of Korea, November 15 - 19, 2021},
  doi = {10.1145/3460120.3484548},
  editor = {Yongdae Kim and Jong Kim and Giovanni Vigna and
Elaine Shi},
  isbn = {978-1-4503-8454-4},
  pages = {2541--2563},
  publisher = {{ACM}},
  timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
  title = {Mechanized Proofs of Adversarial Complexity and
Application to Universal Composability},
  url = {https://doi.org/10.1145/3460120.3484548},
  year = {2021}
}

Downloads: 1