保护共享的加密密钥

1980 IEEE Symposium on Security and Privacy Pub Date : 1980-04-14 DOI:10.1109/SP.1980.10011

G. Davida, R. DeMillo, R. Lipton

{"title":"保护共享的加密密钥","authors":"G. Davida, R. DeMillo, R. Lipton","doi":"10.1109/SP.1980.10011","DOIUrl":null,"url":null,"abstract":"In this paper, we present a scheme for distributing a key to n users in such a way as to require at least k of them (k < n) to be present to construct the original key. The scheme has the property that up to k - 1 defections can be tolerated. It can be implemented simply and efficiently.","PeriodicalId":372320,"journal":{"name":"1980 IEEE Symposium on Security and Privacy","volume":"191 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1980-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Protecting Shared Cryptographic Keys\",\"authors\":\"G. Davida, R. DeMillo, R. Lipton\",\"doi\":\"10.1109/SP.1980.10011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a scheme for distributing a key to n users in such a way as to require at least k of them (k < n) to be present to construct the original key. The scheme has the property that up to k - 1 defections can be tolerated. It can be implemented simply and efficiently.\",\"PeriodicalId\":372320,\"journal\":{\"name\":\"1980 IEEE Symposium on Security and Privacy\",\"volume\":\"191 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1980 IEEE Symposium on Security and Privacy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SP.1980.10011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1980 IEEE Symposium on Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SP.1980.10011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

本文提出了一种将密钥分配给n个用户的方案，该方案要求至少有k个用户(k < n)在场才能构造原始密钥。该方案具有最多可容忍k - 1个缺陷的性质。它可以简单有效地实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Protecting Shared Cryptographic Keys

In this paper, we present a scheme for distributing a key to n users in such a way as to require at least k of them (k < n) to be present to construct the original key. The scheme has the property that up to k - 1 defections can be tolerated. It can be implemented simply and efficiently.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1980 IEEE Symposium on Security and Privacy

自引率

0.00%

发文量

期刊最新文献

Program Committee Protecting Shared Cryptographic Keys A Module Definition Facility for Access Control in Distributed Data Base Systems The Secure Relational Database Management System Kernel: Three Years After On Security Flow Analysis in Computer Systems (Preliminary Report)