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

Mikkel Bundgaard | Zendy; Thomas Hildebrandt | Zendy; Jens Chr. Godskesen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Mikkel Bundgaard,

Thomas Hildebrandt,

Jens Chr. Godskesen

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.09.011

Subject(s) - computer science , process calculus , affine transformation , theoretical computer science , process (computing) , computation , order (exchange) , calculus (dental) , algorithm , programming language , mathematics , pure mathematics , medicine , dentistry , finance , economics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research