Notes on Nominal Calculi for Security and Mobility

Authors:
Andrew D. Gordon
Affiliations:
-
Venue:
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Year:
2000

Citing 79
Cited 24

Communicating sequential processes

Communicating sequential processes
The Interrogator: Protocol Secuity Analysis

IEEE Transactions on Software Engineering - Special issue on computer security and privacy
The calculus of constructions

Information and Computation - Semantics of Data Types
Linda in context

Communications of the ACM
Names

Distributed systems
The chemical abstract machine

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Authentication in distributed systems: theory and practice

ACM Transactions on Computer Systems (TOCS)
Modal logics for mobile processes

Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus for access control in distributed systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, I

Information and Computation
Authentication in distributed systems: a bibliography

ACM SIGOPS Operating Systems Review
A language with distributed scope

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Testing equivalence for mobile processes

Information and Computation
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Provably secure session key distribution: the three party case

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Prudent Engineering Practice for Cryptographic Protocols

IEEE Transactions on Software Engineering
The reflexive CHAM and the join-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking mobile processes

Information and Computation
Region-based memory management

Information and Computation
A typed language for distributed mobile processes (extended abstract)

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A probabilistic poly-time framework for protocol analysis

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Types for mobile ambients

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for cryptographic protocols

Information and Computation
Secrecy by typing in security protocols

Journal of the ACM (JACM)
Controlling interference in ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Mobile ambients

Theoretical Computer Science
Pict: a programming language based on the Pi-Calculus

Proof, language, and interaction
Timestamps in key distribution protocols

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Using encryption for authentication in large networks of computers

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
A generic type system for the Pi-calculus

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Secure safe ambients

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typing a multi-language intermediate code

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstractions for mobile computations

Secure Internet programming
Types of specifications of access policies

Secure Internet programming
Communication and Concurrency

Communication and Concurrency
Essential COM

Essential COM
Java Virtual Machine Specification

Java Virtual Machine Specification
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
The Java Language Specification

The Java Language Specification
A bisimulation method for cryptographic protocols

Nordic Journal of Computing
Functional Nets

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Seal: A Framework for Secure Mobile Computations

ICCL'98 Workshop on Internet Programming Languages
Region Analysis and a pi-Calculus wiht Groups

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Game of the Name in Cryptographic Tables

ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Mobility Types for Mobile Ambients

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Distributed Abstract Machine for Safe Ambients

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus

ICALP '98 Proceedings of the 25th 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
Locality Based Linda: Programming with Explicit Localities

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Control Flow Analysis for the pi-calculus

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Validating Firewalls in Mobile Ambients

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Secrecy and Group Creation

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Calculus of Mobile Agents

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Equational Properties of Mobile Ambients

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Subtyping and Typing Algorithms for Mobile Ambients

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
The Complexity of Model Checking Mobile Ambients

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Bauhaus Linda

ECOOP '94 Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems
An Asynchronous Model of Locality, Failurem and Process Mobility

COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Abstract Interpretation of Mobile Ambients

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
An Asynchronous, Distributed Implementation of Mobile Ambients

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Ambient Groups and Mobility Types

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Localities and Failures (Extended Abstract)

Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
The JavaSeal Mobile Agent Kernel

ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
Secure Implementation of Channel Abstractions

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Proof Techniques for Cryptographic Processes

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Using temporal logic to specify and verify cryptographic protocols

CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Proving Trust in Systems of 2nd-Order Processes: Preliminary Results

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
A Semantic Model for Authentication Protocols

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Security Properties and CSP

SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
On two Proposals for On-line Bankcard Payments using Open Networks: Problems and Solutions

SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Authenticity by typing for security protocols

Journal of Computer Security - Special issue on CSFW14
Logical properties of name restriction

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

Mobile Processes: A Commented Bibliography

MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Mobile processes: a commented bibliography

Modeling and verification of parallel processes
A model-checking verification environment for mobile processes

ACM Transactions on Software Engineering and Methodology (TOSEM)
The future refereeing process in Cyberspace of the Data & Knowledge Engineering Journal: an attempt in guaranteeing security and privacy on three levels

Data & Knowledge Engineering - Special jubilee issue: DKE 50
Manipulating Trees with Hidden Labels

Electronic Notes in Theoretical Computer Science (ENTCS)
Constraint-based automatic verification of abstract models of multithreaded programs

Theory and Practice of Logic Programming
Twenty-five years of Mokum: For 25 years of data and knowledge engineering: Correctness by design in relation to MDE1The acronym MDA is a trademark of the OMG; MDE is the alternative.1 and correct protocols in cyberspace

Data & Knowledge Engineering
Name Creation vs. Replication in Petri Net Systems

Fundamenta Informaticae - PETRI NETS 2007
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Manipulating trees with hidden labels

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Name creation vs. replication in Petri net systems

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Depth boundedness in multiset rewriting systems with name binding

RP'10 Proceedings of the 4th international conference on Reachability problems
Multiset rewriting: a semantic framework for concurrency with name binding

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
From security protocols to systems security

Proceedings of the 11th international conference on Security Protocols
Model checking for nominal calculi

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Forward analysis for petri nets with name creation

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Welcome to the jungle: a subjective guide to mobile process calculi

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Language-based comparison of petri nets with black tokens, pure names and ordered data

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Multiset rewriting for the verification of depth-bounded processes with name binding

Information and Computation
Accelerations for the Coverability Set of Petri Nets with Names

Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Name Creation vs. Replication in Petri Net Systems

Fundamenta Informaticae - PETRI NETS 2007
Nominal automata for resource usage control

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On the coverability and reachability languages of monotonic extensions of Petri nets

Theoretical Computer Science
Towards nominal context-free model-checking

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verifying secure and mobile computations. These notes introduce three nominal calculi--the pi calculus, the spi calculus, and the ambient calculus. We describe some typical techniques, and survey related work.