A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Symbolic Methods in Computational Cryptography Proofs
2019
2019 IEEE 32nd Computer Security Foundations Symposium (CSF)
Code-based game-playing is a popular methodology for proving security of cryptographic constructions and sidechannel countermeasures. This methodology relies on treating cryptographic proofs as an instance of relational program verification (between probabilistic programs), and decomposing the latter into a series of elementary relational program verification steps. In this paper, we develop principled methods for proving such elementary steps for probabilistic programs that operate over finite
doi:10.1109/csf.2019.00017
dblp:conf/csfw/BartheGJKS19
fatcat:bdp72veonjdvbksf32gbqwqmxu