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 system, deals with blind signatures. It is proved that the associative-commutative (AC) equality of the algebraic theory can be decided in polynomial time, provided a strategy to avoid distributivity law between the AC operators is adopted. Moreover, it is also shown that the intruder deduction problem can be reduced in polynomial time to the elementary deduction problem for this equational theory.
Unable to display preview. Download preview PDF.
- 2.Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Google Scholar
- 4.Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems by TeReSe. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)Google Scholar
- 5.Bull, J., Otwary, D.J.: The authetication protocol. Technical Report CIS3/PROJ/CORBA/SC/1/CSM/436-04/03, Defense Research Agency (1997)Google Scholar
- 7.Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security 14(1), 1–43 (2006)Google Scholar
- 8.Delaune, S.: Vérification des protocoles cryptographiques et propriétés algébriques. PhD thesis, École Normale Supérieure de Cachan (2006)Google Scholar
- 11.Schneier, B.: Applied Cryptography. John Wiley & Sons, Inc., Chichester (1996)Google Scholar