A bisimulation for dynamic sealing
DOI10.1016/J.TCS.2006.12.032zbMATH Open1111.68034OpenAlexW2096216741MaRDI QIDQ5899331FDOQ5899331
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
information hidingsecurity\(\lambda\)-calculusbisimulationcontextual equivalencedata abstractioncryptographic protocolsencryptiondynamic sealing
Data encryption (aspects in computer science) (68P25) Functional programming and lambda calculus (68N18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A calculus for cryptographic protocols: The spi calculus
- Mobile values, new names, and secure communication
- Proving congruence of bisimulation in functional programming languages
- Using encryption for authentication in large networks of computers
- Barbed bisimulation
- Proof techniques for cryptographic processes
- Full abstraction in the lazy lambda calculus
- An attack on the Needham-Schroeder public-key authentication protocol
- On Bisimulations for the Spi Calculus*
- A theory of bisimulation for a fragment of concurrent ML with local names
- Protection in programming languages
- Parametric polymorphism and operational equivalence
- A bisimulation for type abstraction and recursion
- Modules, abstract types, and distributed versioning
- A type system for higher-order modules
- Principals in programming languages, a syntactic proof technique
- Global abstraction-safe marshalling with hash types
Cited In (9)
- From Applicative to Environmental Bisimulation
- Title not available (Why is that?)
- First-order reasoning for higher-order concurrency
- Non-parametric parametricity
- A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation
- Automated type-based analysis of injective agreement in the presence of compromised principals
- Title not available (Why is that?)
- Full Abstraction at Package Boundaries of Object-Oriented Languages
- A Complete Characterization of Observational Equivalence in Polymorphic Ξ»-Calculus with General References
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Bisimulation and action refinement π π
- Hybrid Systems: Computation and Control π π
- A bisimulation for dynamic sealing π π
- Bisimulation for Feller-Dynkin processes π π
- An Incremental Bisimulation Algorithm π π
- Bisimulation by Unification* π π
- Bisimulation for conditional modalities π π
- Enabling Preserving Bisimulation Equivalence π π
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)
