Satisfiability of general intruder constraints with and without a set constructor

From MaRDI portal
Revision as of 07:24, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:507349


DOI10.1016/j.jsc.2016.07.009zbMath1356.68269MaRDI QIDQ507349

Yannick Chevalier, Tigran Avanesov, Mathieu Turuani, Michaël Rusinowitch

Publication date: 6 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: http://oatao.univ-toulouse.fr/22621/1/avanesov_22621.pdf


68W30: Symbolic computation and algebraic computation

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing


Related Items



Cites Work