Verifying secrets and relative secrecy

DOI10.1145/325694.325729MaRDI QIDQ5178858zbMATH OpenOpenAlexFDO

Authors

Publication date 17 March 2015

Published in Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/325694.325729

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• All Secrets Great and Small
• Secrecy by typing in security protocols
• Tempus fugit: How to plug it
• scientific article; zbMATH DE number 2090700
• The complexity of synchronous notions of information flow security

Cited in

(10)

• Quantifying information leakage in process calculi
• Concurrent secrets
• Unifying simulatability definitions in cryptographic systems under different timing assumptions
• Keeping secrets in resource aware components
• All Secrets Great and Small
• Probabilistic confinement in a declarative framework
• Declassification policy for program complexity analysis
• Quantitative analysis of the leakage of confidential data
• Cryptographically-masked flows
• An independence relation for sets of secrets

This page was built for publication: Verifying secrets and relative secrecy

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