Cheating Resistant Implicit Security

Abhishek Parakh
{"title":"Cheating Resistant Implicit Security","authors":"Abhishek Parakh","doi":"10.1109/NCA.2015.32","DOIUrl":null,"url":null,"abstract":"This paper discusses an implicit security algorithm for secure transmission using multiple paths between sender and receiver, secure cloud storage, in a peer-to-peer network and secret sharing applications. The proposed algorithm modifies Shamir's secret sharing scheme such that a group of k-2 or fewer colluding nodes gain only negligible advantage against the honest node. Further, the proposed modifications do not require any additional storage. Here k is the minimum number of nodes that have to pool their partitions together to reconstruct the secret.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 14th International Symposium on Network Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2015.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper discusses an implicit security algorithm for secure transmission using multiple paths between sender and receiver, secure cloud storage, in a peer-to-peer network and secret sharing applications. The proposed algorithm modifies Shamir's secret sharing scheme such that a group of k-2 or fewer colluding nodes gain only negligible advantage against the honest node. Further, the proposed modifications do not require any additional storage. Here k is the minimum number of nodes that have to pool their partitions together to reconstruct the secret.
抗作弊隐式安全
本文讨论了一种隐式安全算法,用于在发送方和接收方之间使用多路径的安全传输、安全云存储、点对点网络和秘密共享应用。该算法修改了Shamir的秘密共享方案,使得一组k-2或更少的串谋节点与诚实节点相比只能获得微不足道的优势。此外,建议的修改不需要任何额外的存储。这里k是必须将其分区汇集在一起以重建秘密的最小节点数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信