Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
From MaRDI portal
Publication:5458849
DOI10.1007/978-3-540-77050-3_30zbMATH Open1135.68393OpenAlexW1514739653MaRDI QIDQ5458849FDOQ5458849
Authors: Judicaël Courant, Cristian Ene, Yassine Lakhnech
Publication date: 24 April 2008
Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_30
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
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- Assessing security threats of looping constructs
- Fundamentals of Computation Theory
- Certification of programs for secure information flow
- Title not available (Why is that?)
- Title not available (Why is that?)
- Selected Areas in Cryptography
Cited In (6)
- Fundamentals of Computation Theory
- Title not available (Why is that?)
- Towards a Type System for Security APIs
- Automated proofs of block cipher modes of operation
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- A survey of symbolic methods in computational analysis of cryptographic systems
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)