Easy intruder deduction problems with homomorphisms
نویسندگان
چکیده
منابع مشابه
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, we extend the classical Dolev-Yao model by permitting the intruder to exploit these properties. More precisely, we are interested in theories such as Exclusive or and Abelian groups in combination with ...
متن کاملIntruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocols rely on rewriting techniques and automated deduction in order to implement or mimic the process calculus describing the protocol execution. We focus on the intruder deduction problem, that is the vulnerability to pa...
متن کاملRelation between Unification Problem and Intruder Deduction Problem
Intruder deduction problem constitutes the first step in cryptographic protocols verification for a passive intruder. In the case of an active intruder, we know that undecidability of the unification problem implies undecidability of the secrecy problem. In this paper, we analyze the link between the unification problem and the intruder deduction problem. Through examples using equational theor...
متن کاملReduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures
The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational theory implemented as a convergent rewriting system which involves rules for addition, multiplication and exponentiation. The whole deductive power of the intruder is modeled as a sequent calculus that, modulo this rewriting s...
متن کاملIntruder Deduction for the Equational Theory of Exclusive-or with Distributive Encryption *
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocols are based on rewriting techniques and automated deduction in order to implement or mimic the process calculus describing the execution of a protocol. We are interested in the intruder deduction problem, that is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2006
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.11.008