The KeY Approach for the Cryptographic Verification of JAVA Programs: A Case Study

In this paper, the authors report on an ongoing case study in which they use the KeY tool, a theorem prover for checking functional correctness and noninterference properties of JAVA programs, to establish computational indistinguishability for a simple JAVA program that involves clients sending encrypted messages over an untrusted network to a server. The analysis uses a general framework, recently proposed by K?sters et al., which enables program analysis tools, such as KeY, that can check (standard) noninterference properties for JAVA programs to establish computational indistinguishability properties.

Provided by: Karlsruhe Institute of Technology Topic: Software Date Added: Apr 2012 Format: PDF

Find By Topic