| | |
Summary: Reduction of the Intruder Deduction Problem
into Equational Elementary Deduction for
Electronic Purse Protocols with Blind
Signatures
Daniele Nantes Sobrinho1
and Mauricio Ayala-Rinc´on1,2
Grupo de Teoria da Computa¸c~ao
Departamentos de 1
Matem´atica e 2
Ci^encia da Computa¸c~ao
Universidade de Bras´ilia
daniele.nantes@gmail.com, ayala@unb.br
Abstract. The intruder deduction problem for an electronic purse pro-
tocol with blind signatures is considered. The algebraic properties of the
protocol are modeled by an equational theory implemented as a con-
vergent rewriting system which involves rules for addition, multiplica-
tion and exponentiation. The whole deductive power of the intruder is
modeled as a sequent calculus that, modulo this rewriting system, deals
with blind signatures. It is proved that the associative-commutative (AC)
equality of the algebraic theory can be decided in polynomial time, pro-
|
