<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Iranian Society of Cryptology</PublisherName>
				<JournalTitle>The ISC International Journal of Information Security</JournalTitle>
				<Issn>2008-2045</Issn>
				<Volume>15</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2023</Year>
					<Month>07</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Oblivious Transfer Using Generalized Jacobian of Elliptic Curves</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>260</FirstPage>
			<LastPage>273</LastPage>
			<ELocationID EIdType="pii">172258</ELocationID>
			
<ELocationID EIdType="doi">10.22042/isecure.2023.336301.779</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Maryam</FirstName>
					<LastName>Rezaei Kashi</LastName>
<Affiliation>Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mojtaba</FirstName>
					<LastName>Bahramian</LastName>
<Affiliation>Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>04</Month>
					<Day>06</Day>
				</PubDate>
			</History>
		<Abstract>‎Oblivious transfer is one of the important tools in cryptography‎, ‎in which a sender sends a message to a receiver with a probability between 0 and 1‎, ‎while the sender remains oblivious that the receiver has received the message‎.&lt;br /&gt;‎A flavor of $OT$ schemes is chosen $t$-out-of-$k$ oblivious transfer ($OT^t_k$)‎. ‎In an $OT^t_k$ scheme‎, ‎a sender transfers $k$ messages to a receiver‎, ‎the receiver can learn only $t$ of them‎, ‎and the sender remains oblivious to which secrets are extracted by the receiver‎. &lt;br /&gt;‎In this paper‎, ‎we first propose a type of Diffie-Hellman key exchange protocol using the generalized Jacobian of elliptic curves‎. ‎Next‎, ‎we introduce simple‎, ‎secure two-round algorithms for $OT$‎, ‎$OT^1_2$‎, ‎$OT^t_k$‎.&lt;br /&gt;‎The security of proposed protocols is based on the intractability assumption of solving discrete logarithm problem; furthermore‎, ‎in our $OT$ schemes‎, ‎it is not necessary to map the messages to the points on the elliptic curve‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">‎Elliptic Curves</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Generalized Jacobians</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Oblivious Transfer</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">t-out-of-k Oblivious Transfer</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://www.isecure-journal.com/article_172258_fa14b69b64c01cc8257b477574da8242.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
