Literatura científica selecionada sobre o tema "Quantum cryptographic protocols"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Quantum cryptographic protocols".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Quantum cryptographic protocols"
Goyal, Rohit. "Quantum Cryptography: Secure Communication Beyond Classical Limits". Journal of Quantum Science and Technology 1, n.º 1 (31 de março de 2024): 1–5. http://dx.doi.org/10.36676/jqst.v1.i1.01.
Texto completo da fonteChandre, Pankaj R., Bhagyashree D. Shendkar, Sayalee Deshmukh, Sameer Kakade e Suvarna Potdukhe. "Machine Learning-Enhanced Advancements in Quantum Cryptography: A Comprehensive Review and Future Prospects". International Journal on Recent and Innovation Trends in Computing and Communication 11, n.º 11s (10 de outubro de 2023): 642–55. http://dx.doi.org/10.17762/ijritcc.v11i11s.8300.
Texto completo da fonteZhou, Zishuai, Qisheng Guang, Chaohui Gao, Dong Jiang e Lijun Chen. "Measurement-Device-Independent Two-Party Cryptography with Error Estimation". Sensors 20, n.º 21 (7 de novembro de 2020): 6351. http://dx.doi.org/10.3390/s20216351.
Texto completo da fonteBukashkin, S. А., e М. А. Cherepniov. "Quantum Computer and Post-Quantum Cryptography". Programmnaya Ingeneria 12, n.º 4 (14 de julho de 2021): 171–78. http://dx.doi.org/10.17587/prin.12.171-178.
Texto completo da fonteKushwah, Kirti, Akanksha, Aniket Varshney, Arpit Jain e Astitva Singh. "Simulating the BB84 Protocol". International Journal for Research in Applied Science and Engineering Technology 11, n.º 5 (31 de maio de 2023): 5916–20. http://dx.doi.org/10.22214/ijraset.2023.52840.
Texto completo da fonteOkhrimenko, Tetiana, Serhii Dorozhynskyi e Bohdan Horbakha. "ANALYSIS OF QUANTUM SECURE DIRECT COMMUNICATION PROTOCOLS". Computer systems and information technologies, n.º 1 (30 de março de 2023): 62–67. http://dx.doi.org/10.31891/csit-2023-1-8.
Texto completo da fonteMüller, Johannes, e Jan Oupický. "Post-quantum XML and SAML Single Sign-On". Proceedings on Privacy Enhancing Technologies 2024, n.º 4 (outubro de 2024): 525–43. http://dx.doi.org/10.56553/popets-2024-0128.
Texto completo da fonteSong, Yaqi, e Li Yang. "Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer". Applied Sciences 8, n.º 10 (19 de outubro de 2018): 1990. http://dx.doi.org/10.3390/app8101990.
Texto completo da fonteHallgren, Sean, Adam Smith e Fang Song. "Classical cryptographic protocols in a quantum world". International Journal of Quantum Information 13, n.º 04 (junho de 2015): 1550028. http://dx.doi.org/10.1142/s0219749915500288.
Texto completo da fonteTeja, Penumantra Satya Sai, Mounika Lakshmi P e Vinay Kumar K. "A Secure Communication through Quantum Key Distribution Protocols". International Research Journal of Electronics and Computer Engineering 4, n.º 3 (30 de setembro de 2018): 14. http://dx.doi.org/10.24178/irjece.2018.4.3.14.
Texto completo da fonteTeses / dissertações sobre o assunto "Quantum cryptographic protocols"
Ghorai, Shouvik. "Continuous-variable quantum cryptographic protocols". Electronic Thesis or Diss., Sorbonne université, 2021. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2021SORUS007.pdf.
Texto completo da fonteThis thesis is concerned with the study and analysis of two quantum cryptographic protocols: quantum key distribution (QKD) and unforgeable quantum money in the continuous-variable (CV) framework. The main advantage of CV protocols is that their implementation only requires standard telecom components. QKD allows two distant parties, Alice and Bob, to establish a secure key, even in the presence of an eavesdropper, Eve. The remarkable property of QKD is that its security can be established in the information-theoretic setting, without appealing to any computational assumptions. Proving the security of CV-QKD protocols is challenging since the protocols are described in an infinite-dimensional Fock space. One of the open questions in CV-QKD was establishing security for two-way QKD protocols against general attacks. We exploit the invariance of Unitary group U(n) of the protocol to establish composable security against general attacks. We answer another pressing question in the field of CV-QKD with a discrete modulation by establishing the asymptotic security of such protocols against collective attacks. We provide a general technique to derive a lower bound on the secret key rate by formulating the problem as a semidefinite program. Quantum money exploits the no-cloning property of quantum mechanics to generate unforgeable tokens, banknotes, and credit cards. We propose a CV private-key quantum money scheme with classical verification. The motivation behind this protocol is to facilitate the process of practical implementation. Previous classical verification money schemes use single-photon detectors for verification, while our protocols use coherent detection
Lamoureux, Louis-Philippe. "Theoretical and experimental aspects of quantum cryptographic protocols". Doctoral thesis, Universite Libre de Bruxelles, 2006. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210776.
Texto completo da fonte
La présente dissertation a pour but de mettre en avance ces potentiels, tant dans le domaine théorique qu’expérimental. Plus précisément, dans un premier temps, nous étudierons des protocoles de communication quantique et démontrerons que ces protocoles offrent des avantages de sécurité qui n’ont pas d’égaux en communication classique. Dans un deuxième temps nous étudierons trois problèmes spécifiques en clonage quantique ou chaque solution
apportée pourrait, à sa façon, être exploitée dans un problème de communication quantique.
Nous débuterons par décrire de façon théorique le premier protocole de communication quantique qui a pour but la distribution d’une clé secrète entre deux parties éloignées. Ce chapitre nous permettra d’introduire plusieurs concepts et outils théoriques qui seront nécessaires dans les chapitres successifs. Le chapitre suivant servira aussi d’introduction, mais cette fois-ci penché plutôt vers le côté expériemental. Nous présenterons une élégante technique qui nous permettra d’implémenter des protocoles de communication quantique de façon simple. Nous décrirons ensuite des expériences originales de communication quantique basées sur cette technique. Plus précisément, nous introduirons le concept de filtration d’erreur et utiliserons cette technique afin d’implémenter une distribution de clé quantique bruyante qui ne pourrait pas être sécurisé sans cette technique. Nous démontrerons ensuite des expériences implémentant le tirage au sort quantique et d’identification quantique.
Dans un deuxième temps nous étudierons des problèmes de clonage quantique basé sur le formalisme introduit dans le chapitre d’introduction. Puisqu’il ne sera pas toujours possible de prouver l’optimalité de nos solutions, nous introduirons une technique numérique qui nous
permettra de mettre en valeur nos résultats.
Doctorat en sciences, Spécialisation physique
info:eu-repo/semantics/nonPublished
Mamann, Hadriel. "Cold-atomic ensemble implemented as an efficient optical quantum memory layer in a cryptographic protocol". Electronic Thesis or Diss., Sorbonne université, 2024. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2024SORUS120.pdf.
Texto completo da fonteCombining cryptographic protocols with quantum memories is an important step for quantum network development in order to establish secure communications where information can be stored and retrieved on demand. One possible use case of these networks is to perform authenticated transactions synchronized by the use of memories. However, the losses and noise added by storage devices can be exploited by dishonest agents to hide their cheating attempts. The constraints to operate in a secure regime are thus very demanding in terms of memory efficiency and fidelity. This thesis focuses on the implementation of a cold-atomic ensemble used as an EIT-based quantum memory in a cryptographic protocol. The key ingredients to optimize the storage-and-retrieval efficiency and the method employed to mitigate the decoherence sources are detailed. This work reports the first demonstration of the unforgeable quantum money including an intermediate quantum memory layer, taking advantage of our highly-efficient and low-noise storage platform. The next step would be to spatially multiplex the atomic cloud in order to store the whole sequence of random qubits at once. In this scenario, the multimode capacity of our memory has been numerically simulated using two different spatial multiplexing techniques
Chailloux, André. "Quantum coin flipping and bit commitment : optimal bounds, pratical constructions and computational security". Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112121/document.
Texto completo da fonteQuantum computing allows us to revisit the study of quantum cryptographic primitives with information theoretic security. In 1984, Bennett and Brassard presented a protocol of quantum key distribution. In this protocol, Alice and Bob cooperate in order to share a common secret key k, which has to be unknown for a third party that has access to the communication channel. They showed how to perform this task quantumly with an information theoretic security; which is impossible classically.In my thesis, I study cryptographic primitives with two players that do not trust each other. I study mainly coin flipping and bit commitment. Classically, both these primitives are impossible classically with information theoretic security. Quantum protocols for these primitives where constructed where cheating players could cheat with probability stricly smaller than 1. However, Lo, Chau and Mayers showed that these primitives are impossible to achieve perfectly even quantumly if one requires information theoretic security. I study to what extent imperfect protocols can be done in this setting.In the first part, I construct a quantum coin flipping protocol with cheating probabitlity of 1/root(2) + eps for any eps > 0. This completes a result by Kitaev who showed that in any quantum coin flipping protocol, one of the players can cheat with probability at least 1/root(2). I also constructed a quantum bit commitment protocol with cheating probability 0.739 + eps for any eps > 0 and showed that this protocol is essentially optimal. I also derived some upper and lower bounds for quantum oblivious transfer, which is a universal cryptographic primitive.In the second part, I study some practical aspects related to these primitives. I take into account losses than can occur when measuring a quantum state. I construct a Quantum Coin Flipping and Quantum Bit Commitment protocols which are loss-tolerant and have cheating probabilities of 0.859. I also construct these primitives in the device independent model, where the players do not trust their quantum device. Finally, in the third part, I study these cryptographic primitives with information theoretic security. More precisely, I study the relationship between computational quantum bit commitment and quantum zero-knowledge protocols
BIN, ALI NORSHAMSURI. "Implementation of Quantum Cryptography Protocol". Doctoral thesis, Università degli Studi di Camerino, 2014. http://hdl.handle.net/11581/401770.
Texto completo da fonteColisson, Léo. "Study of Protocols Between Classical Clients and a Quantum Server". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS105.
Texto completo da fonteQuantum computers promise surprising powers of computation by exploiting the stunning physical properties of infinitesimally small particles. I focused on designing and proving the security of protocols that allow a purely classical client to use the computational resources of a quantum server, so that the performed computation is never revealed to the server. To this end, I develop a modular tool to generate on a remote server a quantum state that only the client is able to describe, and I show how multi-qubits quantum states can be generated more efficiently. I also prove that there is no such protocol that is secure in a generally composable model of security, including when our module is used in the UBQC protocol. In addition to delegated computation, this tool also proves to be useful for performing a task that might seem impossible to achieve at first sight: proving advanced properties on a quantum state in a non-interactive and non-destructive way, including when this state is generated collaboratively by several participants. This can be seen as a quantum analogue of the classical Non-Interactive Zero-Knowledge proofs. This property is particularly useful to filter the participants of a protocol without revealing their identity, and may have applications in other domains, for example to transmit a quantum state over a network while hiding the source and destination of the message. Finally, I discuss my ongoing independent work on One-Time Programs, mixing quantum cryptography, error correcting codes and information theory
Neves, Simon. "Photonic Resources for the Implementation of Quantum Network Protocols". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS364.
Texto completo da fonteThe security of modern communication networks can be enhanced thanks to the laws of quantum mechanics. In this thesis, we develop a source of photon-pairs, emitted via spontaneous parametric down-conversion, which we use to demonstrate new quantum-cryptographic primitives. Pairs are used as heralded single-photons or as close-to-maximally entangled pairs. We also provide a novel design in order to adapt this source to multipartite entanglement generation. We provide the first experimental implementation of quantum weak coin flipping protocol. It allows two distant players to decide of a random winner. We demonstrate a refined and loss-tolerent version of a recently proposed theoretical protocol, using heralded single-photons mixed with vacuum to produce entanglement. It displays cheat-sensitivity, allowed by quantum interference and a fast optical switch. We also provide a new protocol for certifying the transmission of an unmeasured qubit through a lossy and untrusted channel. The security is based on new fundamental results of lossy quantum channels. We device-independently test the channel’s quality, using self-testing of Bell or steering inequalities thanks to photon-pairs entangled in polarization to probe the channel. We show it allows the certification of quantum communication for a large amount of losses induced by the channel
Music, Luka. "Multi-Party Quantum Cryptography : from Folklore to Real-World". Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS412.
Texto completo da fonteQuantum cryptography builds upon decades of advances both in classical cryptography and networks. However, contrary to its classical counterparts, it is still in its infancy applicability-wise, even in the scenario where powerful quantum computers are readily available, and more theoretical work is required before it can provide concrete benefits. The first goal is to formalise in rigorous quantum security frameworks the properties of various techniques that have been transposed, often without proper justification, from the classical world.Then, the recent developments in quantum technologies suggest a mostly cloud-based future availability of quantum devices. Therefore, quantum computation and communication cost of protocol participants must be lowered before being useful.Finally, in most situations, additional steps need to be taken to tailor protocols to the specifications of devices. This allows for optimisations both in terms of quantum memory and operation requirements.This thesis contributes to these three aspects by: (i) giving the first general security definition of the Quantum Cut-and-Choose, a technique for proving the correctness of a quantum message; (ii) presenting a more realistic framework of security against superposition attacks, where classical protocols run on inherently quantum devices; (iii) constructing an efficient delegated multi-party quantum computation protocol, allowing clients to delegate securely to a quantum server a private computation; (iv) building a method for verifying the honesty of a quantum server performing computations on behalf of a client with no operation or memory overhead compared to the unprotected computation
Javelle, Jérôme. "Cryptographie Quantique : Protocoles et Graphes". Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM093/document.
Texto completo da fonteI want to realize an optimal theoretical model for quantum secret sharing protocols based on graph states. The main parameter of a threshold quantum secret sharing scheme is the size of the largest set of players that can not access the secret. Thus, my goal is to find a collection of protocols for which the value of this parameter is the smallest possible. I also study the links between quantum secret sharing protocols and families of curves in algebraic geometry
Zhang, Zheshen. "Quantum key distribution protocols with high rates and low costs". Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28240.
Texto completo da fonteLivros sobre o assunto "Quantum cryptographic protocols"
Bolfing, Andreas. Cryptographic Primitives in Blockchain Technology. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198862840.001.0001.
Texto completo da fonteCryptography Algorithms: A Guide to Algorithms in Blockchain, Quantum Cryptography, Zero-Knowledge Protocols, and Homomorphic Encryption. de Gruyter GmbH, Walter, 2022.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Quantum cryptographic protocols"
Shang, Tao, e Jianwei Liu. "Security Analysis of Quantum Cryptographic Protocols". In Secure Quantum Network Coding Theory, 191–202. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3386-0_9.
Texto completo da fonteHallgren, Sean, Adam Smith e Fang Song. "Classical Cryptographic Protocols in a Quantum World". In Advances in Cryptology – CRYPTO 2011, 411–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22792-9_23.
Texto completo da fonteDamgård, Ivan. "Quantum Communication Attacks on Classical Cryptographic Protocols". In Lecture Notes in Computer Science, 181. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20728-0_16.
Texto completo da fonteAnanth, Prabhanjan, e Rolando L. La Placa. "Secure Quantum Extraction Protocols". In Theory of Cryptography, 123–52. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64381-2_5.
Texto completo da fonteNiemiec, Marcin, Łukasz Romański e Marcin Święty. "Quantum Cryptography Protocol Simulator". In Communications in Computer and Information Science, 286–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21512-4_34.
Texto completo da fonteSchauer, S. "Attack Strategies on QKD Protocols". In Applied Quantum Cryptography, 71–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-04831-9_5.
Texto completo da fonteAbd-El-Atty, Bassem, Salvador E. Venegas-Andraca e Ahmed A. Abd El-Latif. "Quantum Information Protocols for Cryptography". In Studies in Big Data, 3–23. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-63639-9_1.
Texto completo da fonteTakashima, Katsuyuki. "Post-Quantum Constant-Round Group Key Exchange from Static Assumptions". In International Symposium on Mathematics, Quantum Theory, and Cryptography, 251–72. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5191-8_18.
Texto completo da fonteLai, Russell W. F., Giulio Malavolta e Nicholas Spooner. "Quantum Rewinding for Many-Round Protocols". In Theory of Cryptography, 80–109. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-22318-1_4.
Texto completo da fonteGaborit, Philippe, Julien Schrek e Gilles Zémor. "Full Cryptanalysis of the Chen Identification Protocol". In Post-Quantum Cryptography, 35–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25405-5_3.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Quantum cryptographic protocols"
Pacheco, Rodrigo, Douglas Braga, Iago Passos, Thiago Araújo, Vinícius Lagrota e Murilo Coutinho. "libharpia: a New Cryptographic Library for Brazilian Elections". In Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/sbseg.2022.224098.
Texto completo da fonteCho, Hannah, Daniel Quinter, Mohammad Sheikhattari, Franz J. Klein e Charles W. Clark. "Random Number Generation with Quantum Computers". In Frontiers in Optics. Washington, D.C.: Optica Publishing Group, 2022. http://dx.doi.org/10.1364/fio.2022.jw5a.72.
Texto completo da fonteFung, Chi-Hang Fred, e Hoi-Kwong Lo. "A Survey on Quantum Cryptographic Protocols and Their Security". In 2007 Canadian Conference on Electrical and Computer Engineering. IEEE, 2007. http://dx.doi.org/10.1109/ccece.2007.285.
Texto completo da fonteLopes, Minal, e Nisha Sarwade. "On the performance of quantum cryptographic protocols SARG04 and KMB09". In 2015 International Conference on Communication, Information & Computing Technology (ICCICT). IEEE, 2015. http://dx.doi.org/10.1109/iccict.2015.7045661.
Texto completo da fonteKrawec, Walter O. "A genetic algorithm to analyze the security of quantum cryptographic protocols". In 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2016. http://dx.doi.org/10.1109/cec.2016.7744047.
Texto completo da fonteYasmin, S., e G. Murali. "A new framework tor analyzing surveillance of quantum cryptographic protocols using genetic algorithm". In 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS). IEEE, 2017. http://dx.doi.org/10.1109/icecds.2017.8390133.
Texto completo da fonteAdhikari, Tinku, Arindam Ghosh, Ajoy Kumar Khan, Swarnalina Laha, Purbita Mitra e Raja Karmakar. "Quantum Resistance for Cryptographic Keys in Classical Cryptosystems: A Study on QKD Protocols". In 2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2021. http://dx.doi.org/10.1109/icccnt51525.2021.9579624.
Texto completo da fonteMonteiro, Fábio S., Denise Goya e Routo Terada. "Aprimoramento de Protocolo de Identificação Baseado no Problema MQ". In Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2012. http://dx.doi.org/10.5753/sbseg.2012.20537.
Texto completo da fonteRass, Stefan, e Christian Kollmitzer. "Adaptive Error Correction with Dynamic Initial Block Size in Quantum Cryptographic Key Distribution Protocols". In 2009 Third International Conference on Quantum, Nano and Micro Technologies (ICQNM). IEEE, 2009. http://dx.doi.org/10.1109/icqnm.2009.27.
Texto completo da fonteBaranov, V. V., A. V. Malibashev e I. N. Tsygulev. "Development of a Training System for Modeling and Demonstrating Cryptographic Protocols Quantum Key Distribution". In 2020 International Multi-Conference on Industrial Engineering and Modern Technologies (FarEastCon). IEEE, 2020. http://dx.doi.org/10.1109/fareastcon50210.2020.9271650.
Texto completo da fonteRelatórios de organizações sobre o assunto "Quantum cryptographic protocols"
Allende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, junho de 2021. http://dx.doi.org/10.18235/0003313.
Texto completo da fonteSoloviev, V. N., e Y. V. Romanenko. Economic analog of Heisenberg uncertainly principle and financial crisis. ESC "IASA" NTUU "Igor Sikorsky Kyiv Polytechnic Institute", maio de 2017. http://dx.doi.org/10.31812/0564/2463.
Texto completo da fonte