{"title":"可验证的秘密共享和在存在错误的情况下实现同时性","authors":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch","doi":"10.1109/SFCS.1985.64","DOIUrl":null,"url":null,"abstract":"Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only sufficiently many pieces. 'rhe novelty is that everyone can verify that all received a \"valid\" piece of the secret without having any idea of what the secret is. One application of this tool is the simulation of simultaneous-broadcast networks on semi-synchronous broadcast networks.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"907","resultStr":"{\"title\":\"Verifiable secret sharing and achieving simultaneity in the presence of faults\",\"authors\":\"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch\",\"doi\":\"10.1109/SFCS.1985.64\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only sufficiently many pieces. 'rhe novelty is that everyone can verify that all received a \\\"valid\\\" piece of the secret without having any idea of what the secret is. One application of this tool is the simulation of simultaneous-broadcast networks on semi-synchronous broadcast networks.\",\"PeriodicalId\":296739,\"journal\":{\"name\":\"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"907\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1985.64\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1985.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Verifiable secret sharing and achieving simultaneity in the presence of faults
Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only sufficiently many pieces. 'rhe novelty is that everyone can verify that all received a "valid" piece of the secret without having any idea of what the secret is. One application of this tool is the simulation of simultaneous-broadcast networks on semi-synchronous broadcast networks.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
