<--- Back to Details
First PageDocument Content
Cryptography / Computer security / Language-based security / KeY / Ciphertext indistinguishability / Universal composability
Date: 2013-04-09 08:10:38
Cryptography
Computer security
Language-based security
KeY
Ciphertext indistinguishability
Universal composability

A Hybrid Approach for Proving Noninterference and Applications to the Cryptographic Verification of Java Programs Ralf Küsters∗ , Tomasz Truderung∗ , Bernhard Beckert† , Daniel Bruns† , Jürgen Graf† and Chris

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

Download Document from Web Archive

File Size: 61,43 KB