信息理论安全下公开可验证密钥共享方案

基于信息理论安全的承诺方案和知识的零知识证明协议,构造一个公开可验证的密钥共享方案.在该方案中,任何参与者在密钥分布协议中都能验证其他参与者密钥分块的有效性,且在密钥重构中,仅密钥分块的接收者能验证该分块的有效性.对比可验证的密钥共享方案,该方案更具实用性,是一个独到的具有信息理论意义下安全的公开可验证密钥共享方案.

Multiple-User Quantum Optical Communication

A fundamental understanding of the information carrying capacity of optical channels requires the signal and physical channel to be modeled quantum mechanically. This thesis considers the problems of distributing multi-party quantum entanglement to distant users in a quantum communication system and determining the ability of quantum optical channels to reliably transmit information. A recent proposal for a quantum communication architecture that realizes long-distance, high-fidelity qubit teleportation is reviewed. Previous work on this communication architecture is extended in two primary ways. First, models are developed for assessing the effects of amplitude, phase, and frequency errors in the entanglement source of polarization-entangled photons, as well as fiber loss and imperfect polarization restoration, on the throughput and fidelity of the system. Second, an error model is derived for an extension of this communication architecture that allows for the production and storage of three-party entangled Greenberger-Horne-Zeilinger states. A performance analysis of the quantum communication architecture in qubit teleportation and quantum secret sharing communication protocols is presented. Recent work on determining the channel capacity of optical channels is extended in several ways. Classical capacity is derived for a class of Gaussian Bosonic channels representing the quantum version of classical colored Gaussian-noise channels. The proof is strongly mo- tivated by the standard technique of whitening Gaussian noise used in classical information theory. Minimum output entropy problems related to these channel capacity derivations are also studied. These single-user Bosonic capacity results are extended to a multi-user scenario by deriving capacity regions for single-mode and wideband coherent-state multiple access channels. An even larger capacity region is obtained when the transmitters use non- classical Gaussian states, and an outer bound on the ultimate capacity region is presented

Experimental Realization of Dicke States of up to Six Qubits for Multiparty Quantum Networking

We report the first experimental generation and characterization of a six-photon Dicke state. The produced state shows a fidelity of F=0.56 +/- 0.02 with respect to an ideal Dicke state and violates a witness detecting genuine six-qubit entanglement by 4 standard deviations. We confirm characteristic Dicke properties of our resource and demonstrate its versatility by projecting out four- and five-photon Dicke states, as well as four-photon Greenberger-Horne-Zeilinger and W states. We also show that Dicke states have interesting applications in multiparty quantum networking protocols such as open-destination teleportation, telecloning, and quantum secret sharing.

Practical and Foundational Aspects of Secure Computation

