Extending and Applying a Framework for the Cryptographic Verification of Java Programs

Abstract. In our previous work, we have proposed a framework which allows tools that can check standard noninterference properties but a priori cannot deal with cryptography to establish cryptographic indistinguishability properties, such as privacy properties, for Java programs. We refer to this framework as the CVJ framework (Cryptographic Verification of Java Programs) in this paper. While so far the CVJ framework directly supports public-key encryption (without corruption and without a public-key infrastructure) only, in this work we further instantiate the framework to support, among others, public-key encryption and digital signatures, both with corruption and a public-key infrastructure, as well as (private) symmetric encryption. Since these cryptographic primitives are very common in security-critical applications, our extensions make the framework much more widely applicable. To illustrate the usefulness and applicability of the extensions proposed in this paper, we apply the framework along with the tool Joana, which allows for the fully automatic verification of noninterference properties of Java programs, to establish cryptographic privacy properties of a (non-trivial) cloud storage application, where clients can store private information on a remote server.

Authenticated key agreement mediated by a proxy re-encryptor for the Internet of Things

International audienceThe Internet of Things (IoT) is composed of a wide range of heterogeneous network devices that communicate with their users and the surrounding devices. The secure communications between these devices are still essential even with little or no previous knowledge about each other and regardless of their resource capabilities. This particular context requires appropriate security mechanisms which should be wellsuited for the heterogeneous nature of IoT devices, without pre-sharing a secret key for each secure connection. In this work, we first propose a novel symmetric cipher proxy re-encryption scheme. Such a primitive allows a user to delegate her decryption rights to another with the help of a semi-trusted proxy, but without giving this latter any information on the transmitted messages and the user's secret keys. We then propose AKAPR, an Authenticated Key Agreement mediated by a Proxy Re-encryptor for IoT. The mechanism permits any two highly resource-constrained devices to establish a secure communication with no prior trust relationship. AKAPR is built upon our proposed proxy re-encryption scheme. It has been proved by ProVerif to provide mutual authentication for participants while preserving the secrecy of the generated session key. In addition, the scheme benefits from the lightness of our proxy re-encryption algorithm as it requires no expensive cryptographic operations such as pairing or modular exponentiatio

Proved Generation of Implementations from Computationally-Secure Protocol Specifications

International audienceIn order to obtain implementations of security protocols proved secure in the computational model, we have previously implemented a compiler that takes a specification of the protocol in the input language of the computational protocol verifier CryptoVerif and translates it into an OCaml implementation. However, until now, this compiler was not proved correct, so we did not have real guarantees on the generated implementation. In this paper, we fill this gap. We prove that this compiler preserves the security properties proved by CryptoVerif: if an adversary has probability p of breaking a security property in the generated code, then there exists an adversary that breaks the property with the same probability p in the CryptoVerif specification. Therefore, if the protocol specification is proved secure in the computational model by CryptoVerif, then the generated implementation is also secure

Closing Moulinex: thoughts on the visibility and invisibility of industrial labour in contemporary France

This article explores some of the ways in which deindustrialisation and factory closures are figured in contemporary French cultural production. In doing so, it reflects on the visibility and invisibility of industrial workers and their work in representations of the social world. Having noted a significant preoccupation with these issues in French cultural production since the 1990s, the discussion focuses particularly on the closure of the well-known domestic appliance company, Moulinex, in September 2001. It contrasts the dominant media discourse on industrial closures with the literary narrative offered by Franck Magloire (son of a Moulinex worker) in Ouvrière (2003).Cet article considère certains aspects de la représentation de la désindustrialisation et des fermetures d'usine dans la production culturelle française contemporaine. Il présente ainsi une réflexion sur la visibilité et l'invisibilité des ouvriers et du travail industriel dans la représentation du monde social. Partant du constat que ces questions constituent une préoccupation importante dans la production culturelle française depuis les années 1990, l'analyse est centrée plus particulièrement sur le cas de la fermeture du célèbre fabricant du petit électroménager, Moulinex, en Septembre 2001. Elle fait ressortir le contraste entre le discours médiatique dominant sur les fermetures industrielles et le récit littéraire proposé par Franck Magloire (fils d'une ouvrière de Moulinex) dans Ouvrière (2003)