Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
From MaRDI portal
Recommendations
- Information and Communications Security
- Cryptographically sound implementations for typed information-flow security
- Computational Secrecy by Typing for the Pi Calculus
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Information Security and Cryptology - ICISC 2003
- CONCUR 2005 – Concurrency Theory
- Efficient non-interactive secure computation
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
Cites work
- Assessing security threats of looping constructs
- Certification of programs for secure information flow
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- Fundamentals of Computation Theory
- scientific article; zbMATH DE number 1692935 (Why is no real title available?)
- scientific article; zbMATH DE number 1956552 (Why is no real title available?)
- Selected Areas in Cryptography
Cited in
(6)- Automated proofs of block cipher modes of operation
- Towards a Type System for Security APIs
- scientific article; zbMATH DE number 1956552 (Why is no real title available?)
- 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
This page was built for publication: Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458849)
