Clarion: Anonymous Communication from Multiparty Shuffling Protocols Article Swipe
Saba Eskandarian
,
Dan Boneh
·
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.14722/ndss.2022.24141
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.14722/ndss.2022.24141
This paper studies the role of multiparty shuffling protocols in enabling more efficient metadatahiding communication.We show that the process of shuffling messages can be expedited by having servers collaboratively shuffle and verify secret-shares of messages instead of using a conventional mixnet approach where servers take turns performing independent verifiable shuffles of user messages.We apply this technique to achieve both practical and asymptotic improvements in anonymous broadcast and messaging systems.We first show how to build a three server anonymous broadcast scheme, secure against one malicious server, that relies only on symmetric cryptography.Next, we adapt our three server broadcast scheme to a k-server scheme secure against k -1 malicious servers, at the cost of a more expensive per-shuffle preprocessing phase.Finally, we show how our scheme can be used to significantly improve the performance of the MCMix anonymous messaging system.We implement our shuffling protocol in a system called Clarion and find that it outperforms a mixnet made up of a sequence of verifiable (single-server) shuffles by 9.2× for broadcasting small messages and outperforms the MCMix conversation protocol by 11.8×.
Related Topics
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.14722/ndss.2022.24141
- https://doi.org/10.14722/ndss.2022.24141
- OA Status
- gold
- Cited By
- 31
- References
- 59
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W3215933531
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3215933531Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.14722/ndss.2022.24141Digital Object Identifier
- Title
-
Clarion: Anonymous Communication from Multiparty Shuffling ProtocolsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2022Year of publication
- Publication date
-
2022-01-01Full publication date if available
- Authors
-
Saba Eskandarian, Dan BonehList of authors in order
- Landing page
-
https://doi.org/10.14722/ndss.2022.24141Publisher landing page
- PDF URL
-
https://doi.org/10.14722/ndss.2022.24141Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.14722/ndss.2022.24141Direct OA link when available
- Concepts
-
CLARION, Computer science, Shuffling, Artificial intelligence, Programming languageTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
31Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 10, 2024: 9, 2023: 10, 2022: 2Per-year citation counts (last 5 years)
- References (count)
-
59Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3215933531 |
|---|---|
| doi | https://doi.org/10.14722/ndss.2022.24141 |
| ids.doi | https://doi.org/10.14722/ndss.2022.24141 |
| ids.mag | 3215933531 |
| ids.openalex | https://openalex.org/W3215933531 |
| fwci | 6.06976343 |
| type | preprint |
| title | Clarion: Anonymous Communication from Multiparty Shuffling Protocols |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T11598 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Internet Traffic Analysis and Secure E-voting |
| topics[1].id | https://openalex.org/T10651 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9886999726295471 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2208 |
| topics[1].subfield.display_name | Electrical and Electronic Engineering |
| topics[1].display_name | IPv6, Mobility, Handover, Networks, Security |
| topics[2].id | https://openalex.org/T10237 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9854000210762024 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Cryptography and Data Security |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C84857602 |
| concepts[0].level | 2 |
| concepts[0].score | 0.9324357509613037 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q5012668 |
| concepts[0].display_name | CLARION |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.8302562236785889 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C167927819 |
| concepts[2].level | 2 |
| concepts[2].score | 0.7571431398391724 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1930567 |
| concepts[2].display_name | Shuffling |
| concepts[3].id | https://openalex.org/C154945302 |
| concepts[3].level | 1 |
| concepts[3].score | 0.13154861330986023 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[3].display_name | Artificial intelligence |
| concepts[4].id | https://openalex.org/C199360897 |
| concepts[4].level | 1 |
| concepts[4].score | 0.12053337693214417 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[4].display_name | Programming language |
| keywords[0].id | https://openalex.org/keywords/clarion |
| keywords[0].score | 0.9324357509613037 |
| keywords[0].display_name | CLARION |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.8302562236785889 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/shuffling |
| keywords[2].score | 0.7571431398391724 |
| keywords[2].display_name | Shuffling |
| keywords[3].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[3].score | 0.13154861330986023 |
| keywords[3].display_name | Artificial intelligence |
| keywords[4].id | https://openalex.org/keywords/programming-language |
| keywords[4].score | 0.12053337693214417 |
| keywords[4].display_name | Programming language |
| language | en |
| locations[0].id | doi:10.14722/ndss.2022.24141 |
| locations[0].is_oa | True |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | https://doi.org/10.14722/ndss.2022.24141 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Proceedings 2022 Network and Distributed System Security Symposium |
| locations[0].landing_page_url | https://doi.org/10.14722/ndss.2022.24141 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5063950675 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Saba Eskandarian |
| authorships[0].countries | US |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I114027177, https://openalex.org/I1333535994 |
| authorships[0].affiliations[0].raw_affiliation_string | UNC Chapel Hill |
| authorships[0].institutions[0].id | https://openalex.org/I1333535994 |
| authorships[0].institutions[0].ror | https://ror.org/00qz24g20 |
| authorships[0].institutions[0].type | healthcare |
| authorships[0].institutions[0].lineage | https://openalex.org/I1333535994 |
| authorships[0].institutions[0].country_code | US |
| authorships[0].institutions[0].display_name | University of North Carolina Health Care |
| authorships[0].institutions[1].id | https://openalex.org/I114027177 |
| authorships[0].institutions[1].ror | https://ror.org/0130frc33 |
| authorships[0].institutions[1].type | education |
| authorships[0].institutions[1].lineage | https://openalex.org/I114027177 |
| authorships[0].institutions[1].country_code | US |
| authorships[0].institutions[1].display_name | University of North Carolina at Chapel Hill |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Saba Eskandarian |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | UNC Chapel Hill |
| authorships[1].author.id | https://openalex.org/A5027798962 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-0820-0421 |
| authorships[1].author.display_name | Dan Boneh |
| authorships[1].countries | US |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I97018004 |
| authorships[1].affiliations[0].raw_affiliation_string | Stanford University |
| authorships[1].institutions[0].id | https://openalex.org/I97018004 |
| authorships[1].institutions[0].ror | https://ror.org/00f54p054 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I97018004 |
| authorships[1].institutions[0].country_code | US |
| authorships[1].institutions[0].display_name | Stanford University |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Dan Boneh |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Stanford University |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.14722/ndss.2022.24141 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Clarion: Anonymous Communication from Multiparty Shuffling Protocols |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11598 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Internet Traffic Analysis and Secure E-voting |
| related_works | https://openalex.org/W2899084033, https://openalex.org/W2748952813, https://openalex.org/W4213239787, https://openalex.org/W4377131110, https://openalex.org/W2114337652, https://openalex.org/W2283936668, https://openalex.org/W4234111389, https://openalex.org/W2036541469, https://openalex.org/W2385485542, https://openalex.org/W3215933531 |
| cited_by_count | 31 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 10 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 9 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 10 |
| counts_by_year[3].year | 2022 |
| counts_by_year[3].cited_by_count | 2 |
| locations_count | 1 |
| best_oa_location.id | doi:10.14722/ndss.2022.24141 |
| best_oa_location.is_oa | True |
| best_oa_location.source | |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://doi.org/10.14722/ndss.2022.24141 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | proceedings-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Proceedings 2022 Network and Distributed System Security Symposium |
| best_oa_location.landing_page_url | https://doi.org/10.14722/ndss.2022.24141 |
| primary_location.id | doi:10.14722/ndss.2022.24141 |
| primary_location.is_oa | True |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | https://doi.org/10.14722/ndss.2022.24141 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Proceedings 2022 Network and Distributed System Security Symposium |
| primary_location.landing_page_url | https://doi.org/10.14722/ndss.2022.24141 |
| publication_date | 2022-01-01 |
| publication_year | 2022 |
| referenced_works | https://openalex.org/W3014025802, https://openalex.org/W2614378039, https://openalex.org/W2883089683, https://openalex.org/W2534639771, https://openalex.org/W111294696, https://openalex.org/W1524288918, https://openalex.org/W6690700271, https://openalex.org/W6621038722, https://openalex.org/W2951956578, https://openalex.org/W6773364989, https://openalex.org/W2103647628, https://openalex.org/W2087811006, https://openalex.org/W6764127311, https://openalex.org/W2788959741, https://openalex.org/W6669064135, https://openalex.org/W2155326273, https://openalex.org/W2599930814, https://openalex.org/W3100723659, https://openalex.org/W2200869402, https://openalex.org/W2402235285, https://openalex.org/W2150248082, https://openalex.org/W2883006946, https://openalex.org/W3081521045, https://openalex.org/W1968245619, https://openalex.org/W204527957, https://openalex.org/W6637080381, https://openalex.org/W2990391002, https://openalex.org/W139740867, https://openalex.org/W1834982738, https://openalex.org/W2990399857, https://openalex.org/W2952057759, https://openalex.org/W1470905967, https://openalex.org/W6764242193, https://openalex.org/W7024355122, https://openalex.org/W2908783118, https://openalex.org/W2898961439, https://openalex.org/W7062756286, https://openalex.org/W2525359697, https://openalex.org/W2970507855, https://openalex.org/W2103597742, https://openalex.org/W3159285805, https://openalex.org/W2019356824, https://openalex.org/W6734218821, https://openalex.org/W2080132708, https://openalex.org/W2950231806, https://openalex.org/W1985623009, https://openalex.org/W2099858845, https://openalex.org/W3100665415, https://openalex.org/W2963779991, https://openalex.org/W2951847312, https://openalex.org/W2242794960, https://openalex.org/W2951218987, https://openalex.org/W2949823048, https://openalex.org/W2073346043, https://openalex.org/W3141405531, https://openalex.org/W4288633970, https://openalex.org/W2247375362, https://openalex.org/W1655958391, https://openalex.org/W4378527334 |
| referenced_works_count | 59 |
| abstract_inverted_index.a | 38, 74, 99, 112, 142, 151, 156 |
| abstract_inverted_index.k | 104 |
| abstract_inverted_index.-1 | 105 |
| abstract_inverted_index.at | 108 |
| abstract_inverted_index.be | 23, 124 |
| abstract_inverted_index.by | 25, 162, 174 |
| abstract_inverted_index.in | 9, 63, 141 |
| abstract_inverted_index.it | 149 |
| abstract_inverted_index.of | 5, 19, 33, 36, 50, 111, 131, 155, 158 |
| abstract_inverted_index.on | 88 |
| abstract_inverted_index.to | 56, 72, 98, 126 |
| abstract_inverted_index.up | 154 |
| abstract_inverted_index.we | 91, 118 |
| abstract_inverted_index.and | 30, 60, 66, 146, 168 |
| abstract_inverted_index.can | 22, 123 |
| abstract_inverted_index.for | 164 |
| abstract_inverted_index.how | 71, 120 |
| abstract_inverted_index.one | 82 |
| abstract_inverted_index.our | 93, 121, 138 |
| abstract_inverted_index.the | 3, 17, 109, 129, 132, 170 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.both | 58 |
| abstract_inverted_index.cost | 110 |
| abstract_inverted_index.find | 147 |
| abstract_inverted_index.made | 153 |
| abstract_inverted_index.more | 11, 113 |
| abstract_inverted_index.only | 87 |
| abstract_inverted_index.role | 4 |
| abstract_inverted_index.show | 15, 70, 119 |
| abstract_inverted_index.take | 44 |
| abstract_inverted_index.that | 16, 85, 148 |
| abstract_inverted_index.this | 54 |
| abstract_inverted_index.used | 125 |
| abstract_inverted_index.user | 51 |
| abstract_inverted_index.9.2× | 163 |
| abstract_inverted_index.MCMix | 133, 171 |
| abstract_inverted_index.adapt | 92 |
| abstract_inverted_index.apply | 53 |
| abstract_inverted_index.build | 73 |
| abstract_inverted_index.first | 69 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.small | 166 |
| abstract_inverted_index.three | 75, 94 |
| abstract_inverted_index.turns | 45 |
| abstract_inverted_index.using | 37 |
| abstract_inverted_index.where | 42 |
| abstract_inverted_index.called | 144 |
| abstract_inverted_index.having | 26 |
| abstract_inverted_index.mixnet | 40, 152 |
| abstract_inverted_index.relies | 86 |
| abstract_inverted_index.scheme | 97, 101, 122 |
| abstract_inverted_index.secure | 80, 102 |
| abstract_inverted_index.server | 76, 95 |
| abstract_inverted_index.system | 143 |
| abstract_inverted_index.verify | 31 |
| abstract_inverted_index.11.8×. | 175 |
| abstract_inverted_index.Clarion | 145 |
| abstract_inverted_index.achieve | 57 |
| abstract_inverted_index.against | 81, 103 |
| abstract_inverted_index.improve | 128 |
| abstract_inverted_index.instead | 35 |
| abstract_inverted_index.process | 18 |
| abstract_inverted_index.scheme, | 79 |
| abstract_inverted_index.server, | 84 |
| abstract_inverted_index.servers | 27, 43 |
| abstract_inverted_index.shuffle | 29 |
| abstract_inverted_index.studies | 2 |
| abstract_inverted_index.approach | 41 |
| abstract_inverted_index.enabling | 10 |
| abstract_inverted_index.k-server | 100 |
| abstract_inverted_index.messages | 21, 34, 167 |
| abstract_inverted_index.protocol | 140, 173 |
| abstract_inverted_index.sequence | 157 |
| abstract_inverted_index.servers, | 107 |
| abstract_inverted_index.shuffles | 49, 161 |
| abstract_inverted_index.anonymous | 64, 77, 134 |
| abstract_inverted_index.broadcast | 65, 78, 96 |
| abstract_inverted_index.efficient | 12 |
| abstract_inverted_index.expedited | 24 |
| abstract_inverted_index.expensive | 114 |
| abstract_inverted_index.implement | 137 |
| abstract_inverted_index.malicious | 83, 106 |
| abstract_inverted_index.messaging | 67, 135 |
| abstract_inverted_index.practical | 59 |
| abstract_inverted_index.protocols | 8 |
| abstract_inverted_index.shuffling | 7, 20, 139 |
| abstract_inverted_index.symmetric | 89 |
| abstract_inverted_index.system.We | 136 |
| abstract_inverted_index.technique | 55 |
| abstract_inverted_index.asymptotic | 61 |
| abstract_inverted_index.multiparty | 6 |
| abstract_inverted_index.performing | 46 |
| abstract_inverted_index.systems.We | 68 |
| abstract_inverted_index.verifiable | 48, 159 |
| abstract_inverted_index.independent | 47 |
| abstract_inverted_index.messages.We | 52 |
| abstract_inverted_index.outperforms | 150, 169 |
| abstract_inverted_index.per-shuffle | 115 |
| abstract_inverted_index.performance | 130 |
| abstract_inverted_index.broadcasting | 165 |
| abstract_inverted_index.conventional | 39 |
| abstract_inverted_index.conversation | 172 |
| abstract_inverted_index.improvements | 62 |
| abstract_inverted_index.preprocessing | 116 |
| abstract_inverted_index.secret-shares | 32 |
| abstract_inverted_index.significantly | 127 |
| abstract_inverted_index.metadatahiding | 13 |
| abstract_inverted_index.phase.Finally, | 117 |
| abstract_inverted_index.(single-server) | 160 |
| abstract_inverted_index.collaboratively | 28 |
| abstract_inverted_index.communication.We | 14 |
| abstract_inverted_index.cryptography.Next, | 90 |
| cited_by_percentile_year.max | 99 |
| cited_by_percentile_year.min | 94 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.95094145 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |