Les boîtes quantiques (BQ) semi-conductrices possèdent une structure électronique discrète qui en fait une excellente source de photons uniques et indiscernables. Elles sont ainsi devenues un système très attractif pour des futures applications en information quantique, grâce à la possibilité de les intégrer dans des nano-dispositifs permettant un couplage efficace lumière-matière. Cependant, les BQs constituent par nature un système ouvert en interagissant fortement avec l'environnement solide, une des conséquences étant la destruction partielle de la cohérence des photons émis. Dans ce travail, nous avons choisi d'utiliser une BQ comme sonde très sensible de ces interactions. Des expériences d'interférences à deux photons, de type Hong-Ou-Mandel, sous excitation résonante et en fonction de la température, nous ont permis d’étudier l'interaction entre une BQ et les phonons acoustiques de la matrice cristalline environnante. En combinant nos résultats expérimentaux et un modèle théorique microscopique, nous avons identifié deux processus distincts responsables de la perte d’indiscernabilité : le premier dû aux transitions réelles par absorption-émission de phonons, le deuxième à cause de transitions virtuelles, processus du deuxième ordre, dues à la présence d’états excités de plus haute énergie dans la boîte. Nous avons par ailleurs étudié des échantillons dopés permettant d’appliquer un champ électrique sur le plan de BQ, mettant en évidence que le contrôle de l’état de charge d’une BQ permet sont excitation résonante systématique. / Developments in quantum information processes require the use of solid state qubits that would emit on demand single and indistinguishable photons. Semiconductor quantum dots (QDs) show an atom-like spectrum which makes them attractive in this regard. However, a single QD constitutes an open quantum system coupled to its surrounding solid-state environment, the phonon bath and the fluctuating electrostatic environment. This has important consequences on the coherence properties of the electronic system and the QD is a probe to study these fundamental interactions. Using Fourier spectroscopy and temperature-dependent resonant HOM experiments we show that these two mechanisms occur on very different time scales: spectral diffusion is a slow dephasing process acting on microseconds, while phonon interaction takes place in less than one ns. Then, the loss of ndistinguishability in HOM measurements is only related to dephasing induced by the coupling to the phonon bath. The TPI visibility is preserved around 85 % at low temperature, followed by a rapid loss of coherence. To fully understand the experimental results we developed a mircroscopic model for the electron-phonon interaction which allow to obtain analytic expressions for the dephasing rates. Below 10K the relaxation of the vibrational lattice is the dominant contribution to the loss of TPI visibility. This process corresponds to real phonon transitions resulting in a broad phonon sideband in the QD emission spectra. Above 10K, virtual phonon transitions to higher lying excited states become the dominant dephasing mechanism, leading to broadening of the zero phonon line and a corresponding rapid decay in the visibility.

In recent years, whistleblowing has lead to big headlines aroundthe world. This thesis looks at whistleblower systems, which are systems specically created for whistleblowers to submit tips anonymously. The problem is how to engineer such a system asto maximize the anonymity for the whistleblower whilst at the same time remain usable.The thesis evaluates existing implementations for the whistle-blowing problem. Eleven Swedish newspapers are evaluated for potential threats against their whistleblowing service.I suggest a new system that tries to improve on existing systems. New features includes the introduction of JavaScript cryptography to lessen the reliance of trust for a hosted server. Use of anonymous encryption and cover traffic to partially anonymize the recipient, size and timing metadata on submissions sent by the whistleblowers. I explore the implementations of these features and the viability to address threats against JavaScript integrity by use of cover traffic.The results show that JavaScript encrypted submissions are viable. The tamper detection system can provide some integrity for the JavaScript client. Cover traffic for the initial submissions to the journalists was also shown to be feasible. However, cover traffic for replies sent back-and-forth between whistleblower and journalist consumed too much data transfer and was too slow to be useful.

Notre société utilise de nombreux systèmes de communications. Parce que ces systèmes sont omniprésents et sont utilisés pour échanger des informations sensibles, ils doivent être protégés. Cela est fait à l'aide de protocoles cryptographiques. Il est crucial que ces protocoles assurent bien les propriétés de sécurité qu'ils affirment avoir, car les échecs peuvent avoir des conséquences importantes. Malheureusement, concevoir des protocoles cryptographiques est notoirement difficile, comme le montre la régularité avec laquelle de nouvelles attaques sont découvertes. Nous pensons que la vérification formelle est le meilleur moyen d'avoir de bonnes garanties dans la sécurité d'un protocole: il s'agit de prouver mathématiquement qu'un protocole satisfait une certaine propriété de sécurité.Notre objectif est de développer les techniques permettant de vérifier formellement des propriétés d'équivalence sur des protocoles cryptographiques, en utilisant une méthode qui fournit de fortes garanties de sécurités, tout en étant adaptée à des procédures de preuve automatique. Dans cette thèse, nous défendons l'idée que le modèle Bana-Comon pour les propriétés d'équivalences satisfait ces objectifs. Nous soutenons cette affirmation à l'aide de trois contributions.Tout d'abord, nous étayons le modèle Bana-Comon en concevant des axiomes pour les fonctions usuelles des protocoles de sécurités, et pour plusieurs hypothèses cryptographiques. Dans un second temps, nous illustrons l'utilité de ces axiomes et du modèle en réalisant des études de cas de protocoles concrets: nous étudions deux protocoles RFID, KCL et LAK, ainsi que le protocole d'authentification 5G-AKA, qui est utilisé dans les réseaux de téléphonie mobile. Pour chacun de ces protocoles, nous montrons des attaques existentes ou nouvelles, proposons des versions corrigées de ces protocoles, et prouvons que celles-ci sont sécurisées. Finalement, nous étudions le problème de l'automatisation de la recherche de preuves dans le modèle Bana-Comon. Pour cela, nous prouvons la décidabilité d'un ensemble de règles d'inférences qui est une axiomatisation correcte, bien que incomplète, de l'indistingabilité calculatoire, lorsque l'on utilise un schéma de chiffrement IND-CCA2. Du point de vue d'un cryptographe, cela peut être interprété comme la décidabilité d'un ensemble de transformations de jeux. / Our society extensively relies on communications systems. Because such systems are used to exchange sensitive information and are pervasive, they need to be secured. Cryptographic protocols are what allow us to have secure communications. It is crucial that such protocols do not fail in providing the security properties they claim, as failures have dire consequences. Unfortunately, designing cryptographic protocols is notoriously hard, and major protocols are regularly and successfully attacked. We argue that formal verification is the best way to get a strong confidence in a protocol security. Basically, the goal is to mathematically prove that a protocol satisfies some security property.Our objective is to develop techniques to formally verify equivalence properties of cryptographic protocols, using a method that provides strong security guarantees while being amenable to automated deduction techniques. In this thesis, we argue that the Bana-Comon model for equivalence properties meets these goals. We support our claim through three different contributions.First, we design axioms for the usual functions used in security protocols, and for several cryptographic hypothesis. Second, we illustrate the usefulness of these axioms and of the model by completing case studies of concrete protocols: we study two RFID protocols, KCL et LAK, as well as the 5G-AKA authentication protocol used in mobile communication systems. For each of these protocols, we show existing or new attacks against current versions, propose fixes, and prove that the fixed versions are secure. Finally, we study the problem of proof automation in the Bana-Comon model, by showing the decidability of a set of inference rules which is a sound, though incomplete, axiomatization of computational indistinguishability when using an IND-CCA2 encryption scheme. From a cryptographer's point of view, this can be seen as the decidability of a fixed set of cryptographic game transformations.

Ce manuscrit décrit des expériences d’optique atomique quantique utilisant un détecteur résolu en impulsions d’atomes uniques d’hélium métastable. La première partie du manuscrit décrit la mesure de cohérence de deuxième ordre de la superradiance à partir d’un condensat de Bose-Einstein d’helium métastable. Bien que le condensat soit cohérent et le gain du processus de superradiance élevé, celle-ci montre toujours une statistique thermique comme celle de l’émission spontanée. La suite du manuscrit est dédiée au test de la non localité d’une source atomique corrélée en impulsion. Le schéma du test s’inspire d’une réalisation faite par Rarity et Tapster sur des photons intriqués en impulsion. Les ingrédients principaux d’un tel schéma sont la source atomique générée par instabilité dynamique du condensat dans un réseau optique en mouvement, le contrôle cohérent des atomes par diffraction de Bragg et la mesure de la corrélation des atomes dans les différentes voies de sortie du schéma interférométrique. Un point clé est le contrôle et la manipulation de la phase des ondes atomiques. Le chapitre 3 décrit les tests sur le contrôle cohérent par diffraction de Bragg et leurs résultats encourageants. La nature non classique de notre source atomique est démontrée par l’observation d’une interférence à deux particules en les envoyant sur une séparatrice atomique. Cet analogue atomique de l’expérience de Hong Ou et Mandel est le sujet du dernier chapitre de ce manuscrit. Le résultat de cette expérience ouvre la possibilité du test d’inégalité de Bell avec des particules massives corrélées sur des degrés de liberté externe. / This manuscript describes quantum atom optics experiments using metastable helium atoms with a single-atom momentum resolved detector. In the first part of this manuscript, the second order correlation measurement of the superradiance from a metastable helium Bose-Einstein condensate is presented. The superradiance effect is the collective radiation of dense ensemble where a strong gain of the radiation is expected. We have shown the thermal like statistics of the emission even in the presence of the strong gain. The next part of the manuscript is devoted to the quantum nonlocality test using a pair of atoms entangled in momentum. The protocol we came up with is inspired from the one of Rarity and Tapster with pairs of photons entangled in momentum. The essential ingredients of this protocol are the atomic pair produced by dynamical instability of the Bose-Einstein condensate in a moving optical lattice, the coherent control of the atomic pair by Bragg diffraction and the correlation measurement of the atoms in different output modes of the interferometric protocol. The experimental characterization and preparation of coherent control by Bragg diffraction are presented showing the proof of principle of such a protocol. The last part of the manuscript discusses the realization of the atomic Hong-Ou-Mandel experiment using the same atomic pair with an atomic beamsplitter. The non-classical interference result of this experiment has opened an opportunity for us to realize Bell’s inequality test with massive particles correlated in external degrees of freedom.

