Probability and timing: Challenges for secure programming (Invited talk)

DOI10.1007/3-540-45605-8_2MaRDI QIDQ4813195zbMATH OpenFDO

Authors David Sands

Publication date 13 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2399/23990016.htm

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Data encryption (aspects in computer science) (68P25)

Recommendations

• Transforming out timing leaks
• Probabilistic information flow security
• Semantic models for the security of sequential and concurrent programs
• Static confidentiality enforcement for distributed programs
• Tempus fugit: How to plug it

Cited in

(9)

• Semantic models for the security of sequential and concurrent programs
• Discriminating traces with time
• Static confidentiality enforcement for distributed programs
• Probabilistic confinement in a declarative framework
• Slot games for detecting timing leaks of programs
• Transforming out timing leaks
• Verifying secrets and relative secrecy
• Probabilistic information flow security
• Tempus fugit: How to plug it

This page was built for publication: Probability and timing: Challenges for secure programming (Invited talk)

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