Dissertations / Theses on the topic 'Key Distribution'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Key Distribution.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Sonalker, Anuja Anilkumar. "Asymmetric Key Distribution." NCSU, 2002. http://www.lib.ncsu.edu/theses/available/etd-20020403-040240.
Full textABSTRACT BY Anuja A Sonalker on Asymmetric Key Distribution. (Under the direction of Dr. Gregory T. Byrd) Currently, in Threshold Public Key Systems key shares are generated uniformly and distributed in the same manner to every participant. We propose a new scheme, Asymmetric Key Distribution (AKD), in which one share server is provided with a larger, unequal chunk of the original secret key. Asymmetric Key Distribution is a unique scheme for generating and distributing unequal shares via a Trusted Dealer to all the registered peers in the system such that without the combination of the single compulsory share from the Special Server no transaction can be completed. This application is aimed for circumstances where a single party needs to co-exist within a group of semi-trusted peers, or in a coalition where every entity should have a choice to participate and one of the entities needs to be privileged with more powers. This thesis presents the algorithm and security model for Asymmetric Key Distribution, along with all the assumptions and dependencies within the boundaries of which this algorithm is guaranteed to be secure. Its robustness lies in its simplicity and in its distributed nature. We address all security concerns related to the model including compromised share servers and cryptanalytic attacks. A variation, called the Dual Threshold Scheme, is created to reduce the vulnerability in the algorithm, namely, the compromise of the Special Server and its secret share. In this scheme, a combination of another threshold number of Distributed Special Servers must combine to collectively generate a share equivalent to the Special Server?s share. This flexibility allows us to adjust our threshold scheme for the environment. We describe a Java-based implementation of the AKD algorithm, using Remote Method Invocation (RMI) for communication among share servers. A typical scenario of a Trusted Dealer, a Special Server and a number of Share Servers was created, where timed asymmetric key generation and distribution was carried out after which the servers initiated and carried out certificate signing transactions in the appropriated manner. As an interesting exercise, the share servers were corrupted so that they would try to exclude the Special Server in the transactions and try to form its share themselves, to observe the consequence. All their efforts were futile. Another interesting aspect was the key generation timing. Key generation is known to be a very time-extensive process but the key share reuse concept used in this implementation reduced the time for key generation by 66-90% of the classical key generation time.
Tvedt, Ole Christian. "Quantum key distribution prototype." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for elektronikk og telekommunikasjon, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-15845.
Full textNovak, Julia. "Generalised key distribution patterns." Thesis, Royal Holloway, University of London, 2012. http://repository.royalholloway.ac.uk/items/f582aac8-df73-28ea-fe2e-80f1c37f5e59/8/.
Full textWeier, Henning. "European Quantum Key Distribution Network." Diss., lmu, 2011. http://nbn-resolving.de/urn:nbn:de:bvb:19-133206.
Full textSimonsen, Eivind Sjøtun. "Security of quantum key distribution source." Thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10836.
Full textCryptography has begun its journey into the field of quantum information theory. Classical cryptography has shown weaknesses, which may be exploited in the future, either by development in mathematics, or by quantum computers. Quantum key distribution (QKD) is a promising path for cryptography to enable secure communication in the future. Although the theory of QKD promises absolute security, the reality is that current quantum crypto systems have flaws in them, as perfect devices have proven impossible to build. However, this can be taken into account in security proofs to ensure security, even with flaws. Security loopholes in QKD systems are being discovered as development progresses. Nevertheless, the system being built at NTNU is intended to address them all, creating a totally secure system. During this thesis, work was continued assembling the interferometer which is the basis for encoding qubits. It was fully connected on an optical table, and interference was obtained. Concerning theoretical work, calculations for a photon source specific parameter was carried out. It consisted of expanding previous framework and applying the results in both an established security proof, and a recent generalization of this proof. Two source effects were in focus, the lasers random phase and its fluctuating pulse intensity. Where analytical derivation was no longer possible, Matlab was used for numerical calculations. Under the conditions of the framework and proofs this thesis lies on, randomized phase turned out to have a negligible improvement over the case of non-random phase. Fluctuating amplitude showed a larger effect, reducing system performance. The input parameters were extreme, thus in a realistic situation it should not affect system performance significantly. However, these fluctuations must be taken into account when proving system security.
Kurnio, Hartono. "Contributions to group key distribution schemes." Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060509.103409/index.html.
Full textNauerth, Sebastian. "Air to ground quantum key distribution." Diss., Ludwig-Maximilians-Universität München, 2013. http://nbn-resolving.de/urn:nbn:de:bvb:19-162223.
Full textGordon, Karen Jane. "GigaHertz clocked quantum key distribution system." Thesis, Heriot-Watt University, 2003. http://hdl.handle.net/10399/309.
Full textTang, Xinke. "Optically switched quantum key distribution network." Thesis, University of Cambridge, 2019. https://www.repository.cam.ac.uk/handle/1810/289444.
Full textGorman, Philip Michael. "Practical free-space quantum key distribution." Thesis, Heriot-Watt University, 2010. http://hdl.handle.net/10399/2390.
Full textVoruganti, Anupama. "Key distribution for wireless sensor networks." Master's thesis, Mississippi State : Mississippi State University, 2007. http://library.msstate.edu/etd/show.asp?etd=etd-03052008-130408.
Full textSchmitt-Manderbach, Tobias. "Long distance free-space quantum key distribution." Diss., lmu, 2007. http://nbn-resolving.de/urn:nbn:de:bvb:19-81020.
Full textVan, Assche Gilles. "Information-Theoretic aspects of quantum key distribution." Doctoral thesis, Universite Libre de Bruxelles, 2005. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211050.
Full textLa distribution quantique de clés est une technique cryptographique permettant l'échange de clés secrètes dont la confidentialité est garantie par les lois de la mécanique quantique. Le comportement particulier des particules élémentaires est exploité. En effet, en mécanique quantique, toute mesure sur l'état d'une particule modifie irrémédiablement cet état. En jouant sur cette propriété, deux parties, souvent appelées Alice et Bob, peuvent encoder une clé secrète dans des porteurs quantiques tels que des photons uniques. Toute tentative d'espionnage demande à l'espion, Eve, une mesure de l'état du photon qui transmet un bit de clé et donc se traduit par une perturbation de l'état. Alice et Bob peuvent alors se rendre compte de la présence d'Eve par un nombre inhabituel d'erreurs de transmission.
L'information échangée par la distribution quantique n'est pas directement utilisable mais doit être d'abord traitée. Les erreurs de transmissions, qu'elles soient dues à un espion ou simplement à du bruit dans le canal de communication, doivent être corrigées grâce à une technique appelée réconciliation. Ensuite, la connaissance partielle d'un espion qui n'aurait perturbé qu'une partie des porteurs doit être supprimée de la clé finale grâce à une technique dite d'amplification de confidentialité.
Cette thèse s'inscrit dans le contexte de la distribution quantique de clé où les porteurs sont des états continus de la lumière. En particulier, une partie importante de ce travail est consacrée au traitement de l'information continue échangée par un protocole particulier de distribution quantique de clés, où les porteurs sont des états cohérents de la lumière. La nature continue de cette information implique des aménagements particuliers des techniques de réconciliation, qui ont surtout été développées pour traiter l'information binaire. Nous proposons une technique dite de réconciliation en tranches qui permet de traiter efficacement l'information continue. L'ensemble des techniques développées a été utilisé en collaboration avec l'Institut d'Optique à Orsay, France, pour produire la première expérience de distribution quantique de clés au moyen d'états cohérents de la lumière modulés continuement.
D'autres aspects importants sont également traités dans cette thèse, tels que la mise en perspective de la distribution quantique de clés dans un contexte cryptographique, la spécification d'un protocole complet, la création de nouvelles techniques d'amplification de confidentialité plus rapides à mettre en œuvre ou l'étude théorique et pratique d'algorithmes alternatifs de réconciliation.
Enfin, nous étudions la sécurité du protocole à états cohérents en établissant son équivalence à un protocole de purification d'intrication. Sans entrer dans les détails, cette équivalence, formelle, permet de valider la robustesse du protocole contre tout type d'espionnage, même le plus compliqué possible, permis par les lois de la mécanique quantique. En particulier, nous généralisons l'algorithme de réconciliation en tranches pour le transformer en un protocole de purification et nous établissons ainsi un protocole de distribution quantique sûr contre toute stratégie d'espionnage.
Quantum key distribution is a cryptographic technique, which allows to exchange secret keys whose confidentiality is guaranteed by the laws of quantum mechanics. The strange behavior of elementary particles is exploited. In quantum mechnics, any measurement of the state of a particle irreversibly modifies this state. By taking advantage of this property, two parties, often called Alice and bob, can encode a secret key into quatum information carriers such as single photons. Any attempt at eavesdropping requires the spy, Eve, to measure the state of the photon and thus to perturb this state. Alice and Bob can then be aware of Eve's presence by a unusually high number of transmission errors.
The information exchanged by quantum key distribution is not directly usable but must first be processed. Transmission errors, whether they are caused by an eavesdropper or simply by noise in the transmission channel, must be corrected with a technique called reconciliation. Then, the partial knowledge of an eavesdropper, who would perturb only a fraction of the carriers, must be wiped out from the final key thanks to a technique called privacy amplification.
The context of this thesis is the quantum key distribution with continuous states of light as carriers. An important part of this work deals with the processing of continuous information exchanged by a particular protocol, where the carriers are coherent states of light. The continuous nature of information in this case implies peculiar changes to the reconciliation techniques, which have mostly been developed to process binary information. We propose a technique called sliced error correction, which allows to efficiently process continuous information. The set of the developed techniques was used in collaboration with the Institut d'Optique, Orsay, France, to set up the first experiment of quantum key distribution with continuously-modulated coherent states of light.
Other important aspects are also treated in this thesis, such as placing quantum key distribution in the context of a cryptosystem, the specification of a complete protocol, the creation of new techniques for faster privacy amplification or the theoretical and practical study of alternate reconciliation algorithms.
Finally, we study the security of the coherent state protocol by analyzing its equivalence with an entanglement purification protocol. Without going into the details, this formal equivalence allows to validate the robustness of the protocol against any kind of eavesdropping, even the most intricate one allowed by the laws of quantum mechanics. In particular, we generalize the sliced error correction algorithm so as to transform it into a purification protocol and we thus establish a quantum key distribution protocol secure against any eavesdropping strategy.
Doctorat en sciences appliquées
info:eu-repo/semantics/nonPublished
El, Mabrok Osama H. Mohamed. "Wireless quantum key distribution in indoor environments." Thesis, University of Leeds, 2018. http://etheses.whiterose.ac.uk/22356/.
Full textZhong, Tian Ph D. Massachusetts Institute of Technology. "High-dimensional entanglement-based quantum key distribution." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/84903.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 135-148).
Conventional quantum key distribution (QKD) uses a discrete two-dimensional Hilbert space for key encoding, such as the polarization state of a single photon. In contrast, high-dimensional QKD allows encoding onto a larger state space, such as multiple levels of a continuous variable of a single photon, thus enabling the system to achieve higher photon information efficiency (bits/photon) and potentially higher key rate (bits/second). However, its deployment requires high-performance source, detector, and routing technologies tailored to the specific large-alphabet encoding scheme. One such high-dimensional QKD system of interest is based on time-energy entanglement, in which keys are derived from the arrival times of photon pairs generated from continuous-wave (CW) spontaneous parametric downconversion (SPDC). This thesis focuses on the implementation of a time-energy entanglement-based QKD system, with the development of several enabling technologies including an efficient single-spatial-mode source of time-energy entangled photons based on a periodically-poled KTiOPO4 (PPKTP) waveguide, GHz self-differencing InGaAs singlephoton avalanche diodes (SPADs), and the first demonstration of non-locally dispersion-canceled Franson quantum interferometry achieving 99.6% visibility. We then utilize these technologies to perform two full QKD protocols. The first protocol uses SPDCgenerated entangled photons for both key extraction and Franson interferometry, yielding a secure key rate -90 kbits/s with up to 4 bits/photon after error-correction and privacy amplification. The second protocol deploys two different photon sources: an amplified spontaneous emission (ASE) source is pulse-position modulated to perform random key generation, and a CW-SPDC source is for Franson security check. In this latter case, we have achieved a secure key rate 7.3 Mbits/s with 2.9 bits/photon, which represents the state-of-the-art in today's QKD technology.
by Tian Zhong.
Ph.D.
Noori, Yasir Jamal. "Integrated optical components for quantum key distribution." Thesis, Lancaster University, 2017. http://eprints.lancs.ac.uk/87459/.
Full textGutha, Akash. "QUANTUM KEY DISTRIBUTION USING FPGAS AND LEDS." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1587769155531749.
Full textLeifgen, Matthias. "Protocols and components for quantum key distribution." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2016. http://dx.doi.org/10.18452/17473.
Full textIn this thesis, photonic quantum states are used for experimental realisations of two different concepts of quantum information processing. Quantum key distribution (QKD) is revolutionary because it is the only cryptographic scheme offering unconditional security. Two major problems prevail: Firstly, matching the conditions for unconditional security is challenging, secondly, long distance communication beyond 200 km is very demanding because an increasingly attenuated quantum state starts to fail the competition with constant noise. One experiment accomplished in this thesis is concerned with the first problem. The realisation of the actual quantum state is critical. Single photon states from nitrogen and for the first time also silicon vacancy defect centres are used for a QKD transmission under the BB84 (Bennett and Brassard 1984). The deviation of the used single photon states from the ideal state is thoroughly investigated and the information an eavesdropper obtains due to this deviation is analysed. Transmitting quantum states via satellites is a potential solution to the limited achievable distances in QKD. A novel protocol particularly suited for this is implemented for the first time in this thesis, the frequency-time (FT) protocol. The protocol is thoroughly investigated by varying the experimental parameters over a wide range and by evaluating the impact on the performance and the security. Finally, big steps towards a fully automated fibre-based BB84 QKD experiment in the time-bin implementation with autonomous sender and receiver units are accomplished. Another important concept using quantum mechanical properties as a resource is a quantum random number generator (QRNG). Random numbers are used for various applications in computing and cryptography. A QRNG supplying bits with high and quantifiable randomness at a record-breaking rate is reported and the statistical properties of the random output is thoroughly tested.
Franz, Torsten [Verfasser]. "Quantum correlations and quantum key distribution / Torsten Franz." Hannover : Technische Informationsbibliothek und Universitätsbibliothek Hannover (TIB), 2013. http://d-nb.info/1041654707/34.
Full textNock, Richard William Raymond. "Flexible precision timing instrumentation and quantum key distribution." Thesis, University of Bristol, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658313.
Full textXAVIER, GUILHERME BARRETO. "MODULATION SCHEMES FOR FREQUENCY CODED QUANTUM KEY DISTRIBUTION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6483@1.
Full textA criptografia quântica foi proposta como uma solução para o problema da distribuição de chaves criptográficas com segurança total garantida pelos princípios da mecânica quântica. Através dessa técnica é possível saber se um espião tentou interceptar a transmissão, o que é impossível utilizando técnicas de transmissão clássicas. Nesse trabalho foi feito um breve resumo da teoria de criptografia quântica, de suas técnicas de transmissão e dos problemas tecnológicos enfrentados. Foi analisada em detalhes a técnica de transmissão de qubits utilizando codificação de freqüência e feita uma comparação dos diferentes esquemas de modulação frente aos protocolos BB84 e B92. Foi demonstrado que os dois esquemas de modulação existentes (AM-AM e PM-PM) são na realidade equivalentes e foi proposto um novo esquema, o AM-PM o único que suporta o protocolo BB84 clássico. Medidas foram realizadas classicamente nos formatos AM-AM e AM-PM.
Quantum cryptography has been proposed as a solution to the cryptographic key distribution problem with absolute security guaranteed by the principles of quantum mechanics. Through this scheme it is possible to find out whether a spy tried to eavesdrop on the transmission, which was impossible to discover using classical transmission techniques. In this work a brief review of quantum cryptography theory, transmission techniques and technological problems involved were performed. It was analyzed in detail the transmission technique employing frequency coding, and a comparison was made between the different modulation schemes and the BB84 and B92 protocols. It was demonstrated that the two existing modulation formats (AM-AM and PM-PM) are in fact equivalent and a new format (AM-PM) was proposed, the only one able to accommodate classical BB84. Classical measurements were performed on the AM-AM and AMPM formats.
Dixon, Alexander Robert. "High speed and actively stabilised quantum key distribution." Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609865.
Full textLo, Piparo Nicolo. "Long-distance quantum key distribution with imperfect devices." Thesis, University of Leeds, 2015. http://etheses.whiterose.ac.uk/8582/.
Full textDELGADO, ALIZO MARIA TERESA. "Soft Processing Techniques for Quantum Key Distribution Applications." Doctoral thesis, Politecnico di Torino, 2012. http://hdl.handle.net/11583/2501669.
Full textCusini, Gabriele. "Quantum Key Distribution with Continuous Variables for Satellite Systems." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019.
Find full textZhang, Lijian. "Towards Single Photon Quantum Key Distribution with Continuous Variables." Thesis, University of Oxford, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526132.
Full textEkemar, Liselott. "Polarization stabilization for quantum key distribution in deployed fibre." Thesis, KTH, Tillämpad fysik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-279632.
Full textCompton-Drake, Lynsey Elizabeth. "A lightweight key distribution mechanism for wireless sensor networks." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Thesis/Spring2009/L_CDrake_053009.pdf.
Full textTitle from PDF title page (viewed on Aug. 5, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 29-31).
Panayi, Christiana. "Memory-assisted measurement-device-independent quantum key distribution systems." Thesis, University of Leeds, 2016. http://etheses.whiterose.ac.uk/12449/.
Full textGrasselli, Federico [Verfasser], Dagmar [Akademischer Betreuer] Bruß, and Hermann [Akademischer Betreuer] Kampermann. "Quantum Cryptography: from Key Distribution to Conference Key Agreement / Federico Grasselli ; Dagmar Bruß, Hermann Kampermann." Düsseldorf : Universitäts- und Landesbibliothek der Heinrich-Heine-Universität Düsseldorf, 2020. http://d-nb.info/1217840877/34.
Full textWatts, Dominque Elijah. "Distribution and abundance of endangered Florida Key deer on outer islands." Thesis, Texas A&M University, 2006. http://hdl.handle.net/1969.1/4960.
Full textGoold, Jeremy C. "Improving Routing Security Using a Decentralized Public Key Distribution Algorithm." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd797.pdf.
Full textFurman, Thomas L. "Improving key performance indicators for distribution facilities through action research." [Denver, Colo.] : Regis University, 2006. http://165.236.235.140/lib/TFurman2006.pdf.
Full textWitt, Alexander W. "Using Ballistocardiography to Perform Key Distribution in Wearable IoT Networks." Digital WPI, 2017. https://digitalcommons.wpi.edu/etd-theses/829.
Full textChung, Gen-Hua, and 鍾振華. "Authenticated Key Distribution and Conference Key Distribution Schemes Using ID-based Self-certified Public Keys." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/09581609417740470616.
Full text國立臺灣科技大學
管理研究所資訊管理學程
87
At present, in most of the session key and conference key methods scholar proposed, to verify the public key almost uses certificate based or identity based. But in the processing of public key verification, these two methods separately have communication cost increasing and the register center knows user''s private key problems. In this thesis, we propose a new key distribution and a conference key distribution scheme. The user''s public key has both identity based and self-certified properties. Not only the register center can not know users'' private keys, but also public key verification and application can be done in a logic step. The method in the thesis has the following advantages: (1) The system does not need extra certification to verify public key. (2) The session key distribution and the public key authentication can be done in the same time. (3) Because the certification is embedded in the public key, it will reduce computing power and communication cost. The security of the method is based on discrete logarithms and one-way has function. Because of the system does not exist public key directory, it is impossible been active attacked.
Ko, Ming-Yung, and 柯銘湧. "Private-key Key Distribution for Network Security." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/73952380418869179133.
Full text國立成功大學
資訊及電子工程研究所
82
Data encryption is one of the most effective ways to achieve communication security. In the private-key cryptosystems, a session key has to be shared privately between two (or more) users in order to have secure communications between each other. Key distribution protocol (KDP) is used to distribute session keys to users. KDP can be constructed under the case where each pair of users originally share a distinct master key. Therefore, if there are N users in the system, then each user has to maintain (N-1) master keys for all possible session key distributions, which is very inefficient when N is large. In order to reduce the number of the users' secret keys, most methods use a trusted authentication server to distribute the session keys. Each user need to share only a secret master key with the authentication server. If any pair of users want to have a secure communication, they obtain the session key with the help of the trusted authentication server. We call such a scheme as the three-party KDP. A new three-party key distribution protocol based on private-key cryptosystem is proposed. It uses the challenge-response rule to ensure the freshness of transmitted message. We also illustrate such key distribution protocol can be extended to repeated authentication, multiple authentication servers and internetwork environment.
Kun-FeiYu and 余昆霏. "Semi-quantum Key Distribution and Quantum Key Agreement." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/90012462687074606405.
Full text國立成功大學
資訊工程學系
102
The present researches in the quantum cryptography have covered wide range of research topics. Particularly, the topic of quantum key distribution (QKD) is the most attractive one. Compare with the classical key distribution, the security of the QKD protocol is based on the quantum physics, which possesses the properties of the measurement uncertainty and no-cloning theorem. However, most of the QKD schemes assume that both participants equip the advanced quantum devices. In this condition, consider that the quantum computer is still in development stage and it’s hard to afford, this assumption may become a restriction for a user to execute those QKD schemes without these devices. Under this situation, the “semi-quantum” environment was proposed to achieve the quantum communication with limited quantum capability. In the case of semi-quantum key distribution (SQKD), however, all the existing SQKD protocols utilize authenticated classical channels between the participants (i.e., the integrity and the originality of messages transmitted via the authenticated classical channel can be ensured). Without the use of the authenticated classical channels, these SQKD protocols are vulnerable to man-in-the-middle attacks. Besides, in a QKD protocol, the shared secret key is determined by a party or a key distribution center, and subsequently distributed to the other participants. However, the participants in a communication may be dishonest and further threaten the generation of the shared key. In that case, the quantum key agreement (QKA) protocols can be applied. The QKA protocols allow all the participants to negotiate the shared secret key which cannot be determined alone by any one or subset of the participants. This thesis discloses a novel key manipulation problem which makes the existing QKA protocols vulnerable and unfair. Based on above discussion, this thesis first proposes authenticated SQKD (ASQKD) protocols, which utilize public channels and pre-shared keys to authenticate users instead of using the authenticated classical channels. In addition, this thesis also proposes a multi-party SQKD protocol using N-particle GHZ-like states, which allows numerous participants to establish a shared secret key. Second, based on that, this thesis also gives a solution model. Moreover, a two-party QKA protocol and two multi-party QKA protocols with mediators based on the solution model are presented.
Chiu, Po-Huang, and 邱博煌. "Secret Key Rates of Practical Quantum Key Distribution." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/73x2s5.
Full text國立臺灣大學
物理學研究所
106
With the rise of the Internet, the secure communication becomes neces- sary and important. Because the information on internet is accessible to ev- eryone, we need some way to encrypt our message. Modern cryptography to solve key distribution problem use public key cryptography (PKC), and its security is based on the computational security. ie limited computing power and resources. The most commonly used public-key cryptosystem is RSA, which is based upon the difficulty to factor large semi-prime numbers. How- ever, a quantum computer with Shor’s algorithm can crack RSA cryptosystem in a short time, and thus will threaten the current PCK. Quantum key distribu- tion provides a new way to solve key distribution problem, and its security is based on the law of physics, such as the uncertainty principle and no-cloning theorem. The users who communicate with each other in the QKD proto- col can detect the presence of any third party that tries to gain knowledge of the key. The ideal QKD has been proven to be unconditionally secure. But in real world implementation, there are some flaws or imperfection in light sources, detectors, channel loss and etc. that may be exploited by adversaries. In this thesis, we discuss the decoy-state QKD that is an effective scheme to overcome the notorious photon number splitting attack in the communication channel due to the imperfection of single-photon light source. We also inves- tigate the measurement device independent (MDI) QKD scheme to overcome the side-channel detector attack. Combining the MDI-QKD with decoy-state method, offers a clear way to bridge the gap between theory and practice. We simulate and calculate the key rate generated in these QKD protocols using realistic experimental parameters.
Gupta, Abhishek. "Key Distribution In Wireless Sensor Networks." Thesis, 2008. http://hdl.handle.net/2005/714.
Full textHsin-Wen, Cho, and 卓欣汶. "An Effective Key Distribution Scheme Using Multiple Key Trees." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/11518439625384039997.
Full text國立暨南國際大學
資訊工程學系
93
oday, network conference is so popular. However, two important issues are still needed to be explored for key management in a confidential conference. One is the total messages exchanged, the other is the security. Hence, under the assumption that there exists one central key manager, how to cope with the above two problems by using multiple key trees is the focus of this dissertation. First, we continue on the study of Zhu [10]. Zhu originally divides the group members into two parts depending on their membership durations. Here, we further utilize the idea of Huffman coding to adjust the structure of the key tree. The messages exchanged are further reduced in each rekeying process. Next, we divide the group members into three parts or more. Based on the derivation of an analytic model, the result shows that it can significantly reduce the communication costs than previously proposed schemes. Besides, our proposed new key tree structure is also safety.
Shih, Han-Cheng, and 石瀚成. "Efficient Quantum Key Distribution Protocol." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/73954231483425002483.
Full text國立成功大學
資訊工程學系碩博士班
97
After Shor proposed an algorithm to break public-key system in quantum computer operation, it makes the current most used public-key system insecure. However, quantum cryptography can overcome the impacts that quantum computer cause, and make it develop rapidly not only in theory but also in experiment. Quantum science becomes the most popular research subject. In quantum cryptography, the earliest develop and the most important technique is quantum key distribution protocol. When two parties procceed secret communication, the basic way is to encrypt the message by sharing one key only they know, therefore the main goal of key distribution protocol is to make them efficient and secure. In this paper, we propose three efficient quantum key distribution protocols to improve their efficiency in three different purposes, and analyze the optimal communication particularly. According to the analyzing result, we improve the quantum key distribution protocols proposed by Bennet in 1984 and reduce the communication steps to accelerate the execution time. Around 2000 year, because of the physical character of quantum,it brings up Trojan Horse attack. We must equip the hardware devise to prevent the kind of attack. To save the devise expense, we propose a protocol base on the technique to prevent key distribution protocol from the Trojan Horse attack. Because of the rapid development of key distribution protocol, there’s researcher propose a quantum network structure in 1995. In this structure, it needs a lot of server to provide expensive quantum devise service. Therefore, it develops lots of multi-party key distribution protocol assisted by server. So in this paper, we propose two efficient three-party key distribution protocols to reduce the device and raise the qubit efficiency.
Yen, Chia-Han, and 顏嘉漢. "Quantum Key Distribution with Teleportation." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/18768599768883527875.
Full text國立清華大學
電機工程學系
93
Quantum teleportation allows an unknown quantum state to be transmitted from one place to another with the aid of classical communication by first preparing an EPR pair for the sender and the receiver. We propose a novel quantum key distribution protocol based on this idea. This protocol does not require the sender and the receiver to choose between alternative measurements, which improves the rate of generating key bits from the transmitted bits and is hard for an eavesdropper to access information. However, our scheme needs reliable Bell operator measurements and the expensive resource, two Bell states each round. The security of our schemes discussed and compared with others.
Chen, Jau-Liang, and 陳昭良. "Dynamic Conference Key Distribution Systems." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/62806766499113141348.
Full text國立成功大學
資訊工程研究所
81
As the technology of computer network advances, people can communicate efficiently with each other and have many important activities in the network. Nevertheless, the networks are so vulnerable to various security attacks. The use of the cryptologic methods provides a good way to assure the communication security. However, the conventional approachs often deal with secure communications between two individuals. Beacuse of the development of the teleconference, how to ensure secure communications inside a group of people becomes an important problem. Ingemarsson et al. in 1982 firstly proposed a conference key system. However, it can only be used in the ring-type connection. After that, there are many other conference key distribution systems suggested. But some of them have security problems; others have the problem of large computation/communication load or require large storage space. None of these proposed schemes provide satisfactory solution for secure teleconference. This thesis aims to design secure and efficient conference key distribution systems. We porpose a concept of the dynamic conference key distribution systems, DCKDS, which allows any subgroup of users to share a common conference key efficiently and hold a secure teleconference. All the users outside this conference would not be able to derive the conference key. Here, we propose three schemes, which are one way and broadcasting, to realize the above concept. They are: (1) DCKDS with IC cards, (2) DCKDS with "indirect" authentication and (3) DCKDS with "direct" authentication. Finally, we also compare our proposed schemes with the other methods.
Chan, Yu-Te, and 詹于德. "Dynamic Conference Key Distribution System." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/10174999203725376851.
Full text東海大學
數學系
95
In this thesis, we propose a Dynamic Conference Key Distribution System. We give a very brief introduction to the history of cryptography first, and then discuss its background, including secret sharing,dynamic secret sharing,and ellipitic curve. Next, we use a Conference Key Distribution System. Finally, we present a Dynamic Conference Key Distribution System and make an analysis between this one and the original one.
Chang, Chih-Shiang, and 張智翔. "Key Pre-distribution in Wireless Sensor Networks Using Key Groups." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/97594014883638421261.
Full text國立臺灣科技大學
資訊工程系
95
Prior researches on the key pre-distribution in wireless sensor networks often employ the deployment knowledge of the sensor nodes to construct a better communication graph. This paper proposes the use of key groups in random key pre-distribution. Three different approaches are developed for key selection and experiments were conducted to compare the effectiveness with prior proposed schemes. Through the simulation results, we observe that with the help of key groups, a smaller number of keys can be preloaded in the sensor nodes to achieve the same level of robustness of the network.
Yen-JieChen and 陳衍傑. "Randomization-Based semi-quantum key distribution and Strict semi-quantum key distribution with local unitary operations." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/366nyt.
Full text國立成功大學
資訊工程學系
106
This thesis derives the entanglement correlations of collapsed Bell state qubits and original Bell states (ECCB) by utilizing the law of fundamental quantum mechanics, and proposes a mediated randomization-based semi-quantum key distribution protocol for sharing a session key with two classical users who have limited quantum capabilities, by the assistance of the almost dishonest quantum third-party (QTP), who has powerful quantum capabilities. Besides, we also find that the ECCB can be applied to semi-quantum private comparison in randomization-based environment with an almost-dishonest QTP, where the classical users can compare their secret information securely by the assistance of the almost-dishonest QTP. The almost-dishonest QTP can perform any kind of attack, other than conspiring with any classical user. Further, for achieving practical application, this thesis also proposes a mediated strict semi-quantum key distribution protocol, where classical users can only have fewer quantum capabilities than the original semi-quantum environment, and the trustworthiness of the QTP is also almost-dishonest.
Brahmadevula, Kiran Kumar Pendse Ravindra. "Pre-shared key distribution protocol (PDP)." Diss., 2005. http://il.proquest.com/products_umi/dissertations.
Full text"December 2005." Title from PDF title page (viewed on April 22, 2007). Thesis adviser: Ravi Pendse. UMI Number: AAT 1436548 Includes bibliographic references (leaves 58-61).
Kabeya, Mpinda. "Experimental realization of quantum key distribution." Thesis, 2009. http://hdl.handle.net/10413/8978.
Full textThesis (M.Sc.)-University of KwaZulu-Natal, Westville, 2009.
Chen, Ming-Yu, and 陳明裕. "Authenticated Threshold Conference Key Distribution Systems." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/65179494466622085480.
Full text東吳大學
資訊科學系
91
This thesis respectively uses the concept of authenticated encryption schemes and signcryption schemes to achieve the confidentiality and authenticity of a conference key distribution protocol. Considering the actual conference situation, not all of the participants can attend the conference. The secret sharing scheme can be applied to set up the threshold of the participant number of a conference. A chairman can pre-set a threshold value (such as the participant number to hold a valid conference). When the participant number is greater than the threshold value, then participants can solve the conference key to hold a conference. In an authenticated conference key system, the cost of computation and communication are proportion to the amount of the participants. Therefore, the authenticated conference key cryptosystem adopting authenticated encryption schemes or signcryption schemes can effectively reduce the cost of computation and communication. In the process of reconstructing the conference key, the participants can authenticate whether the share is assigned by a chairman. To attend the conference, the participant must present his/her valid share. The attackers and the dishonest participants can be excluded by verifying the validity of shares. It is assured that the honest participants can solve the correct conference key.
LIN, CHUNG-SUNG, and 林中嵩. "A New Public Key Distribution Protocol." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/61815890571008908295.
Full text淡江大學
資訊工程研究所
81
Sharing resource or exchanging information through computer network between mainframes or between nodes of a large-scale network become widely accepted by the computer users. Meanwhile, many important and secret information must be transmitted through network, which makes the necessity of network security of information flowing in the network. However, this result in another problem - "How to administrator, store, and distribute the key efficiently and safely?", especially when the nodes on nowadays open network system are often over one thousand. Consequently, the application of public key distribution protocol on the network is more and more important. Thus, the main purpose of this thesis is to offer a new public key distribution protocol, using a new method to accomplish the distribution of key on the network. Since Diffie and Hellman develop the first public key distribution protocol from discrete exponential in 1976, there are continuously many public key distribution protocol announced. All these systems make use of the numeric feature of one-way function and one-way trapdoor function to achieve the transfer and distribution of key. In the thesis, an infinite differentiable function and the commutative feature of differential function are used to develop a new public key distribution protocol. This distribution protocol can be used to distribute a function, and its security is based on the grade of difficulty in the calculation of symbol integral. At last, a system which computed the differential of triangle function is given as an example to put the public key distribution protocol in practice.