Littérature scientifique sur le sujet « Oblivious transfer protocols »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Oblivious transfer protocols ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Oblivious transfer protocols"
Sikora, Jamie. « On the existence of loss-tolerant quantum oblivious transfer protocols ». Quantum Information and Computation 12, no 7&8 (juillet 2012) : 609–19. http://dx.doi.org/10.26421/qic12.7-8-6.
Texte intégralNikov, Ventzislav, Svetla Nikova et Bart Preneel. « On Distributed Oblivious Transfer ». Serdica Journal of Computing 1, no 3 (26 septembre 2007) : 313–36. http://dx.doi.org/10.55630/sjc.2007.1.313-336.
Texte intégralCosta, Bruno, Pedro Branco, Manuel Goulão, Mariano Lemus et Paulo Mateus. « Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting ». Entropy 23, no 8 (31 juillet 2021) : 1001. http://dx.doi.org/10.3390/e23081001.
Texte intégralChailloux, Andre, Iordanis Kerenidis et Jamie Sikora. « Lower bounds for quantum oblivious transfer ». Quantum Information and Computation 13, no 1&2 (janvier 2013) : 158–77. http://dx.doi.org/10.26421/qic13.1-2-9.
Texte intégralSong, Yaqi, et Li Yang. « Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer ». Applied Sciences 8, no 10 (19 octobre 2018) : 1990. http://dx.doi.org/10.3390/app8101990.
Texte intégralDanoyan, D. H. « EXTENDING WHITE-BOX CRYPTOGRAPHY BASED OBLIVIOUS TRANSFER PROTOCOL ». Proceedings of the YSU A : Physical and Mathematical Sciences 50, no 1 (239) (18 mars 2016) : 40–44. http://dx.doi.org/10.46991/psyu:a/2016.50.1.040.
Texte intégralKundu, Srijita, Jamie Sikora et Ernest Y. Z. Tan. « A device-independent protocol for XOR oblivious transfer ». Quantum 6 (30 mai 2022) : 725. http://dx.doi.org/10.22331/q-2022-05-30-725.
Texte intégralLi, Zengpeng, Can Xiang et Chengyu Wang. « Oblivious Transfer via Lossy Encryption from Lattice-Based Cryptography ». Wireless Communications and Mobile Computing 2018 (2 septembre 2018) : 1–11. http://dx.doi.org/10.1155/2018/5973285.
Texte intégralSantos, Manuel B., Paulo Mateus et Armando N. Pinto. « Quantum Oblivious Transfer : A Short Review ». Entropy 24, no 7 (7 juillet 2022) : 945. http://dx.doi.org/10.3390/e24070945.
Texte intégralINOUE, Daisuke, et Keisuke TANAKA. « Symmetricity of the Protocols Related to Oblivious Transfer ». IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E92-A, no 1 (2009) : 217–21. http://dx.doi.org/10.1587/transfun.e92.a.217.
Texte intégralThèses sur le sujet "Oblivious transfer protocols"
Zhang, Jun Qi, University of Western Sydney, of Science Technology and Environment College et School of Computing and Information Technology. « Oblivious transfer protocols for securing electronic commerce ». THESIS_CSTE_CIT_Zhang_J.xml, 2002. http://handle.uws.edu.au:8081/1959.7/289.
Texte intégralMaster of Science (Hons)
Zhang, Jun Qi. « Oblivious transfer protocols for securing electronic commerce ». Thesis, View thesis View thesis, 2002. http://handle.uws.edu.au:8081/1959.7/289.
Texte intégralZhang, Jun Qi. « Oblivious transfer protocols for securing electronic commerce / ». View thesis View thesis, 2002. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20030417.113506/index.html.
Texte intégralVega, Enrique Larraia de. « Universally composable protocols for multi-party computation and oblivious transfer ». Thesis, University of Bristol, 2015. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.689689.
Texte intégralChailloux, André. « Quantum coin flipping and bit commitment : optimal bounds, pratical constructions and computational security ». Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112121/document.
Texte intégralQuantum 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
JYUN-YI-LI et 李俊毅. « Oblivious Transfer Protocols Based on Elliptic Curve Cryptography ». Thesis, 2008. http://ndltd.ncl.edu.tw/handle/69881759803951037443.
Texte intégral南台科技大學
資訊管理系
96
Oblivious transfer protocol is an important research topic in the field of cryptography. It includes two parties: Sender and Receiver, where sender wants to convey secret values to receiver, and receiver can choose the secret value he wanted. But the sender cannot know which secret value the receiver chose. Moreover, the receiver cannot get any secret values that he did not choose. According to the amount of secret values that the sender holds and the receiver can choose, oblivious transfer protocols can be classified as all or nothing oblivious transfer protocols, 1 out of 2 oblivious transfer protocols, 1 out of n oblivious transfer protocols and t out of n oblivious transfer protocols. However, only 1 out of 2 oblivious transfer protocols based on elliptic curve cryptography are designed. Therefore, this essay will propose 1 out of n oblivious transfer protocol and t out of n oblivious transfer protocol based on elliptic curve cryptography to enhance the effects and extend the applied environments.
Lin, Chi-Shin, et 林其新. « Design and Analysis of Efficient k-out-of-n Oblivious Transfer and Priced Oblivious Transfer Protocols ». Thesis, 2005. http://ndltd.ncl.edu.tw/handle/06460745449799663255.
Texte intégral國立嘉義大學
資訊工程研究所
93
The oblivious transfer has a critical problem on the sender’s communication complexity. Therefore, in this thesis, we develop an efficient k-out-of-n Oblivious Transfer whose result is superior to all previous solutions in terms of sender’s communication complexity. In our k-out-of-n Oblivious Transfer protocol, the sender cannot determine which k secret messages the receiver received, and the receiver cannot get the other remaining n-k secret messages if solving the factorization problem is hard. When k=1, we particularly suggest an efficient solution. The priced oblivious transfer which can be applied to sell digital goods, was introduced by Aiello et al. However, in the previous work, such as Aiello et al.’s and Tobias’s papers, a customer buys only one item in each transaction but must receive n ciphertexts from the vendor, which is inefficient because of increasing n-1 non-essential transmissions. For this reason, we present an efficient priced k-out-of-n scheme. In our scheme, the communication cost of the vendor can be greatly reduced.
Corniaux, Christian L. F. « Exploratory designs of unconditionally secure distributed oblivious transfer protocols ». Thesis, 2016. https://researchonline.jcu.edu.au/43771/1/43771-corniaux-2016-thesis.pdf.
Texte intégralChang, Tyng-Kwei, et 張庭魁. « Researches of Quantum Key Distribution and Quantum Oblivious Transfer Protocols ». Thesis, 2005. http://ndltd.ncl.edu.tw/handle/88826602125242601048.
Texte intégral南台科技大學
資訊管理系
93
Due to the rapid development of information technology, data communication is more frequent in the network. When two parties need to communicate in secret, they have to share a secret key in advance. The sender encrypts data, and then delivers it to the receiver. The receiver decrypts it using the same secret key. They can share the secret key by public key cryptography. In order to against breaking, the length of the secret key has to be increased. However, even the length of the secret key is long, they still cannot against the attacks of quantum computers. Fortunately, Bennett and Brassard in 1984 proposed a BB84 quantum key distribution protocol, which is secure from the attack of quantum computers. Since BB84 protocol, the communication security has stepped forward to a new milestone. However, the key sharing efficiency is only 50% in BB84 protocol. Therefore, this master thesis will propose two new protocols: The first one is Bases Probability Adjustment (BPA); The second one is Preset Bases Quantum Key Distribution Protocol. These two protocols can improve the key sharing efficiency without affecting the security of BB84. Another research topic of this master thesis is quantum oblivious transfer. It will introduce Crépeau’s 1-out-of-2 quantum oblivious transfer protocol in 1994, and show how to use quantum bit commitment mechanism to prevent the storage attack. This thesis also proposes 1-out-of-2, 1-out-of-n, and m-out-of-n quantum oblivious transfer protocols.
Lin, Chi-Hsuan, et 林季玄. « Reusable Oblivious Transfer Protocol ». Thesis, 2006. http://ndltd.ncl.edu.tw/handle/62876393658199007448.
Texte intégral南台科技大學
資訊管理系
94
Oblivious transfer is an important and basic technique in the field of cryptography. Basically, an oblivious transfer protocol includes two parties, Sender and Receiver. Sender has many secrets, and Receiver can freely choose one from those secrets. However, Receiver’s choice is a secret to Sender; Receiver learns nothing from the other secrets. Oblivious transfer protocols can be applied to private information retrieval, exchange secret, fair electronic contract signing, and Internet auction. Oblivious transfer protocols often need to be reused in many applications. After the initial phase of oblivious transfer protocols is completed and the initial parameters can be used repeatedly, the computation cost and transmission cost will be reduced. However, some security problems could be appeared because of reuse. In 2005, Huang and Chang proposed an efficient t-out-of-n oblivious transfer protocol, but this protocol suffers from the un-chosen message replay attack. This thesis will propose a reusable oblivious transfer protocol, which can resist the un-chosen message replay attack. Besides, Wu, Zhang, and Wang in 2003 proposed another t-out-of-n oblivious transfer protocol, which mentioned it cannot efficiently prevent the man-in-the-middle attack in an insecure channel. Hence, this study proposes two authenticated oblivious transfer protocols. One is an oblivious transfer protocol with explicated user authentication, and the other is an oblivious transfer protocol with implicated user authentication. Both protocols can efficiently avoid man-in-the-middle attack.
Chapitres de livres sur le sujet "Oblivious transfer protocols"
Hazay, Carmit, et Yehuda Lindell. « Oblivious Transfer and Applications ». Dans Efficient Secure Two-Party Protocols, 177–212. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14303-8_7.
Texte intégralZhu, Huafei. « Round Optimal Universally Composable Oblivious Transfer Protocols ». Dans Provable Security, 328–34. Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88733-1_23.
Texte intégralLi, Baiyu, et Daniele Micciancio. « Equational Security Proofs of Oblivious Transfer Protocols ». Dans Public-Key Cryptography – PKC 2018, 527–53. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-76578-5_18.
Texte intégralGoyal, Vipul, Abhishek Jain, Zhengzhong Jin et Giulio Malavolta. « Statistical Zaps and New Oblivious Transfer Protocols ». Dans Advances in Cryptology – EUROCRYPT 2020, 668–99. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45727-3_23.
Texte intégralYao, Gang, Feng Bao et Robert H. Deng. « Security Analysis of Three Oblivious Transfer Protocols ». Dans Coding, Cryptography and Combinatorics, 385–96. Basel : Birkhäuser Basel, 2004. http://dx.doi.org/10.1007/978-3-0348-7865-4_27.
Texte intégralLi, Jing, Xiong Li, Licheng Wang, Debiao He et Xinxin Niu. « Oblivious Transfer Protocols Based on Group Factoring Problem ». Dans Advances on Broad-Band Wireless Computing, Communication and Applications, 885–92. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49106-6_90.
Texte intégralZhu, Huafei, et Feng Bao. « Adaptive and Composable Oblivious Transfer Protocols (Short Paper) ». Dans Information and Communications Security, 483–92. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-11145-7_38.
Texte intégralKorjik, Valeri, et Kirill Morozov. « Generalized Oblivious Transfer Protocols Based on Noisy Channels ». Dans Information Assurance in Computer Networks, 219–29. Berlin, Heidelberg : Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45116-1_22.
Texte intégralVitse, Vanessa. « Simple Oblivious Transfer Protocols Compatible with Supersingular Isogenies ». Dans Progress in Cryptology – AFRICACRYPT 2019, 56–78. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23696-0_4.
Texte intégralZhu, Huafei. « Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols ». Dans Cryptology and Network Security, 214–25. Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89641-8_15.
Texte intégralActes de conférences sur le sujet "Oblivious transfer protocols"
Pinto, Adriana C. B., Bernardo Machado David, Jeroen van de Graaf et Anderson C. A. Nascimento. « Universally Composable Committed Oblivious Transfer With A Trusted Initializer ». Dans 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.20541.
Texte intégralQin, Jing, Zhao Hua-wei et Wang Ming-Qiang. « Non-interactive Oblivious Transfer Protocols ». Dans 2009 International Forum on Information Technology and Applications (IFITA). IEEE, 2009. http://dx.doi.org/10.1109/ifita.2009.180.
Texte intégralDavid, Bernardo M., Anderson C. A. Nascimento et Rafael Tonicelli. « Obtaining Efficient Fully Simulatable Oblivious Transfer from General Assumptions ». Dans Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2011. http://dx.doi.org/10.5753/sbseg.2011.20567.
Texte intégralHsu, Jen-Chieh, Raylin Tso, Yu-Chi Chen et Mu-En Wu. « Oblivious Transfer Protocols Based on Commutative Encryption ». Dans 2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS). IEEE, 2018. http://dx.doi.org/10.1109/ntms.2018.8328707.
Texte intégralQin, J., J. Hu et H. Zhao. « Simulatable Oblivious Transfer Protocols Based on Blind Signature ». Dans 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). IEEE, 2012. http://dx.doi.org/10.1109/trustcom.2012.263.
Texte intégralWang, Shiuh-Jeng, Yuh-Ren Tsai et Chien-Chih Shen. « Varied Oblivious Transfer Protocols Enabling Multi-receiver and Applications ». Dans 2010 International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA 2010). IEEE, 2010. http://dx.doi.org/10.1109/bwcca.2010.103.
Texte intégralBarreto, Paulo, Gláucio Oliveira, Waldyr Benits et Anderson Nascimento. « Supersingular Isogeny Oblivious Transfer ». Dans Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação, 2019. http://dx.doi.org/10.5753/sbseg.2019.13965.
Texte intégralYao Gang et Feng Dengguo. « Proxy oblivious transfer protocol ». Dans First International Conference on Availability, Reliability and Security (ARES'06). IEEE, 2006. http://dx.doi.org/10.1109/ares.2006.101.
Texte intégralParakh, Abhishek. « A quantum oblivious transfer protocol ». Dans SPIE Optical Engineering + Applications, sous la direction de Chandrasekhar Roychoudhuri, Al F. Kracklauer et Hans De Raedt. SPIE, 2013. http://dx.doi.org/10.1117/12.2024305.
Texte intégralDavid, Bernardo M., Anderson C. A. Nascimento et Rodrigo B. Nogueira. « Oblivious Transfer Based on the McEliece Assumptions with Unconditional Security for the Sender ». Dans Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2010. http://dx.doi.org/10.5753/sbseg.2010.20584.
Texte intégral