基于多项式系数的数据加密秘密共享方案

M. Sathik, A. Selvi
{"title":"基于多项式系数的数据加密秘密共享方案","authors":"M. Sathik, A. Selvi","doi":"10.1109/icccnt.2010.5591565","DOIUrl":null,"url":null,"abstract":"In recent years, there has been increasing trend for multimedia applications to use delegate service providers for content distributions. These delegate services have brought new challenges to the protection of multimedia content confidentiality. Encryption can be used to hide information from unauthorized individuals, either in transit or in storage. This technique transforms the content into unintelligible and unviewable format. This paper proposes data encryption and decryption process using secret sharing scheme. According to this process there are two levels of encryption. The first level, generates the random polynomial of degree (t-1), where t is a threshold value. The second level, evaluates the mean value of the polynomial's coefficients. The mean value is added with the ASCII value of the plain text to get the cipher text. Next the secret value of the polynomial for participant's ID values is generated. This secret is shared among ‘n’ participants. Each one gets their share. The participants reconstruct the polynomial from the shares. Then the cipher text is decrypted to get the original plain text. The comparison of the proposed method with Samier Secret Sharing method reveals that the size of the share is smaller and the protection level is high.","PeriodicalId":134352,"journal":{"name":"2010 Second International conference on Computing, Communication and Networking Technologies","volume":"427 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Secret sharing scheme for data encryption based on polynomial coefficient\",\"authors\":\"M. Sathik, A. Selvi\",\"doi\":\"10.1109/icccnt.2010.5591565\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, there has been increasing trend for multimedia applications to use delegate service providers for content distributions. These delegate services have brought new challenges to the protection of multimedia content confidentiality. Encryption can be used to hide information from unauthorized individuals, either in transit or in storage. This technique transforms the content into unintelligible and unviewable format. This paper proposes data encryption and decryption process using secret sharing scheme. According to this process there are two levels of encryption. The first level, generates the random polynomial of degree (t-1), where t is a threshold value. The second level, evaluates the mean value of the polynomial's coefficients. The mean value is added with the ASCII value of the plain text to get the cipher text. Next the secret value of the polynomial for participant's ID values is generated. This secret is shared among ‘n’ participants. Each one gets their share. The participants reconstruct the polynomial from the shares. Then the cipher text is decrypted to get the original plain text. The comparison of the proposed method with Samier Secret Sharing method reveals that the size of the share is smaller and the protection level is high.\",\"PeriodicalId\":134352,\"journal\":{\"name\":\"2010 Second International conference on Computing, Communication and Networking Technologies\",\"volume\":\"427 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International conference on Computing, Communication and Networking Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icccnt.2010.5591565\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International conference on Computing, Communication and Networking Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icccnt.2010.5591565","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

近年来,多媒体应用程序越来越多地使用委托服务提供商进行内容分发。这些委托服务给多媒体内容的保密性保护带来了新的挑战。加密可以用于向未经授权的个人隐藏信息,无论是在传输中还是在存储中。这种技术将内容转换成难以理解和无法查看的格式。本文提出了一种基于秘密共享方案的数据加解密过程。根据这个过程,有两个级别的加密。第一级生成次数(t-1)的随机多项式,其中t为阈值。第二层,计算多项式系数的平均值。将平均值与明文的ASCII值相加,得到密文。接下来,生成参与者ID值的多项式的秘密值。这个秘密在“n”个参与者之间共享。每个人都有自己的一份。参与者从份额中重构多项式。然后对密文进行解密,得到原始的明文。与Samier秘密共享方法的比较表明,该方法共享的大小更小,保护级别更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Secret sharing scheme for data encryption based on polynomial coefficient
In recent years, there has been increasing trend for multimedia applications to use delegate service providers for content distributions. These delegate services have brought new challenges to the protection of multimedia content confidentiality. Encryption can be used to hide information from unauthorized individuals, either in transit or in storage. This technique transforms the content into unintelligible and unviewable format. This paper proposes data encryption and decryption process using secret sharing scheme. According to this process there are two levels of encryption. The first level, generates the random polynomial of degree (t-1), where t is a threshold value. The second level, evaluates the mean value of the polynomial's coefficients. The mean value is added with the ASCII value of the plain text to get the cipher text. Next the secret value of the polynomial for participant's ID values is generated. This secret is shared among ‘n’ participants. Each one gets their share. The participants reconstruct the polynomial from the shares. Then the cipher text is decrypted to get the original plain text. The comparison of the proposed method with Samier Secret Sharing method reveals that the size of the share is smaller and the protection level is high.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信