{"id":"https://openalex.org/W1617763388","doi":"https://doi.org/10.1109/isit.2015.7282597","title":"Parity Check based redistribution of secret shares","display_name":"Parity Check based redistribution of secret shares","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1617763388","doi":"https://doi.org/10.1109/isit.2015.7282597","mag":"1617763388"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","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/A5008979622","display_name":"Yvo Desmedt","orcid":"https://orcid.org/0000-0002-6679-7484"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]},{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"Yvo Desmedt","raw_affiliation_strings":["The University of Texas at Dallas (USA), University College, London, UK","The University of Texas at Dallas, USA"],"affiliations":[{"raw_affiliation_string":"The University of Texas at Dallas (USA), University College, London, UK","institution_ids":["https://openalex.org/I162577319","https://openalex.org/I45129253"]},{"raw_affiliation_string":"The University of Texas at Dallas, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076022836","display_name":"Kirill Morozov","orcid":"https://orcid.org/0009-0006-4443-083X"},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kirill Morozov","raw_affiliation_strings":["Institute of Mathematics for Industry, Kyushu University, Japan","[Institute of Mathematics for Industry, Kyushu University, Japan]"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics for Industry, Kyushu University, Japan","institution_ids":["https://openalex.org/I135598925"]},{"raw_affiliation_string":"[Institute of Mathematics for Industry, Kyushu University, Japan]","institution_ids":["https://openalex.org/I135598925"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008979622"],"corresponding_institution_ids":["https://openalex.org/I162577319","https://openalex.org/I45129253"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.02689081,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":null,"first_page":"959","last_page":"963"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9248414039611816},{"id":"https://openalex.org/keywords/secret-sharing","display_name":"Secret sharing","score":0.7386711239814758},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6655650734901428},{"id":"https://openalex.org/keywords/discrete-logarithm","display_name":"Discrete logarithm","score":0.6505498886108398},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.611657440662384},{"id":"https://openalex.org/keywords/homomorphic-secret-sharing","display_name":"Homomorphic secret sharing","score":0.51578688621521},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.5022697448730469},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.46324434876441956},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46079784631729126},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.4353334307670593},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.3588387072086334},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3328019380569458},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3062043786048889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.301216721534729},{"id":"https://openalex.org/keywords/public-key-cryptography","display_name":"Public-key cryptography","score":0.22065585851669312},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.21274268627166748}],"concepts":[{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.9248414039611816},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.7386711239814758},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6655650734901428},{"id":"https://openalex.org/C173259116","wikidata":"https://www.wikidata.org/wiki/Q864003","display_name":"Discrete logarithm","level":4,"score":0.6505498886108398},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.611657440662384},{"id":"https://openalex.org/C132161212","wikidata":"https://www.wikidata.org/wiki/Q5891458","display_name":"Homomorphic secret sharing","level":4,"score":0.51578688621521},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.5022697448730469},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.46324434876441956},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46079784631729126},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.4353334307670593},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.3588387072086334},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3328019380569458},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3062043786048889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.301216721534729},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.22065585851669312},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.21274268627166748},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2015.7282597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1481866","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1481866/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:   (Proceedings) IEEE International Symposium on Information Theory (ISIT). (pp. pp. 959-963).  IEEE (2015)     ","raw_type":"Proceedings paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8299999833106995,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1503056535","https://openalex.org/W1515103516","https://openalex.org/W1606480398","https://openalex.org/W1990304797","https://openalex.org/W2006453614","https://openalex.org/W2014772227","https://openalex.org/W2027471022","https://openalex.org/W2078049491","https://openalex.org/W2092148937","https://openalex.org/W2097407854","https://openalex.org/W2140663540","https://openalex.org/W2141420453","https://openalex.org/W2147270806","https://openalex.org/W2148575324","https://openalex.org/W2159030254","https://openalex.org/W2167497847","https://openalex.org/W2168676717","https://openalex.org/W2320835389","https://openalex.org/W2895239415","https://openalex.org/W2970097841","https://openalex.org/W3137092842","https://openalex.org/W4245079094","https://openalex.org/W6630731414","https://openalex.org/W6698135423"],"related_works":["https://openalex.org/W1557783852","https://openalex.org/W2768332800","https://openalex.org/W2083084382","https://openalex.org/W2006088653","https://openalex.org/W2348427614","https://openalex.org/W2032053269","https://openalex.org/W2357909631","https://openalex.org/W2009007725","https://openalex.org/W1474916271","https://openalex.org/W2363629235"],"abstract_inverted_index":{"In":[0,33],"2002,":[1],"Wong-Wang-Wing":[2],"presented":[3,38],"a":[4,96,103],"verifiable":[5],"redistributing":[6],"secret":[7],"shares":[8],"protocol,":[9],"where":[10,56],"the":[11,28,58,62,92,108],"new":[12,104],"parties":[13,52,83],"must":[14],"have":[15],"been":[16],"honest.":[17],"They":[18],"used":[19],"Feldman's":[20],"Verifiable":[21],"Secret":[22],"Sharing":[23],"scheme,":[24],"which":[25],"assumed":[26],"that":[27,45,76],"discrete":[29],"logarithm":[30],"is":[31],"hard.":[32],"2013,":[34],"Nojoumian":[35],"and":[36],"Stinson":[37],"information-theoretically":[39],"(unconditionally)":[40],"secure":[41,73],"schemes":[42],"under":[43],"assumption":[44],"at":[46,77],"most":[47,78],"t":[48,79],"out":[49,80],"of":[50,64,81,91,95,110],"4t+1":[51],"are":[53,84],"actively":[54,85],"corrupt,":[55],"only":[57],"threshold":[59],"(but":[60],"not":[61],"number":[63],"parties)":[65],"can":[66],"be":[67],"changed.":[68],"We":[69],"present":[70],"an":[71],"unconditionally":[72],"solution":[74],"assuming":[75],"3t+1":[82],"corrupt.":[86],"Our":[87],"protocol":[88],"uses":[89],"properties":[90],"parity-check":[93],"matrix":[94],"Generalized":[97],"Reed-Solomon":[98,111],"code.":[99],"Moreover,":[100],"we":[101],"introduce":[102],"open":[105],"problem":[106],"in":[107],"area":[109],"decoding.":[112]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}