Relevant bibliographies by topics / Oblivious transfer protocols

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Oblivious transfer protocols'

Author: Grafiati
Published: 4 June 2021
Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Oblivious transfer protocols.'

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.

Journal articles on the topic "Oblivious transfer protocols"

1

Sikora, Jamie. "On the existence of loss-tolerant quantum oblivious transfer protocols." Quantum Information and Computation 12, no. 7&8 (July 2012): 609–19. http://dx.doi.org/10.26421/qic12.7-8-6.

Full text
Abstract:
Oblivious transfer is the cryptographic primitive where Alice sends one of two bits to Bob but is oblivious to the bit received. Using quantum communication, we can build oblivious transfer protocols with security provably better than any protocol built using classical communication. However, with imperfect apparatus, one needs to consider other attacks. In this paper, we present an oblivious transfer protocol which is impervious to lost messages.
APA, Harvard, Vancouver, ISO, and other styles
2

Nikov, Ventzislav, Svetla Nikova, and Bart Preneel. "On Distributed Oblivious Transfer." Serdica Journal of Computing 1, no. 3 (September 26, 2007): 313–36. http://dx.doi.org/10.55630/sjc.2007.1.313-336.

Full text
Abstract:
This paper is about unconditionally secure distributed protocols for oblivious transfer, as proposed by Naor and Pinkas and generalized by Blundo et al. In this setting a Sender has ζ secrets and a Receiver is interested in one of them. The Sender distributes the information about the secrets to n servers, and a Receiver must contact a threshold of the servers in order to compute the secret. We present a non-existence result and a lower bound for the existence of one-round, threshold, distributed oblivious transfer protocols, generalizing the results of Blundo et al. A threshold based construc
APA, Harvard, Vancouver, ISO, and other styles
3

Costa, Bruno, Pedro Branco, Manuel Goulão, Mariano Lemus, and Paulo Mateus. "Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting." Entropy 23, no. 8 (July 31, 2021): 1001. http://dx.doi.org/10.3390/e23081001.

Full text
Abstract:
Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious
APA, Harvard, Vancouver, ISO, and other styles
4

Chailloux, Andre, Iordanis Kerenidis, and Jamie Sikora. "Lower bounds for quantum oblivious transfer." Quantum Information and Computation 13, no. 1&2 (January 2013): 158–77. http://dx.doi.org/10.26421/qic13.1-2-9.

Full text
Abstract:
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest player's cheating. Finding the optimal security parameters in such protocols is an important open question. In this paper we show that every 1-out-of-2 oblivious transfer protocol allows a dishonest party to cheat with probability bounded below by a constant strictly larger than $1/2$. Alice's cheating is defined as her probability of guessing Bob's index, and Bob's cheating is defined as his probability of guess
APA, Harvard, Vancouver, ISO, and other styles
5

Song, Yaqi, and Li Yang. "Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer." Applied Sciences 8, no. 10 (October 19, 2018): 1990. http://dx.doi.org/10.3390/app8101990.

Full text
Abstract:
Oblivious transfer (OT) and bit commitment (BC) are two-party cryptographic protocols which play crucial roles in the construction of various cryptographic protocols. We propose three practical quantum cryptographic protocols in this paper. We first construct a practical quantum random oblivious transfer (R-OT) protocol based on the fact that non-orthogonal states cannot be reliably distinguished. Then, we construct a fault-tolerant one-out-of-two oblivious transfer ( O T 1 2 ) protocol based on the quantum R-OT protocol. Afterwards, we propose a quantum bit commitment (QBC) protocol which exe
APA, Harvard, Vancouver, ISO, and other styles
6

Danoyan, D. H. "EXTENDING WHITE-BOX CRYPTOGRAPHY BASED OBLIVIOUS TRANSFER PROTOCOL." Proceedings of the YSU A: Physical and Mathematical Sciences 50, no. 1 (239) (March 18, 2016): 40–44. http://dx.doi.org/10.46991/psyu:a/2016.50.1.040.