Il y a des problemes qui semblent impossible a resoudre sans l'utilisation d'un tiers parti honnete. Comment est-ce que deux millionnaires peuvent savoir qui est le plus riche sans dire a l'autre la valeur de ses biens ? Que peut-on faire pour prevenir les collisions de satellites quand les trajectoires sont secretes ? Comment est-ce que les chercheurs peuvent apprendre les liens entre des medicaments et des maladies sans compromettre les droits prives du patient ? Comment est-ce qu'une organisation peut ecmpecher le gouvernement d'abuser de l'information dont il dispose en sachant que l'organisation doit n'avoir aucun acces a cette information ? Le Calcul multiparti, une branche de la cryptographie, etudie comment creer des protocoles pour realiser de telles taches sans l'utilisation d'un tiers parti honnete. Les protocoles doivent etre prives, corrects, efficaces et robustes. Un protocole est prive si un adversaire n'apprend rien de plus que ce que lui donnerait un tiers parti honnete. Un protocole est correct si un joueur honnete recoit ce que lui donnerait un tiers parti honnete. Un protocole devrait bien sur etre efficace. Etre robuste correspond au fait qu'un protocole marche meme si un petit ensemble des joueurs triche. On demontre que sous l'hypothese d'un canal de diusion simultane on peut echanger la robustesse pour la validite et le fait d'etre prive contre certains ensembles d'adversaires. Le calcul multiparti a quatre outils de base : le transfert inconscient, la mise en gage, le partage de secret et le brouillage de circuit. Les protocoles du calcul multiparti peuvent etre construits avec uniquements ces outils. On peut aussi construire les protocoles a partir d'hypoth eses calculatoires. Les protocoles construits a partir de ces outils sont souples et peuvent resister aux changements technologiques et a des ameliorations algorithmiques. Nous nous demandons si l'efficacite necessite des hypotheses de calcul. Nous demontrons que ce n'est pas le cas en construisant des protocoles efficaces a partir de ces outils de base. Cette these est constitue de quatre articles rediges en collaboration avec d'autres chercheurs. Ceci constitue la partie mature de ma recherche et sont mes contributions principales au cours de cette periode de temps. Dans le premier ouvrage presente dans cette these, nous etudions la capacite de mise en gage des canaux bruites. Nous demontrons tout d'abord une limite inferieure stricte qui implique que contrairement au transfert inconscient, il n'existe aucun protocole de taux constant pour les mises en gage de bit. Nous demontrons ensuite que, en limitant la facon dont les engagements peuvent etre ouverts, nous pouvons faire mieux et meme un taux constant dans certains cas. Ceci est fait en exploitant la notion de cover-free families . Dans le second article, nous demontrons que pour certains problemes, il existe un echange entre robustesse, la validite et le prive. Il s'effectue en utilisant le partage de secret veriable, une preuve a divulgation nulle, le concept de fantomes et une technique que nous appelons les balles et les bacs. Dans notre troisieme contribution, nous demontrons qu'un grand nombre de protocoles dans la litterature basee sur des hypotheses de calcul peuvent etre instancies a partir d'une primitive appelee Transfert Inconscient Veriable, via le concept de Transfert Inconscient Generalise. Le protocole utilise le partage de secret comme outils de base. Dans la derniere publication, nous counstruisons un protocole efficace avec un nombre constant de rondes pour le calcul a deux parties. L'efficacite du protocole derive du fait qu'on remplace le coeur d'un protocole standard par une primitive qui fonctionne plus ou moins bien mais qui est tres peu couteux. On protege le protocole contre les defauts en utilisant le concept de privacy amplication .

Algebraic Geometric Codes and their relation to Cryptography using Elliptic Curves

Communication is the process of transmitting data across channel. Whenever data is transmitted across a channel, errors are likely to occur. Coding theory is a stream of science that deals with finding efficient ways to encode and decode data, so that any likely errors can be detected and corrected. There are many methods to achieve coding and decoding. One among them is Algebraic Geometric Codes that can be constructed from curves. Cryptography is the science ol‘ security of transmitting messages from a sender to a receiver. The objective is to encrypt message in such a way that an eavesdropper would not be able to read it. A eryptosystem is a set of algorithms for encrypting and decrypting for the purpose of the process of encryption and decryption. Public key eryptosystem such as RSA and DSS are traditionally being prel‘en‘ec| for the purpose of secure communication through the channel. llowever Elliptic Curve eryptosystem have become a viable altemative since they provide greater security and also because of their usage of key of smaller length compared to other existing crypto systems. Elliptic curve cryptography is based on group of points on an elliptic curve over a finite field. This thesis deals with Algebraic Geometric codes and their relation to Cryptography using elliptic curves. Here Goppa codes are used and the curves used are elliptic curve over a finite field. We are relating Algebraic Geometric code to Cryptography by developing a cryptographic algorithm, which includes the process of encryption and decryption of messages. We are making use of fundamental properties of Elliptic curve cryptography for generating the algorithm and is used here to relate both.

ACE research vignette 037 : Bill Gates’ mug shot : Is there a secret link between rule-breaking, crime, and entrepreneurship?

This series of research vignettes is aimed at sharing current and interesting research findings from international entrepreneurship researchers. In this vignette, Dr. Martin Obschonka, considers the relationship between entrepreneurship and rule-breaking.

Continuous-variable quantum-state sharing via quantum disentanglement

