On the computational soundness of cryptographically masked flows

Peeter Laud. On the computational soundness of cryptographically masked flows. In George C. Necula, Philip Wadler, editors, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008. pages 337-348, ACM, 2008. [doi]

@inproceedings{Laud08,
  title = {On the computational soundness of cryptographically masked flows},
  author = {Peeter Laud},
  year = {2008},
  doi = {10.1145/1328438.1328479},
  url = {http://doi.acm.org/10.1145/1328438.1328479},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/Laud08},
  cites = {0},
  citedby = {0},
  pages = {337-348},
  booktitle = {Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008},
  editor = {George C. Necula and Philip Wadler},
  publisher = {ACM},
  isbn = {978-1-59593-689-9},
}