A secret sharing scheme based on the Closest Vector Theorem and a modification to a private key cryptosystem

B. Fine, A. Moldenhauer, G. Rosenberger
{"title":"A secret sharing scheme based on the Closest Vector Theorem and a modification to a private key cryptosystem","authors":"B. Fine, A. Moldenhauer, G. Rosenberger","doi":"10.1515/gcc-2013-0012","DOIUrl":null,"url":null,"abstract":"Abstract. We explain and perform the steps for an (n,t) secret sharing scheme based on the closest vector theorem. We then compare this scheme and its complexity to the secret sharing schemes of both Shamir and Panagopoulos. Finally we modify the (n,t) secret sharing scheme to a private key cryptosystem.","PeriodicalId":119576,"journal":{"name":"Groups Complex. Cryptol.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complex. Cryptol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2013-0012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Abstract. We explain and perform the steps for an (n,t) secret sharing scheme based on the closest vector theorem. We then compare this scheme and its complexity to the secret sharing schemes of both Shamir and Panagopoulos. Finally we modify the (n,t) secret sharing scheme to a private key cryptosystem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最接近向量定理的秘密共享方案和对私钥密码系统的改进
摘要我们解释并执行了基于最接近向量定理的(n,t)秘密共享方案的步骤。然后,我们将该方案及其复杂性与Shamir和Panagopoulos的秘密共享方案进行比较。最后,我们将(n,t)秘密共享方案修改为私钥密码系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the intersection of subgroups in free groups: Echelon subgroups are inert On the dimension of matrix representations of finitely generated torsion free nilpotent groups Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem Non-associative key establishment for left distributive systems Generic complexity of the Diophantine problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1