Quantum-state sharing is a protocol where perfect reconstruction of quantum states is achieved with incomplete or partial information in a multipartite quantum network. Quantum-state sharing allows for secure communication in a quantum network where partial information is lost or acquired by malicious parties. This protocol utilizes entanglement for the secret-state distribution and a class of quantum disentangling protocols for the state reconstruction. We demonstrate a quantum-state sharing protocol in which a tripartite entangled state is used to encode and distribute a secret state to three players. Any two of these players can collaborate to reconstruct the secret state, while individual players obtain no information. We investigate a number of quantum disentangling processes and experimentally demonstrate quantum-state reconstruction using two of these protocols. We experimentally measure a fidelity, averaged over all reconstruction permutations, of F=0.73 +/- 0.02. A result achievable only by using quantum resources.

PROTECTING TRADE SECRETS IN LITIGATION - THE IMPACT OF ARTICLE 9 OF THE EU TRADE SECRET DIRECTIVE ESPECIALLY ON FINNISH LAW

In November 2013 the European Commission issued the “Proposal for a Directive on the European Parliament and of the Council on the protection of undisclosed know-how and business information (trade secrets) against their unlawful acquisition, use and disclosure” (referred to as “TSD”). The TSD offers minimum harmonisation and aims at promoting sharing of knowledge, and the exploitation of innovations on the Internal Market. The European Parliament adopted the TSD on April 14, 2016 and the EU Member States will have two years to implement it. The TSD includes a harmonised definition of a trade secret that builds on the definition provided in Article 39 of the TRIPS Agreement. Moreover, it also ensures the freedom of expression and information and the protection of whistle-blowers. Appropriate means of actions and remedies against unlawful acquisition, use and disclosure of trade secrets are also included, such as provisional and pecuniary measures, injunctions and corrective measures or allocation of damages. This study examines the protection of trade secrets in the course of litigation regulated in Article 9 of the TSD. Currently, the protection of trade secrets within the EU is fragmented especially in this regard, which makes companies reluctant to resort to litigation when a trade secret has unlawfully been misappropriated or it is suspected that a trade secret is being misused. The regulations in Article 9 expand only to the hearing in court. Such protection is welcomed and a step in the right direction. However, in my study I have found that in order for the protection to be sufficient there is a need to further establish measures to protect trade secrets during the entire process, from the filing of the claim to the end when the judgement is given. Consequently, I also discuss different measures that could be used to strengthen the protection of trade secrets before the hearing in court, as evidence are gathered.

Protecting Trade Secrets In Litigation The Impact of Article 9 of The EU Trade Secret Directive Especially on Finnish Law

In November 2013 the European Commission issued the “Proposal for a Directive on the European Parliament and of the Council on the protection of undisclosed know-how and business information (trade secrets) against their unlawful acquisition, use and disclosure” (referred to as “TSD”). The TSD offers minimum harmonisation and aims at promoting sharing of knowledge, and the exploitation of innovations on the Internal Market. The European Parliament adopted the TSD on April 14, 2016 and the EU Member States will have two years to implement it. The TSD includes a harmonised definition of a trade secret that builds on the definition provided in Article 39 of the TRIPS Agreement. Moreover, it also ensures the freedom of expression and information and the protection of whistle-blowers. Appropriate means of actions and remedies against unlawful acquisition, use and disclosure of trade secrets are also included, such as provisional and pecuniary measures, injunctions and corrective measures or allocation of damages. This study examines the protection of trade secrets in the course of litigation regulated in Article 9 of the TSD. Currently, the protection of trade secrets within the EU is fragmented especially in this regard, which makes companies reluctant to resort to litigation when a trade secret has unlawfully been misappropriated or it is suspected that a trade secret is being misused. The regulations in Article 9 expand only to the hearing in court. Such protection is welcomed and a step in the right direction. However, in my study I have found that in order for the protection to be sufficient there is a need to further establish measures to protect trade secrets during the entire process, from the filing of the claim to the end when the judgement is given. Consequently, I also discuss different measures that could be used to strengthen the protection of trade secrets before the hearing in court, as evidence are gathered.