Modelling the Security of Smart Cards by Hard and Soft Types for Higher-Order Mobile Embedded Resources

Authors:
Mikkel Bundgaard;Thomas Hildebrandt;Jens Chr. Godskesen
Affiliations:
IT University of Copenhagen, Rued Langgaards Vej 7, DK-2300 Copenhagen S, Denmark;IT University of Copenhagen, Rued Langgaards Vej 7, DK-2300 Copenhagen S, Denmark;IT University of Copenhagen, Rued Langgaards Vej 7, DK-2300 Copenhagen S, Denmark
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 18
Cited 1

Operational interpretations of linear logic

Theoretical Computer Science - Special issue on linear logic, 1
Linearity and the pi-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Mobile ambients

Theoretical Computer Science
Assigning types to processes

Information and Computation
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
The m-calculus: a higher-order distributed process calculus

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Calculus of Mobile Resources

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On the expressive power of polyadic synchronisation in π-calculus

Nordic Journal of Computing
Access control for mobile agents: The calculus of boxed ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Channel dependent types for higher-order mobile processes

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Seal Calculus

Information and Computation
Genericity and the π-calculus

Acta Informatica
A CPS encoding of name-passing in higher-order mobile embedded resources

Theoretical Computer Science - Expressiveness in concurrency
A lambda calculus for quantum computation with classical control

Mathematical Structures in Computer Science
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names

Electronic Notes in Theoretical Computer Science (ENTCS)
Sequentiality and the π-calculus

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Extending howe's method to early bisimulations for typed mobile embedded resources with local names

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The kell calculus: a family of higher-order distributed process calculi

GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing

Formalizing higher-order mobile embedded business processes with binding bigraphs

COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a type system inspired by affine intuitionistic logic for the calculus of Higher-Order Mobile Embedded Resources (Homer), resulting in the first process calculus combining affine linear (non-copyable) and non-linear (copyable) higher-order mobile processes, nested locations, and local names. The type system guarantees that linear resources are neither copied nor embedded in non-linear resources during computation. We exemplify the use of the calculus by modelling a simplistic e-cash Smart Card system, the security of which depends on the interplay between (linear) mobile hardware, embedded (non-linear) mobile processes, and local names. A purely linear calculus would not be able to express that embedded software processes may be copied. Conversely, a purely non-linear calculus would not be able to express that mobile hardware processes cannot be copied.