Analyzing an Electronic Cash Protocol Using Applied Pi Calculus

Authors:
Zhengqin Luo;Xiaojuan Cai;Jun Pang;Yuxin Deng
Affiliations:
BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China;BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China;Carl von Ossietzky Universität Oldenburg, Department für Informatik, 26111 Oldenburg, Germany;BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China
Venue:
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Year:
2007

Citing 26
Cited 2

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
A calculus of mobile processes, I

Information and Computation
A calculus of mobile processes, II

Information and Computation
Untraceable off-line cash in wallet with observers

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Single term off-line coins

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A calculus for cryptographic protocols

Information and Computation
Communicating sequential processes

Communications of the ACM
Mobile values, new names, and secure communication

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Secure and Efficient Off-Line Digital Money (Extended Abstract)

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
CSP and Anonymity

ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Reasoning about Cryptographic Protocols in the Spi Calculus

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Probabilistic Asynchronous pi-Calculus

FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Untraceable Electronic Cash

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
µCRL: A Toolset for Analysing Algebraic Specifications

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
An Efficient Off-line Electronic Cash System Based On The Representation Problem.

An Efficient Off-line Electronic Cash System Based On The Representation Problem.
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Private authentication

Theoretical Computer Science - Special issue: Foundations of wide area network computing
Automated Verification of Selected Equivalences for Security Protocols

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Deciding knowledge in security protocols under equational theories

Theoretical Computer Science - Automated reasoning for security protocol analysis
Weak Probabilistic Anonymity

Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for automatically checking anonymity with µCRL

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Measuring anonymity with relative entropy

FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Analysing the MUTE anonymous file-sharing system using the pi-calculus

FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Analysis of an electronic voting protocol in the applied pi calculus

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
PRISM: a tool for automatic verification of probabilistic systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Measuring Anonymity

ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Verifying Anonymous Credential Systems in Applied Pi Calculus

CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Untraceabilityand unreuseabilityare essential security properties for electronic cash protocols. Many protocols have been proposed to meet these two properties. However, most of them have not been formally proved to be untraceable and unreuseable. In this paper we propose to use the applied pi calculus as a framework for describing and analyzing electronic cash protocols, and we analyze Ferguson's electronic cash protocol as a case study. We believe that this approach is suitable for many different electronic cash protocols.