scientific article; zbMATH DE number 1692935

MaRDI QIDQ2763667zbMATH OpenFDO

Authors Peeter Laud

Publication date 21 January 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2028/20280077

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data encryption (aspects in computer science) (68P25)

Recommendations

• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 1956552
• A semantic approach to secure information flow
• A Policy Model for Secure Information Flow
• On the computational soundness of cryptographically masked flows

Cited in

(31)

• Computationally sound implementations of equational theories against passive adversaries
• A semantic approach to secure information flow
• Semantic models for information flow
• Unifying simulatability definitions in cryptographic systems under different timing assumptions
• Compiling Information-Flow Security to Minimal Trusted Computing Bases
• Information leakage analysis by abstract interpretation
• Non-termination and secure information flow
• Secure guarded commands
• More Typed Assembly Languages for Confidentiality
• OAEP Is Secure under Key-Dependent Messages
• Cryptographically-Masked Flows
• All Secrets Great and Small
• Secure Information Flow as a Safety Property
• scientific article; zbMATH DE number 1956552 (Why is no real title available?)
• scientific article; zbMATH DE number 2080702 (Why is no real title available?)
• A monadic analysis of information flow security with mutable state
• scientific article; zbMATH DE number 1860683 (Why is no real title available?)
• scientific article; zbMATH DE number 2104621 (Why is no real title available?)
• Computational probabilistic non-interference
• A survey of symbolic methods in computational analysis of cryptographic systems
• Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
• Fundamentals of Computation Theory
• 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
• A per model of secure information flow in sequential programs
• Magic-sets for localised analysis of Java bytecode
• Compile-time detection of information flow in sequential programs
• Type systems equivalent to data-flow analyses for imperative languages
• Cryptographically-masked flows

This page was built for publication:

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