Verifying secrets and relative secrecy
From MaRDI portal
Publication:5178858
DOI10.1145/325694.325729zbMath1323.68232OpenAlexW1993941352MaRDI QIDQ5178858
No author found.
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
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Authentication, digital signatures and secret sharing (94A62)
Related Items (4)
Cryptographically-masked flows ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ Probabilistic Confinement in a Declarative Framework ⋮ Quantifying information leakage in process calculi
This page was built for publication: Verifying secrets and relative secrecy
