A bisimulation for dynamic sealing

DOI10.1016/J.TCS.2006.12.032MaRDI QIDQ5899331zbMATH OpenOpenAlexFDO

Authors Eijiro Sumii, Benjamin C. Pierce

Publication date 11 May 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.12.032

zbMATH Keywords

information hidingsecurity\(\lambda\)-calculusbisimulationcontextual equivalencedata abstractioncryptographic protocolsencryptiondynamic sealing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Functional programming and lambda calculus (68N18)

Recommendations

• A bisimulation for dynamic sealing
• Hybrid Systems: Computation and Control
• Bisimulation for Feller-Dynkin processes
• An Incremental Bisimulation Algorithm
• scientific article; zbMATH DE number 4166873
• Bisimulation and action refinement
• scientific article; zbMATH DE number 176514
• Enabling Preserving Bisimulation Equivalence
• Bisimulation by unification
• Bisimulation for conditional modalities

Cites work

• scientific article; zbMATH DE number 88999 (Why is no real title available?)
• scientific article; zbMATH DE number 1251177 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• A bisimulation for type abstraction and recursion
• A calculus for cryptographic protocols: The spi calculus
• A theory of bisimulation for a fragment of concurrent ML with local names
• A type system for higher-order modules
• An attack on the Needham-Schroeder public-key authentication protocol
• Barbed bisimulation
• Full abstraction in the lazy lambda calculus
• Global abstraction-safe marshalling with hash types
• Mobile values, new names, and secure communication
• Modules, abstract types, and distributed versioning
• On bisimulations for the spi calculus
• Parametric polymorphism and operational equivalence
• Principals in programming languages, a syntactic proof technique
• Proof techniques for cryptographic processes
• Protection in programming languages
• Proving congruence of bisimulation in functional programming languages
• Using encryption for authentication in large networks of computers

Cited in

(12)

• Non-parametric parametricity
• Automated type-based analysis of injective agreement in the presence of compromised principals
• scientific article; zbMATH DE number 7407797 (Why is no real title available?)
• A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation
• A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
• A bisimulation for type abstraction and recursion
• Full abstraction at package boundaries of object-oriented languages
• A bisimulation for type abstraction and recursion
• From applicative to environmental bisimulation
• First-order reasoning for higher-order concurrency
• Bisimulations for delimited-control operators
• A bisimulation for dynamic sealing

This page was built for publication: A bisimulation for dynamic sealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899331)