Full text
Abstract:
Secure computation platforms are becoming one of the most demanded cryptographic tools utilized in diverse applications, where the performance is critical. This point makes important the optimization of every component of secure computation systems. Oblivious Transfer (OT) is a fundamental cryptographic primitive heavily used in such protocols. Most of the OT protocols used today are based on public-key cryptography, hence their efficiency suffers heavily from the number of modular exponentiation operations done. OT extensions were introduced to reduce the number of basic OT protocol execution
APA, Harvard, Vancouver, ISO, and other styles
7

Kundu, Srijita, Jamie Sikora, and Ernest Y. Z. Tan. "A device-independent protocol for XOR oblivious transfer." Quantum 6 (May 30, 2022): 725. http://dx.doi.org/10.22331/q-2022-05-30-725.

Full text
Abstract:
Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. Ideally, Alice should not learn Bob's desired function choice and Bob should not learn any more than what is logically implied by the function value. While decent quantum protocols for this task are known, many become completely insecure if an adversary were to control the quantum devices used in the implementation of the protocol. In this work we give a fully device-independent quantum protocol for XOR oblivious transfer.
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Zengpeng, Can Xiang, and Chengyu Wang. "Oblivious Transfer via Lossy Encryption from Lattice-Based Cryptography." Wireless Communications and Mobile Computing 2018 (September 2, 2018): 1–11. http://dx.doi.org/10.1155/2018/5973285.

Full text
Abstract:
Authentication is the first defence line to prevent malicious entities to access smart mobile devices (or SMD). Essentially, there exist many available cryptographic primitives to design authentication protocols. Oblivious transfer (OT) protocol is one of the important cryptographic primitives to design authentication protocols. The first lattice-based OT framework under universal composability (UC) model was designed by dual mode encryption and promoted us to find an alternative efficient scheme. We note that “lossy encryption” scheme is an extension of the dual mode encryption and can be use
APA, Harvard, Vancouver, ISO, and other styles
9

Santos, Manuel B., Paulo Mateus, and Armando N. Pinto. "Quantum Oblivious Transfer: A Short Review." Entropy 24, no. 7 (July 7, 2022): 945. http://dx.doi.org/10.3390/e24070945.

Full text
Abstract:
Quantum cryptography is the field of cryptography that explores the quantum properties of matter. Generally, it aims to develop primitives beyond the reach of classical cryptography and to improve existing classical implementations. Although much of the work in this field covers quantum key distribution (QKD), there have been some crucial steps towards the understanding and development of quantum oblivious transfer (QOT). One can show the similarity between the application structure of both QKD and QOT primitives. Just as QKD protocols allow quantum-safe communication, QOT protocols allow quan
APA, Harvard, Vancouver, ISO, and other styles
10

INOUE, Daisuke, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Oblivious transfer protocols"

1

Zhang, Jun Qi, University of Western Sydney, of Science Technology and Environment College, and 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.

Full text
Abstract:
Security is a major issue for electronic commerce. Crytography is the foundation of security and oblivious transfer (OT) protocols are one primitive of modern cryptography. The main goal of this dissertation is to develop new and more efficient OT protocols and explore their applications in electronic commerce. A new m out of n OT scheme is proposed, its implementation, security and efficiency are discussed, and it is compared with a previous OT scheme. The analysis shows that the previous OT protocol can be regarded as a special case of the new proposed OT scheme. The new OT scheme's applicab
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
Security is a major issue for electronic commerce. Crytography is the foundation of security and oblivious transfer (OT) protocols are one primitive of modern cryptography. The main goal of this dissertation is to develop new and more efficient OT protocols and explore their applications in electronic commerce. A new m out of n OT scheme is proposed, its implementation, security and efficiency are discussed, and it is compared with a previous OT scheme. The analysis shows that the previous OT protocol can be regarded as a special case of the new proposed OT scheme. The new OT scheme's applicab
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vega, 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.