Spontaneous parametric down conversion (SPDC) is used to generate quantum entangled photons through a non-linear crystal. The entanglement of photons is demonstrated by observing the effects of indistinguishability on photons, first through time and energy, then by polarization. The Hong-Ou-Mandel (HOM) effect was also demonstrated. A theoretical derivation of the effect of a non 50/50 beam splitter (BS) is also investigated. The energy of the photons was changed by varying the temperature of the crystal whilst the time difference was changed by varying the relative position of two mirrors. Results showed a clear effect from indistinguishability on both energy and time.

To the field of cryptography, quantum mechanics is a game changer. The exploitation of quantum mechanical properties through the manipulation of quantum information, the information encoded in the state of quantum systems, would allow many protocols in use today to be broken as well as lead to the expansion of cryptography to new protocols. In this thesis, quantum encryption, i.e. encryption schemes for quantum data, is defined, along with several definitions of security, broadly divisible into semantic security and ciphertext indistinguishability, which are proven equivalent, in analogy to the foundational result by Goldwasser and Micali. Private- and public-key quantum encryption schemes are also constructed from quantum-secure cryptographic primitives, and their security is proven. Most of the results are in the joint paper Computational Security of Quantum Encryption, to appear in the 9th International Conference on Information Theoretic Security (ICITS2016).

Les algorithmes de chiffrement par blocs paramétrables constituent une généralisation des algorithmes de chiffrement par blocs classiques qui, en plus d'une clé et d'un message à chiffrer ou déchiffrer, admettent un paramètre additionnel, nommé tweak en anglais. Le rôle de ce paramètre additionnel est d'apporter une variabilité à l'algorithme de chiffrement, sans qu'il soit nécessaire de changer la clé ou de garder le tweak secret. Ce dernier doit également pouvoir être contrôlé par l'adversaire sans dégradation de la sécurité. Dans cette thèse nous nous intéressons à une classe particulière d'algorithmes de chiffrement par blocs, les algorithmes de chiffrement par blocs à clé alternée. Plusprécisément, nous étudions la sécurité du schéma d'Even-Mansour, qui constitue une abstraction de la structure de ces algorithmes dans le modèle de la permutation aléatoire, et cherchons à rendre ce schéma paramétrable tout en conservant de fortes garanties de sécurité. À cette fin, nous introduisons une nouvelle construction générique, baptiséeTEM, qui remplace les clés de tours de la construction d'Even-Mansour par une valeur qui dépend de la clé et du tweak, et en étudions la sécurité dans deux cas : lorsque le mixage de la clé et du tweak est linéaire ou lorsqu'il est très non-linéaire. Nos preuves de sécurité utilisent la technique des coefficients H, introduite par Jacques Patarin danssa thèse de doctorat, qui permet de transformer des problèmes cryptographiques en problèmes combinatoires sur des groupes finis. / Tweakable block ciphers are a generalization of classical block ciphers which, in addition to a key and a plaintext or a ciphertext, take an additionnal parameter called a tweak. The goal of this new parameter is to bring variability to the block cipher without needing to change the key or to keep the tweak secret. The tweak should also be adversariallycontrollable without sacrificing security. In this thesis we study a particular class of block ciphers, namely key-alternating ciphers. More precisely, we study the security of the Even-Mansour scheme, which is an abstraction of these ciphers in the random permutation model, and seek to bring tweakability to this scheme while keeping strong security guarantees. To this end, we introduce a new generic construction, dubbed TEM, which replaces the round keys from the Even-Mansour construction by a value depending on both the key and the tweak, and study its security in two cases: when the tweak and key mixing is linear or highly non-linear. Our security proofs rely on the H-coefficients technique, a technique introduced by Jacques Patarin in his PhD thesis which transforms cryptographic problems into combinatorial problems in finite groups.

