Skip to main content
SpringerLink
Log in

Reducing Equational Theories for the Decision of Static Equivalence

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static equivalence modulo equational theories allows for a more accurate representation of cryptographic primitives by modelling properties of operators by equational axioms. We develop a method that allows us in some cases to simplify the task of deciding static equivalence in a multi-sorted setting, by removing a symbol from the term signature and reducing the problem to several simpler equational theories. We illustrate our technique at hand of bilinear pairings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theor. Comp. Sci. 367(1), 2–32 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’01), pp. 104–115. ACM Press (2001)

  3. Arnaud, M., Cortier, V., Delaune, S.: Combining algorithms for deciding knowledge in security protocols. In: Proceedings of the 6th International Symposium on Frontiers of Combining Systems (FroCoS’07). Lecture Notes in Computer Science, vol. 4720, pp. 103–117. Springer (2007)

  4. Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS’05), pp. 16–25. ACM Press (2005)

  5. Baudet, M., Cortier, V., Delaune, S.: YAPA: a generic tool for computing intruder knowledge. In: Treinen, R. (ed.) Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA’09). Lecture Notes in Computer Science, Brasília, Brazil, vol. 5595, pp. 148–163. Springer (2009)

  6. Baudet, M., Cortier, V., Kremer, S.: Computationally sound implementations of equational theories against passive adversaries. Inf. Comput. 207(4), 496–520 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. Journal of Logic and Algebraic Programming 75(1), 3–51 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. In: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology (CRYPTO’01). Lecture Notes in Computer Science, vol. 2139, pp. 213–229. Springer (2001)

  9. Chevalier, Y., Rusinowitch, M.: Hierarchical combination of intruder theories. Inf. Comput. 206(2–4), 352–377 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ciobâcă, Ş., Delaune, S., Kremer, S.: Computing knowledge in security protocols under convergent equational theories. In: Schmidt, R. (ed.) Proceedings of the 22nd International Conference on Automated Deduction (CADE’09). Lecture Notes in Computer Science, Montreal, Canada, pp. 355–370. Springer (2009)

  11. Comon, H.: Inductionless induction. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 913–962. Elsevier (2001)

  12. Corin, R., Doumen, J., Etalle, S.: Analysing password protocol security against off-line dictionary attacks. In: Proceedings of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models (WISP 2004). ENTCS, vol. 121, pp. 47–63. Elsevier (2004)

  13. Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. J. Comput. Secur. 14(1), 1–43 (2006)

    Google Scholar 

  14. Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Trans. Inf. Theory 29(2), 198–208 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  15. Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Proceedings of the 4th International Symposium on Algorithmic Number Theory (ANTS-IV). Lecture Notes in Computer Science, vol. 1838, pp. 385–394. Springer (2000)

  16. Kremer, S., Mazaré, L.: Adaptive soundness of static equivalence. In: Proceedings of the 12th European Symposium on Research in Computer Security (ESORICS’07). Lecture Notes in Computer Science, vol. 4734, pp. 610–625. Springer (2007)

  17. Kremer, S., Mazaré, L.: Computationally sound analysis of protocols using bilinear pairings. J. Comput. Secur. (2010, to appear)

  18. Kremer, S., Mercier, A., Treinen, R.: Reducing equational theories for the decision of static equivalence. In: Datta, A. (ed.) Proceedings of the 13th Asian Computing Science Conference (ASIAN’09). Lecture Notes in Computer Science, Seoul, Korea, vol. 5913, pp. 94–108. Springer (2009)

Download references

Author information

Authors and Affiliations

  1. LSV, ENS Cachan, CNRS, INRIA, Cachan, France

    Steve Kremer & Antoine Mercier

  2. PPS, Université Paris Diderot - Paris 7, CNRS, Paris, France

    Ralf Treinen

Authors
  1. Steve Kremer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antoine Mercier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ralf Treinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Steve Kremer.

Additional information

This work has been partially supported by the ANR-07-SESU-002 project AVOTÉ.

A preliminary version has been published in [18].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kremer, S., Mercier, A. & Treinen, R. Reducing Equational Theories for the Decision of Static Equivalence. J Autom Reasoning 48, 197–217 (2012). https://doi.org/10.1007/s10817-010-9203-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-010-9203-0

Keywords

Search

Navigation