S. Reza Sefidgar

According to our database, S. Reza Sefidgar authored at least 12 papers between 2016 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Formal Verification of Composable Security Proofs.

S. Reza Sefidgar

PhD thesis, 2021

Constructive Cryptography in HOL: the Communication Modeling Aspect.

Andreas Lochbihler, S. Reza Sefidgar

Arch. Formal Proofs, 2021

Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL.

David A. Basin, Andreas Lochbihler, Ueli Maurer, S. Reza Sefidgar

Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020

CryptHOL: Game-Based Proofs in Higher-Order Logic.

David A. Basin, Andreas Lochbihler, S. Reza Sefidgar

J. Cryptol., 2020

2019

Formalizing Network Flow Algorithms: A Refinement Approach in Isabelle/HOL.

Peter Lammich, S. Reza Sefidgar

J. Autom. Reason., 2019

Formalizing Constructive Cryptography using CryptHOL.

Andreas Lochbihler, S. Reza Sefidgar, David A. Basin, Ueli Maurer

Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018

A tutorial introduction to CryptHOL.

Andreas Lochbihler, S. Reza Sefidgar

IACR Cryptol. ePrint Arch., 2018

Constructive Cryptography in HOL.

Andreas Lochbihler, S. Reza Sefidgar

Arch. Formal Proofs, 2018

2017

Game-based cryptography in HOL.

Andreas Lochbihler, S. Reza Sefidgar, Bhargav Bhatt

Arch. Formal Proofs, 2017

Formalizing Push-Relabel Algorithms.

Peter Lammich, S. Reza Sefidgar

Arch. Formal Proofs, 2017

Flow Networks and the Min-Cut-Max-Flow Theorem.

Peter Lammich, S. Reza Sefidgar

Arch. Formal Proofs, 2017

2016

Formalizing the Edmonds-Karp Algorithm.

Peter Lammich, S. Reza Sefidgar

Arch. Formal Proofs, 2016