Full text
Abstract:
The problem of secure computation considers a set of parties who do not trust each other and yet want to perform public computations on data sets held privately by each individual. The most important property of secure computations is that they are input-privacy preserving. Intuitively this means that after the computation has finished no party can say something meaningful about the inputs of the other parties -beyond what is implicit in the outcome of the computation. This thesis focuses on the design and analysis of protocols in the pre-processing model with a majority of dishonest parties.
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
L'avènement de l'informatique quantique permet de réétudier les primitives cryptographiques avec une sécurité inconditionnelle, c'est à dire sécurisé même contre des adversaires tout puissants. En 1984, Bennett et Brassard ont construit un protocole quantique de distribution de clé. Dans ce protocole, deux joueurs Alice et Bob coopèrent pour partager une clé secrète inconnue d'une tierce personne Eve. Ce protocole a une sécurité inconditionnelle et n'a pasd'équivalent classique.Dans ma thèse, j'ai étudié les primitives cryptographiques à deux joueurs où ces joueurs ne se font pas confiance. J'
APA, Harvard, Vancouver, ISO, and other styles
6

JYUN-YI-LI and 李俊毅. "Oblivious Transfer Protocols Based on Elliptic Curve Cryptography." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/69881759803951037443.

Full text
Abstract:
碩士<br>南台科技大學<br>資訊管理系<br>96<br>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 protocol
APA, Harvard, Vancouver, ISO, and other styles
7

Lin, Chi-Shin, and 林其新. "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.

Full text
Abstract:
碩士<br>國立嘉義大學<br>資訊工程研究所<br>93<br>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 pri
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
The security of digital goods buyers and sellers is unbalanced. Of course, the property of sellers is protected; for example, when customers acquire digital books or films from Internet's merchants, they only receive the products they have paid for. Unfortunately, the buyers' privacy is rarely respected: purchases are often — without the buyers' knowledge — monitored, recorded, analysed, and sometimes sold to marketing companies. As a consequence, even if the customers do not intend to acquire additional products, their computer screens are later invaded with targeted advertisements. The ma
APA, Harvard, Vancouver, ISO, and other styles
9

Chang, Tyng-Kwei, and 張庭魁. "Researches of Quantum Key Distribution and Quantum Oblivious Transfer Protocols." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/88826602125242601048.

Full text
Abstract:
碩士<br>南台科技大學<br>資訊管理系<br>93<br>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. Fo
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Chi-Hsuan, and 林季玄. "Reusable Oblivious Transfer Protocol." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/62876393658199007448.

Full text
Abstract:
碩士<br>南台科技大學<br>資訊管理系<br>94<br>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 applic
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Oblivious transfer protocols"

1

Hazay, Carmit, and Yehuda Lindell. "Oblivious Transfer and Applications." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhu, Huafei. "Round Optimal Universally Composable Oblivious Transfer Protocols." In Provable Security, 328–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88733-1_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Baiyu, and Daniele Micciancio. "Equational Security Proofs of Oblivious Transfer Protocols." In Public-Key Cryptography – PKC 2018, 527–53. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-76578-5_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Goyal, Vipul, Abhishek Jain, Zhengzhong Jin, and Giulio Malavolta. "Statistical Zaps and New Oblivious Transfer Protocols." In Advances in Cryptology – EUROCRYPT 2020, 668–99. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45727-3_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yao, Gang, Feng Bao, and Robert H. Deng. "Security Analysis of Three Oblivious Transfer Protocols." In Coding, Cryptography and Combinatorics, 385–96. Basel: Birkhäuser Basel, 2004. http://dx.doi.org/10.1007/978-3-0348-7865-4_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Jing, Xiong Li, Licheng Wang, Debiao He, and Xinxin Niu. "Oblivious Transfer Protocols Based on Group Factoring Problem." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhu, Huafei, and Feng Bao. "Adaptive and Composable Oblivious Transfer Protocols (Short Paper)." In Information and Communications Security, 483–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-11145-7_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Korjik, Valeri, and Kirill Morozov. "Generalized Oblivious Transfer Protocols Based on Noisy Channels." In Information Assurance in Computer Networks, 219–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45116-1_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vitse, Vanessa. "Simple Oblivious Transfer Protocols Compatible with Supersingular Isogenies." In Progress in Cryptology – AFRICACRYPT 2019, 56–78. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23696-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhu, Huafei. "Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols." In Cryptology and Network Security, 214–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89641-8_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Oblivious transfer protocols"

1