Quantum cryptography is arguably the most successfully applied area of quantum information theory. In this work, We invsetigate the role of quantum indistinguishability in random number generation, quantum temporal correlations, quantum nonlocality and counterfactuality for quantum cryptography. We study quantum protocols for key distribution, and their security in the conventional setting, in the counterfactual paradigm, and finally also in the device-independent scenario as applied to prepare-and-measure schemes. We begin with the interplay of two essential non-classical features like quantum indeterminism and quantum indistinguishability via a process known as bosonic stimulation is discussed. It is observed that the process provides an efficient method for macroscopic extraction of quantum randomness. Next, we propose two counterfactual cryptographic protocols, in which a secret key bit is generated even without the physical transmission of a particle. The first protocol is semicounterfactual in the sense that only one of the key bits is generated using interaction-free measurement. This protocol departs fundamentally from the original counterfactual key distribution protocol in not encoding secret bits in terms of photon polarization. We discuss how the security in the protocol originates from quantum single-particle non-locality. The second protocol is designed for the crypto-task of certificate authorization, where a trusted third party authenticates an entity (e.g., bank) to a client. We analyze the security of both protocols under various general incoherent attack models. The next part of our work includes study of quantum temporal correlations. We consider the use of the Leggett-Garg inequalities for device-independent security appropriate for prepare-and-measure protocols subjected to the higher dimensional attack that would completely undermine standard BB84. In the last part, we introduce the novel concept of nonlocal subspaces constructed using the graph state formalism, and propose their application for quantum information splitting. In particular, we use the stabilizer formalism of graph states to construct degenerate Bell operators, whose eigenspace determines the nonlocal subspace, into which a quantum secret is encoded and shared among an authorized group of agents, or securely transmitted to a designated secret retriever. The security of our scheme arises from the monogamy of quantum correlations. The quantum violation of the Bell-type inequality here is to its algebraic maximum, making this approach inherently suitable for the device-independent scenario.

The area of formal analysis of cryptographic protocols has been an active one since the mid 80’s. The idea is to verify communication protocols that use encryption to guarantee secrecy and that use authentication of data to ensure security. Formal methods are used in protocol analysis to provide formal proofs of security, and to uncover bugs and security flaws that in some cases had remained unknown long after the original protocol publication, such as the case of the well known Needham-Schroeder Public Key (NSPK) protocol. In this thesis we tackle problems regarding the three main pillars of protocol verification: modelling capabilities, verifiable properties, and efficiency. This thesis is devoted to investigate advanced features in the analysis of cryptographic protocols tailored to the Maude-NPA tool. This tool is a model-checker for cryptographic protocol analysis that allows for the incorporation of different equational theories and operates in the unbounded session model without the use of data or control abstraction. An important contribution of this thesis is relative to theoretical aspects of protocol verification in Maude-NPA. First, we define a forwards operational semantics, using rewriting logic as the theoretical framework and the Maude programming language as tool support. This is the first time that a forwards rewriting-based semantics is given for Maude-NPA. Second, we also study the problem that arises in cryptographic protocol analysis when it is necessary to guarantee that certain terms generated during a state exploration are in normal form with respect to the protocol equational theory. We also study techniques to extend Maude-NPA capabilities to support the verification of a wider class of protocols and security properties. First, we present a framework to specify and verify sequential protocol compositions in which one or more child protocols make use of information obtained from running a parent protocol. Second, we present a theoretical framework to specify and verify protocol indistinguishability in Maude-NPA. This kind of properties aim to verify that an attacker cannot distinguish between two versions of a protocol: for example, one using one secret and one using another, as it happens in electronic voting protocols. Finally, this thesis contributes to improve the efficiency of protocol verification in Maude-NPA. We define several techniques which drastically reduce the state space, and can often yield a finite state space, so that whether the desired security property holds or not can in fact be decided automatically, in spite of the general undecidability of such problems. / Santiago Pinazo, S. (2015). Advanced Features in Protocol Verification: Theory, Properties, and Efficiency in Maude-NPA [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/48527

En aquest treball es defineix el concepte de generador additiu de t–normes i de t–conormes discretes. S’hi estableixen resultats generals sobre la generació additiva de disjuncions i les caracteritzacions dels generadors de les t–conormes bàsiques. Es planteja un algorisme per a decidir quan una disjunció és additivament generable, basat en l’algorisme Gamma de la teoria de convexitat. S’estudia la relació que hi ha entre la generació additiva amb la suma ordinal i amb l’anidament. S’introdueixen els conceptes de generador concau i generador convex. S’estudia la generació additiva de les disjuncions i les t–conormes suaus i bivalents sobre L*. S’insisteix amb l’aplicabilitat de la generació additiva quan es tracta de manejar la condició de T–transitivitat per a relacions d’indistingibilitat discretes. Finalment, s’estudia la relació que hi ha entre la generació additiva d’una t–conorma S i les propietats de l’S–implicació corresponent. Amb motiu de les propietats d’ordre i modus ponens generalitzat, es defineixen els generadors mixtos