A Computationally Complete Symbolic Attacker for Equivalence Properties

@inproceedings{Bana2014ACC,
  title={A Computationally Complete Symbolic Attacker for Equivalence Properties},
  author={Gergei Bana and Hubert Comon-Lundh},
  booktitle={ACM Conference on Computer and Communications Security},
  year={2014}
}
  • Gergei Bana, Hubert Comon-Lundh
We consider the problem of computational indistinguishability of protocols. We design a symbolic model, amenable to automated deduction, such that a successful inconsistency proof implies computational indistinguishability. Conversely, symbolic models of distinguishability provide clues for likely computational attacks. We follow the idea we introduced earlier for reachability properties, axiomatizing what an attacker cannot violate. This results a computationally complete symbolic attacker… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

Decidability of a Sound Set of Inference Rules for Computational Indistinguishability

  • 2019 IEEE 32nd Computer Security Foundations Symposium (CSF)
  • 2019
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

The 5G-AKA Authentication Protocol Privacy

  • 2019 IEEE European Symposium on Security and Privacy (EuroS&P)
  • 2018
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Formal Computational Unlinkability Proofs of RFID Protocols

  • 2017 IEEE 30th Computer Security Foundations Symposium (CSF)
  • 2017
VIEW 10 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS

Formal Computational Unlinkability Proofs of RFID Protocols Anonymous Submission

  • 2017
VIEW 9 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Formal Proofs of Security Protocols

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.