{"id":"https://openalex.org/W2168970529","doi":"https://doi.org/10.1109/sfcs.1987.4","title":"A practical scheme for non-interactive verifiable secret sharing","display_name":"A practical scheme for non-interactive verifiable secret sharing","publication_year":1987,"publication_date":"1987-10-01","ids":{"openalex":"https://openalex.org/W2168970529","doi":"https://doi.org/10.1109/sfcs.1987.4","mag":"2168970529"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1987.4","doi":"https://doi.org/10.1109/sfcs.1987.4","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1987.4","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004694438","display_name":"Paul Feldman","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Feldman","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004694438"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.1493,"has_fulltext":false,"cited_by_count":1160,"citation_normalized_percentile":{"value":0.90482955,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"427","last_page":"438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11504","display_name":"Advanced Authentication Protocols Security","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"verifiable secret sharing","score":0.9769999980926514},{"id":"https://openalex.org/keywords/non-interactive-protocols","display_name":"non-interactive protocols","score":0.9900000095367432},{"id":"https://openalex.org/keywords/one-round-protocols","display_name":"one-round protocols","score":0.7580000162124634},{"id":"https://openalex.org/keywords/byzantine-agreement","display_name":"Byzantine agreement","score":0.9039999842643738},{"id":"https://openalex.org/keywords/leader-election","display_name":"leader election","score":0.8199999928474426},{"id":"https://openalex.org/keywords/asynchronous-networks","display_name":"asynchronous networks","score":0.7089999914169312}],"concepts":[{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.9389277696609497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7723365426063538},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6231435537338257},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.6100533604621887},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5917859077453613},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.517709493637085},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4840894937515259},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.4530448913574219},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4228355586528778},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3890683650970459},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33985650539398193},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.3308027684688568},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.31082800030708313},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.08694103360176086},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.1987.4","doi":"https://doi.org/10.1109/sfcs.1987.4","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1987.4","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W50207042","https://openalex.org/W1500258400","https://openalex.org/W1557783852","https://openalex.org/W1970823784","https://openalex.org/W1971263694","https://openalex.org/W1996360405","https://openalex.org/W1997820219","https://openalex.org/W2005804954","https://openalex.org/W2020725230","https://openalex.org/W2055735365","https://openalex.org/W2061106457","https://openalex.org/W2063301742","https://openalex.org/W2064627910","https://openalex.org/W2141420453","https://openalex.org/W2148373594","https://openalex.org/W3150645827","https://openalex.org/W4210300416","https://openalex.org/W4232836212","https://openalex.org/W4239400817","https://openalex.org/W4254176932","https://openalex.org/W6633565253"],"related_works":["https://openalex.org/W2476398135","https://openalex.org/W6950360463","https://openalex.org/W4411337627","https://openalex.org/W1541197910","https://openalex.org/W7099470361","https://openalex.org/W1827060200","https://openalex.org/W2066866752","https://openalex.org/W4389844062","https://openalex.org/W2363040476","https://openalex.org/W6892872776"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"extremely":[4],"efficient,":[5],"non-interactive":[6,80],"protocol":[7],"for":[8,124],"verifiable":[9,118],"secret":[10,13,54,119],"sharing.":[11],"Verifiable":[12],"sharing":[14,120],"(VSS)":[15],"is":[16,33,40,72,105,121,129],"a":[17,23,29,41,62,73,88,97,122],"way":[18],"of":[19,25,31,44,91,100,111],"bequeathing":[20],"information":[21],"to":[22,35,69,79,131],"set":[24],"processors":[26,32,101],"such":[27,52],"that":[28],"quorum":[30],"needed":[34],"access":[36],"the":[37,109],"information.":[38],"VSS":[39,83,104],"fundamental":[42],"tool":[43],"cryptography":[45],"and":[46,60],"distributed":[47],"computing.":[48],"Seemingly":[49],"difficult":[50],"problems":[51],"as":[53],"bidding,":[55],"fair":[56,63],"voting,":[57],"leader":[58],"election,":[59],"flipping":[61],"coin":[64],"have":[65],"simple":[66],"one-round":[67],"reductions":[68],"VSS.":[70,81],"There":[71],"constant-round":[74,89],"reduction":[75],"from":[76],"Byzantine":[77],"Agreement":[78],"Non-interactive":[82],"provides":[84],"asynchronous":[85],"networks":[86,94],"with":[87],"simulation":[90,110],"simultaneous":[92],"broadcast":[93],"whenever":[95],"even":[96],"bare":[98],"majority":[99],"are":[102],"good.":[103],"constantly":[106],"repeated":[107],"in":[108],"fault-free":[112],"protocols":[113],"by":[114],"faulty":[115],"systems.":[116],"As":[117],"bottleneck":[123],"so":[125],"many":[126],"results,":[127],"it":[128],"essential":[130],"find":[132],"efficient":[133],"solutions.":[134]},"counts_by_year":[{"year":2026,"cited_by_count":55},{"year":2025,"cited_by_count":55},{"year":2024,"cited_by_count":60},{"year":2023,"cited_by_count":76},{"year":2022,"cited_by_count":49},{"year":2021,"cited_by_count":42},{"year":2020,"cited_by_count":44},{"year":2019,"cited_by_count":39},{"year":2018,"cited_by_count":37},{"year":2017,"cited_by_count":27},{"year":2016,"cited_by_count":32},{"year":2015,"cited_by_count":38},{"year":2014,"cited_by_count":37},{"year":2013,"cited_by_count":54},{"year":2012,"cited_by_count":43}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}