Pinto, Adriana C. B., Bernardo Machado David, Jeroen van de Graaf, and Anderson C. A. Nascimento. "Universally Composable Committed Oblivious Transfer With A Trusted Initializer." 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.20541.

Full text
Abstract:
Committed Oblivious Transfer (COT) is a two-party primitive that combines one-out-of-two oblivious transfer with bit commitment. In the beginning of COT, a sender is committed to bits b0, b1 and a receiver to a choice bit c. In the end, the receiver is committed to bc without learning anything about b1-c, while the sender learns nothing about c. This primitive implies secure multi-party computation assuming that a broadcast channel is available. In this paper, we introduce the first universally composable unconditionally secure committed oblivious transfer protocol based on a Trusted Initializ
APA, Harvard, Vancouver, ISO, and other styles
2

Qin, Jing, Zhao Hua-wei, and Wang Ming-Qiang. "Non-interactive Oblivious Transfer Protocols." In 2009 International Forum on Information Technology and Applications (IFITA). IEEE, 2009. http://dx.doi.org/10.1109/ifita.2009.180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

David, Bernardo M., Anderson C. A. Nascimento, and Rafael Tonicelli. "Obtaining Efficient Fully Simulatable Oblivious Transfer from General Assumptions." In 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.

Full text
Abstract:
We introduce a general construction of fully simulatable oblivious transfer based on lossy encryption. Furthermore, we extend the common definition of lossy encryption by introducing the notion of computationally lossy encryption. If the cryptosystem used is computationally lossy, our general construction yields oblivious transfer protocols with computational security for both parties. Otherwise, when regular statistically lossy cryptosystems are employed in this construction, it yields oblivious transfer protocols with statistical security for the sender. The construction introduced in this p
APA, Harvard, Vancouver, ISO, and other styles
4

Hsu, Jen-Chieh, Raylin Tso, Yu-Chi Chen, and Mu-En Wu. "Oblivious Transfer Protocols Based on Commutative Encryption." In 2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS). IEEE, 2018. http://dx.doi.org/10.1109/ntms.2018.8328707.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Qin, J., J. Hu, and H. Zhao. "Simulatable Oblivious Transfer Protocols Based on Blind Signature." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Shiuh-Jeng, Yuh-Ren Tsai, and Chien-Chih Shen. "Varied Oblivious Transfer Protocols Enabling Multi-receiver and Applications." In 2010 International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA 2010). IEEE, 2010. http://dx.doi.org/10.1109/bwcca.2010.103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Barreto, Paulo, Gláucio Oliveira, Waldyr Benits, and Anderson Nascimento. "Supersingular Isogeny Oblivious Transfer." In 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.

Full text
Abstract:
Neste artigo, apresentamos um protocolo Oblivious Transfer (OT) que combina um esquema OT juntamente com a primitiva do protocolo Supersingular Isogeny Diffie-Hellman (SIDH). Nossa proposta é um candidato para segurança pós-quântica OT e demonstra que o SIDH naturalmente suporta a funcionalidade OT. Consideramos o protocolo na configuração mais simples de (cid:0)2 1 (cid:1)-SIOT e analisamos a sua segurança.
APA, Harvard, Vancouver, ISO, and other styles
8

Yao Gang and Feng Dengguo. "Proxy oblivious transfer protocol." In First International Conference on Availability, Reliability and Security (ARES'06). IEEE, 2006. http://dx.doi.org/10.1109/ares.2006.101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Parakh, Abhishek. "A quantum oblivious transfer protocol." In SPIE Optical Engineering + Applications, edited by Chandrasekhar Roychoudhuri, Al F. Kracklauer, and Hans De Raedt. SPIE, 2013. http://dx.doi.org/10.1117/12.2024305.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

David, Bernardo M., Anderson C. A. Nascimento, and Rodrigo B. Nogueira. "Oblivious Transfer Based on the McEliece Assumptions with Unconditional Security for the Sender." In 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.

Full text
Abstract:
In this paper we propose the first code-based oblivious transfer protocol with perfect (unconditional) security for one of the parties. To obtain this result we show that the McEliece cryptosystem is rerandomizable, a property that might be of independent interest.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Oblivious transfer protocols' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography