scientific article
From MaRDI portal
Publication:2763667
zbMath0977.68524MaRDI QIDQ2763667
Publication date: 21 January 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2028/20280077
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Data encryption (aspects in computer science) (68P25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (14)
Type systems equivalent to data-flow analyses for imperative languages ⋮ More Typed Assembly Languages for Confidentiality ⋮ Magic-sets for localised analysis of Java bytecode ⋮ Cryptographically-masked flows ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ OAEP Is Secure under Key-Dependent Messages ⋮ Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption ⋮ Computationally sound implementations of equational theories against passive adversaries ⋮ A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol ⋮ Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR ⋮ Quantifying Probabilistic Information Flow in Computational Reactive Systems ⋮ Computational Probabilistic Non-interference
This page was built for publication:
