{"id":"https://openalex.org/W4405181167","doi":"https://doi.org/10.1145/3658644.3690287","title":"GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication Complexity","display_name":"GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication Complexity","publication_year":2024,"publication_date":"2024-12-02","ids":{"openalex":"https://openalex.org/W4405181167","doi":"https://doi.org/10.1145/3658644.3690287"},"language":"en","primary_location":{"id":"doi:10.1145/3658644.3690287","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3658644.3690287","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3658644.3690287","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3658644.3690287","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102840859","display_name":"Renas Bacho","orcid":"https://orcid.org/0009-0007-7037-2458"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Renas Bacho","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security & Saarland University, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security & Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801","https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006005471","display_name":"Christoph Lenzen","orcid":"https://orcid.org/0000-0002-3290-0674"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018889893","display_name":"Julian Loss","orcid":"https://orcid.org/0000-0002-7979-3810"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Julian Loss","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093307816","display_name":"Simon Ochsenreither","orcid":"https://orcid.org/0009-0009-2568-5628"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simon Ochsenreither","raw_affiliation_strings":["Vector Informatik GmbH, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"Vector Informatik GmbH, Stuttgart, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081243075","display_name":"Dimitrios Papachristoudis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dimitrios Papachristoudis","raw_affiliation_strings":["Researcher, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Researcher, Saarbr\u00fccken, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5102840859"],"corresponding_institution_ids":["https://openalex.org/I4210128801","https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":2.3847,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.9057454,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"941","last_page":"955"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9995999932289124,"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.9995999932289124,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9965000152587891,"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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.8373637199401855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7670726776123047},{"id":"https://openalex.org/keywords/beacon","display_name":"Beacon","score":0.7476411461830139},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.616640567779541},{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.5286341905593872},{"id":"https://openalex.org/keywords/security-parameter","display_name":"Security parameter","score":0.4781571328639984},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.47802552580833435},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4228779375553131},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4080740213394165},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33802229166030884},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.3119395971298218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30895712971687317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18077093362808228},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09718877077102661}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8373637199401855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7670726776123047},{"id":"https://openalex.org/C102168758","wikidata":"https://www.wikidata.org/wiki/Q7321258","display_name":"Beacon","level":2,"score":0.7476411461830139},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.616640567779541},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.5286341905593872},{"id":"https://openalex.org/C2776711565","wikidata":"https://www.wikidata.org/wiki/Q7445058","display_name":"Security parameter","level":3,"score":0.4781571328639984},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.47802552580833435},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4228779375553131},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4080740213394165},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33802229166030884},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.3119395971298218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30895712971687317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18077093362808228},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09718877077102661},{"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},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3658644.3690287","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3658644.3690287","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3658644.3690287","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3658644.3690287","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3658644.3690287","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3658644.3690287","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2038491333","display_name":"Cryptographic Foundation for Secure and Scalable Distributed Systems","funder_award_id":"101116713","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3727729995","display_name":null,"funder_award_id":"101116713","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G4907384335","display_name":null,"funder_award_id":"507237585","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G5106512922","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G926695147","display_name":"Beweisbar sicheres Mehrspielersignieren in realistischen Angriffsmodellen","funder_award_id":"507237585","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4405181167.pdf","grobid_xml":"https://content.openalex.org/works/W4405181167.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1528195422","https://openalex.org/W1837145606","https://openalex.org/W2029693536","https://openalex.org/W2034791526","https://openalex.org/W2077963568","https://openalex.org/W2106004025","https://openalex.org/W2148575324","https://openalex.org/W2172245248","https://openalex.org/W2717184009","https://openalex.org/W2763398287","https://openalex.org/W2964159515","https://openalex.org/W3015641482","https://openalex.org/W3016150129","https://openalex.org/W3096614868","https://openalex.org/W3106855293","https://openalex.org/W3137092842","https://openalex.org/W3175791793","https://openalex.org/W3210190175","https://openalex.org/W3212315729","https://openalex.org/W4238567305","https://openalex.org/W4248175462","https://openalex.org/W4286504506","https://openalex.org/W4288057794","https://openalex.org/W4308642224","https://openalex.org/W4324007059","https://openalex.org/W4361230065","https://openalex.org/W4384948766","https://openalex.org/W4388856948","https://openalex.org/W4404437288"],"related_works":["https://openalex.org/W2567632598","https://openalex.org/W2106845956","https://openalex.org/W3158435160","https://openalex.org/W2112938119","https://openalex.org/W1483129684","https://openalex.org/W2810763716","https://openalex.org/W1547422258","https://openalex.org/W2950521391","https://openalex.org/W2949558614","https://openalex.org/W2751244774"],"abstract_inverted_index":{"A":[0],"randomness":[1,11,23,74,158,223],"beacon":[2,75,159,206,224],"is":[3,13],"a":[4,103,155,167,184,211],"source":[5],"of":[6,14,30,48,120,146,157,175,186,213],"continuous":[7],"and":[8,85,131,171,180,232,238],"publicly":[9],"verifiable":[10,60],"which":[12],"crucial":[15],"importance":[16],"for":[17],"many":[18,46],"applications.":[19],"Existing":[20],"works":[21],"on":[22],"beacons":[24],"suffer":[25],"from":[26],"at":[27],"least":[28],"one":[29],"the":[31,70,89,140,221,235],"following":[32,144],"drawbacks:":[33],"(i)":[34],"security":[35,141],"only":[36,166],"against":[37],"static":[38],"(i.e.,":[39],"non-adaptive)":[40],"adversaries,":[41],"(ii)":[42],"each":[43,162],"epoch":[44],"takes":[45],"rounds":[47],"communication,":[49],"or":[50,59],"(iii)":[51],"computationally":[52],"expensive":[53],"tools":[54],"such":[55],"as":[56,134],"proof-of-work":[57],"(PoW)":[58],"delay":[61],"functions":[62],"(VDF).":[63],"In":[64],"this":[65],"work,":[66],"we":[67,101],"introduce":[68],"GRandLine,":[69],"first":[71],"adaptively":[72],"secure":[73],"protocol":[76,109,219],"that":[77,111,200,240],"overcomes":[78],"all":[79],"these":[80],"limitations":[81],"while":[82],"preserving":[83],"simplicity":[84],"optimal":[86],"resilience":[87],"in":[88,97,113,192,210,234],"synchronous":[90],"network":[91,185,212],"setting.":[92],"We":[93,177,216],"achieve":[94],"our":[95,218],"result":[96],"two":[98],"steps.":[99],"First,":[100],"design":[102],"novel":[104],"distributed":[105,194],"key":[106],"generation":[107],"(DKG)":[108],"GRand":[110],"runs":[112],"O(\u03bb":[114,172],"n2":[115],"log":[116],"n":[117],")":[118],"bits":[119,174],"communication":[121],"but,":[122],"unlike":[123],"most":[124],"conventional":[125],"DKG":[126],"protocols,":[127],"outputs":[128,207],"both":[129],"secret":[130],"public":[132],"keys":[133,152],"group":[135],"elements.":[136],"Here,":[137],"\u03bb":[138],"denotes":[139],"parameter.":[142],"Second,":[143],"termination":[145],"GRand,":[147],"parties":[148,190],"can":[149,202],"use":[150],"their":[151],"to":[153,188,220],"derive":[154],"sequence":[156],"values,":[160],"where":[161],"random":[163],"value":[164],"costs":[165],"single":[168],"asynchronous":[169],"round":[170],"n2)":[173],"communication.":[176],"implement":[178],"GRandLine":[179,201],"evaluate":[181],"it":[182,241],"using":[183],"up":[187],"64":[189,214],"running":[191],"geographically":[193],"AWS":[195],"instances.":[196],"Our":[197],"evaluation":[198],"shows":[199],"produce":[203],"about":[204],"2":[205],"per":[208],"second":[209],"parties.":[215],"compare":[217],"state-of-the-art":[222],"protocols":[225],"OptRand":[226],"(NDSS":[227],"'23),":[228],"BRandPiper":[229],"(CCS":[230],"'21),":[231],"Drand,":[233],"same":[236],"setting":[237],"observe":[239],"vastly":[242],"outperforms":[243],"them.":[244]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}