Secrecy of cryptographic protocols under equational theory

Authors:
H. Houmani;M. Mejri;H. Fujita
Affiliations:
3988, Pavillon Adrien-Pouliot, Université Laval, Ste-Foy, G1K 7P4 Canada;3988, Pavillon Adrien-Pouliot, Université Laval, Ste-Foy, G1K 7P4 Canada;Iwate Prefectural University, 152-52 Sugo Takizawa, Iwate, 020-0193 Japan
Venue:
Knowledge-Based Systems
Year:
2009

Citing 10
Cited 3

Rewrite systems

Handbook of theoretical computer science (vol. B)
A lesson on authentication protocol design

ACM SIGOPS Operating Systems Review
Secrecy by typing in security protocols

Journal of the ACM (JACM)
Mechanized proofs for a recursive authentication protocol

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Temporal Rank Functions for Forward Secrecy

CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Deciding knowledge in security protocols under equational theories

Theoretical Computer Science - Automated reasoning for security protocol analysis
Secrecy by interpretation functions

Knowledge-Based Systems
Sufficient Conditions for Secrecy under Any Equational Theories

ISA '08 Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008)
New decidability results for fragments of first-order logic and application to cryptographic protocols

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
What makes a cryptographic protocol secure? the evolution of requirements specification in formal cryptographic protocol analysis

ESOP'03 Proceedings of the 12th European conference on Programming

CRM: An efficient trust and reputation model for agent computing

Knowledge-Based Systems
Executing SQL queries over encrypted character strings in the Database-As-Service model

Knowledge-Based Systems
A formal methodology for integral security design and verification of network protocols

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives a novel approach to verify the secrecy property of cryptographic protocols under equational theories. Indeed, by using the notion of interpretation functions, this paper presents some sufficient and practical conditions allowing to guarantee the secrecy property of cryptographic protocols under any equational theory. An interpretation function is a safe means by which an agent can estimate the security level of message components that he receives so that he can handle them correctly. Also, this paper proves that polynomials help a lot with the construction of an interpretation function and gives a guideline on how to construct such functions together with an example and how to use it to analyse a cryptographic protocol.