<?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>Damghan University Press</PublisherName>
				<JournalTitle>Analytical and Numerical Solutions for Nonlinear Equations</JournalTitle>
				<Issn>3060-785X</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2016</Year>
					<Month>11</Month>
					<Day>15</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Security Analysis of a Hash-Based Secret Sharing Scheme</ArticleTitle>
<VernacularTitle>عنوان</VernacularTitle>
			<FirstPage>93</FirstPage>
			<LastPage>100</LastPage>
			<ELocationID EIdType="pii">59</ELocationID>
			
<ELocationID EIdType="doi">10.22128/gadm.2016.59</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Majid </FirstName>
					<LastName>Farhadi</LastName>
<Affiliation>School of Mathematics and Computer Science, Damghan University, Damghan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Hamideh </FirstName>
					<LastName>Baypoor</LastName>
<Affiliation>School of Mathematics and Computer Science, Damghan University, Damghan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Reza </FirstName>
					<LastName>Mortazavi</LastName>
<Affiliation>School of Engineering, Damghan University, Damghan, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2015</Year>
					<Month>12</Month>
					<Day>28</Day>
				</PubDate>
			</History>
		<Abstract>Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-&lt;br /&gt;ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed by t - 1 or fewer participants. The proposed schemes by Shamir and Blakley have some drawbacks. Multi-secret and veriable schemes were invented to improve old schemes. We analysis the security of hash based&lt;br /&gt;secret sharing schemes, and show that the schemes have some drawbacks. In particular it is shown that the the schemes are not resistant against deceptive behavior by dealer and participants.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Secret sharing schemes</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Minimal authorized subsets</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">cheating</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ansne.du.ac.ir/article_59_3d0ab512aae8ab9ad451b569fc5ba0d2.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
