Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC Article Swipe
Navneet Agarwal
,
Sanat Anand
,
Manoj Prabhakaran
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.4230/lipics.icalp.2018.103
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.4230/lipics.icalp.2018.103
A fundamental problem in the theory of secure multi-party computation (MPC) is to characterize functions with more than 2 parties which admit MPC protocols with information-theoretic security against passive corruption. This question has seen little progress since the work of Chor and Ishai (2001), which demonstrated difficulties in resolving it. In this work, we make significant progress towards resolving this question in the important case of aggregating functionalities, in which m parties P1,...,Pm hold inputs x1,...,xm and an aggregating party P0 must learn f(x1,...,xm). We give a necessary condition and a slightly stronger sufficient condition for f to admit a secure protocol. Both the conditions are stated in terms of an algebraic structure we introduce called Commuting Permutations Systems (CPS), which may be of independent combinatorial interest. When our sufficiency condition is met, we obtain a perfectly secure protocol with minimal interaction, that fits the model of Non-Interactive MPC or NIMPC (Beimel et al., 2014), but without the need for a trusted party to generate correlated randomness. We define Unassisted Non-Interactive MPC (UNIMPC) to capture this variant. We also present an NIMPC protocol for all functionalities, which is simpler and more efficient than the one given in the prior work.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.103
- OA Status
- green
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W2887768332
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2887768332Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.4230/lipics.icalp.2018.103Digital Object Identifier
- Title
-
Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPCWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-01-01Full publication date if available
- Authors
-
Navneet Agarwal, Sanat Anand, Manoj PrabhakaranList of authors in order
- Landing page
-
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.103Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.103Direct OA link when available
- Concepts
-
Computer science, Computation, Permutation (music), Computer security, Computer network, Algorithm, Physics, AcousticsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2887768332 |
|---|---|
| doi | https://doi.org/10.4230/lipics.icalp.2018.103 |
| ids.doi | https://doi.org/10.4230/lipics.icalp.2018.103 |
| ids.mag | 2887768332 |
| ids.openalex | https://openalex.org/W2887768332 |
| fwci | 0.0 |
| type | article |
| title | Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC |
| biblio.issue | 107 |
| biblio.volume | 107 |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10720 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9943000078201294 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1703 |
| topics[0].subfield.display_name | Computational Theory and Mathematics |
| topics[0].display_name | Complexity and Algorithms in Graphs |
| topics[1].id | https://openalex.org/T10237 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9908999800682068 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Cryptography and Data Security |
| topics[2].id | https://openalex.org/T12162 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.972100019454956 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1703 |
| topics[2].subfield.display_name | Computational Theory and Mathematics |
| topics[2].display_name | Cellular Automata and Applications |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.6664944291114807 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C45374587 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6007868647575378 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q12525525 |
| concepts[1].display_name | Computation |
| concepts[2].id | https://openalex.org/C21308566 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5453327894210815 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q7169365 |
| concepts[2].display_name | Permutation (music) |
| concepts[3].id | https://openalex.org/C38652104 |
| concepts[3].level | 1 |
| concepts[3].score | 0.48996129631996155 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q3510521 |
| concepts[3].display_name | Computer security |
| concepts[4].id | https://openalex.org/C31258907 |
| concepts[4].level | 1 |
| concepts[4].score | 0.40670159459114075 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[4].display_name | Computer network |
| concepts[5].id | https://openalex.org/C11413529 |
| concepts[5].level | 1 |
| concepts[5].score | 0.22434505820274353 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[5].display_name | Algorithm |
| concepts[6].id | https://openalex.org/C121332964 |
| concepts[6].level | 0 |
| concepts[6].score | 0.08495768904685974 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[6].display_name | Physics |
| concepts[7].id | https://openalex.org/C24890656 |
| concepts[7].level | 1 |
| concepts[7].score | 0.0 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q82811 |
| concepts[7].display_name | Acoustics |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.6664944291114807 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/computation |
| keywords[1].score | 0.6007868647575378 |
| keywords[1].display_name | Computation |
| keywords[2].id | https://openalex.org/keywords/permutation |
| keywords[2].score | 0.5453327894210815 |
| keywords[2].display_name | Permutation (music) |
| keywords[3].id | https://openalex.org/keywords/computer-security |
| keywords[3].score | 0.48996129631996155 |
| keywords[3].display_name | Computer security |
| keywords[4].id | https://openalex.org/keywords/computer-network |
| keywords[4].score | 0.40670159459114075 |
| keywords[4].display_name | Computer network |
| keywords[5].id | https://openalex.org/keywords/algorithm |
| keywords[5].score | 0.22434505820274353 |
| keywords[5].display_name | Algorithm |
| keywords[6].id | https://openalex.org/keywords/physics |
| keywords[6].score | 0.08495768904685974 |
| keywords[6].display_name | Physics |
| language | en |
| locations[0].id | pmh:oai:drops-oai.dagstuhl.de:9107 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306402524 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Leibniz-Zentrum für Informatik (Schloss Dagstuhl) |
| locations[0].source.host_organization | https://openalex.org/I2799853480 |
| locations[0].source.host_organization_name | Schloss Dagstuhl – Leibniz Center for Informatics |
| locations[0].source.host_organization_lineage | https://openalex.org/I2799853480 |
| locations[0].license | cc-by |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | InProceedings |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.103 |
| locations[1].id | doi:10.4230/lipics.icalp.2018.103 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S7407052059 |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | Dagstuhl Research Online Publication Server |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.4230/lipics.icalp.2018.103 |
| locations[2].id | mag:2887768332 |
| locations[2].is_oa | False |
| locations[2].source.id | https://openalex.org/S4306418971 |
| locations[2].source.issn | |
| locations[2].source.type | conference |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | International Colloquium on Automata, Languages and Programming |
| locations[2].source.host_organization | |
| locations[2].source.host_organization_name | |
| locations[2].license | |
| locations[2].pdf_url | |
| locations[2].version | |
| locations[2].raw_type | |
| locations[2].license_id | |
| locations[2].is_accepted | False |
| locations[2].is_published | |
| locations[2].raw_source_name | International Colloquium on Automata, Languages and Programming |
| locations[2].landing_page_url | https://dblp.uni-trier.de/db/conf/icalp/icalp2018.html#AgarwalAP18 |
| locations[3].id | mag:2966865328 |
| locations[3].is_oa | False |
| locations[3].source | |
| locations[3].license | |
| locations[3].pdf_url | |
| locations[3].version | |
| locations[3].raw_type | |
| locations[3].license_id | |
| locations[3].is_accepted | False |
| locations[3].is_published | |
| locations[3].raw_source_name | |
| locations[3].landing_page_url | https://drops.dagstuhl.de/opus/volltexte/2018/9107/pdf/LIPIcs-ICALP-2018-103.pdf |
| indexed_in | datacite |
| authorships[0].author.id | https://openalex.org/A5102641554 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Navneet Agarwal |
| authorships[0].countries | IN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I162827531 |
| authorships[0].affiliations[0].raw_affiliation_string | Indian Institute of Technology Bombay, Mumbai, India |
| authorships[0].institutions[0].id | https://openalex.org/I162827531 |
| authorships[0].institutions[0].ror | https://ror.org/02qyf5152 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I162827531 |
| authorships[0].institutions[0].country_code | IN |
| authorships[0].institutions[0].display_name | Indian Institute of Technology Bombay |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Navneet Agarwal |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Indian Institute of Technology Bombay, Mumbai, India |
| authorships[1].author.id | https://openalex.org/A5103846130 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Sanat Anand |
| authorships[1].countries | IN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I162827531 |
| authorships[1].affiliations[0].raw_affiliation_string | Indian Institute of Technology Bombay, Mumbai, India |
| authorships[1].institutions[0].id | https://openalex.org/I162827531 |
| authorships[1].institutions[0].ror | https://ror.org/02qyf5152 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I162827531 |
| authorships[1].institutions[0].country_code | IN |
| authorships[1].institutions[0].display_name | Indian Institute of Technology Bombay |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Sanat Anand |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Indian Institute of Technology Bombay, Mumbai, India |
| authorships[2].author.id | https://openalex.org/A5023747811 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Manoj Prabhakaran |
| authorships[2].countries | IN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I162827531 |
| authorships[2].affiliations[0].raw_affiliation_string | Indian Institute of Technology Bombay, Mumbai, India |
| authorships[2].institutions[0].id | https://openalex.org/I162827531 |
| authorships[2].institutions[0].ror | https://ror.org/02qyf5152 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I162827531 |
| authorships[2].institutions[0].country_code | IN |
| authorships[2].institutions[0].display_name | Indian Institute of Technology Bombay |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Manoj Prabhakaran |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Indian Institute of Technology Bombay, Mumbai, India |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.103 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10720 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9943000078201294 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1703 |
| primary_topic.subfield.display_name | Computational Theory and Mathematics |
| primary_topic.display_name | Complexity and Algorithms in Graphs |
| related_works | https://openalex.org/W2288934240, https://openalex.org/W34785529, https://openalex.org/W1459532868, https://openalex.org/W2768873062, https://openalex.org/W3167331094, https://openalex.org/W2906428322, https://openalex.org/W3110541978, https://openalex.org/W2766917641, https://openalex.org/W1497539597, https://openalex.org/W3021910883, https://openalex.org/W893089893, https://openalex.org/W2800749840, https://openalex.org/W3208221482, https://openalex.org/W1984680759, https://openalex.org/W3036555256, https://openalex.org/W3012317744, https://openalex.org/W3043365475, https://openalex.org/W2386106412, https://openalex.org/W2577421826, https://openalex.org/W2742132190 |
| cited_by_count | 0 |
| locations_count | 4 |
| best_oa_location.id | pmh:oai:drops-oai.dagstuhl.de:9107 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402524 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Leibniz-Zentrum für Informatik (Schloss Dagstuhl) |
| best_oa_location.source.host_organization | https://openalex.org/I2799853480 |
| best_oa_location.source.host_organization_name | Schloss Dagstuhl – Leibniz Center for Informatics |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I2799853480 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | InProceedings |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.103 |
| primary_location.id | pmh:oai:drops-oai.dagstuhl.de:9107 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306402524 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Leibniz-Zentrum für Informatik (Schloss Dagstuhl) |
| primary_location.source.host_organization | https://openalex.org/I2799853480 |
| primary_location.source.host_organization_name | Schloss Dagstuhl – Leibniz Center for Informatics |
| primary_location.source.host_organization_lineage | https://openalex.org/I2799853480 |
| primary_location.license | cc-by |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | InProceedings |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.103 |
| publication_date | 2018-01-01 |
| publication_year | 2018 |
| referenced_works_count | 0 |
| abstract_inverted_index.2 | 18 |
| abstract_inverted_index.A | 0 |
| abstract_inverted_index.a | 86, 90, 99, 135, 160 |
| abstract_inverted_index.f | 96 |
| abstract_inverted_index.m | 70 |
| abstract_inverted_index.In | 50 |
| abstract_inverted_index.P0 | 80 |
| abstract_inverted_index.We | 84, 167, 177 |
| abstract_inverted_index.an | 77, 110, 180 |
| abstract_inverted_index.be | 122 |
| abstract_inverted_index.et | 152 |
| abstract_inverted_index.in | 3, 47, 61, 68, 107, 196 |
| abstract_inverted_index.is | 11, 131, 187 |
| abstract_inverted_index.of | 6, 39, 65, 109, 123, 146 |
| abstract_inverted_index.or | 149 |
| abstract_inverted_index.to | 12, 97, 163, 173 |
| abstract_inverted_index.we | 53, 113, 133 |
| abstract_inverted_index.MPC | 22, 148, 171 |
| abstract_inverted_index.all | 184 |
| abstract_inverted_index.and | 41, 76, 89, 189 |
| abstract_inverted_index.are | 105 |
| abstract_inverted_index.but | 155 |
| abstract_inverted_index.for | 95, 159, 183 |
| abstract_inverted_index.has | 32 |
| abstract_inverted_index.it. | 49 |
| abstract_inverted_index.may | 121 |
| abstract_inverted_index.one | 194 |
| abstract_inverted_index.our | 128 |
| abstract_inverted_index.the | 4, 37, 62, 103, 144, 157, 193, 197 |
| abstract_inverted_index.Both | 102 |
| abstract_inverted_index.Chor | 40 |
| abstract_inverted_index.This | 30 |
| abstract_inverted_index.When | 127 |
| abstract_inverted_index.al., | 153 |
| abstract_inverted_index.also | 178 |
| abstract_inverted_index.case | 64 |
| abstract_inverted_index.fits | 143 |
| abstract_inverted_index.give | 85 |
| abstract_inverted_index.hold | 73 |
| abstract_inverted_index.make | 54 |
| abstract_inverted_index.met, | 132 |
| abstract_inverted_index.more | 16, 190 |
| abstract_inverted_index.must | 81 |
| abstract_inverted_index.need | 158 |
| abstract_inverted_index.seen | 33 |
| abstract_inverted_index.than | 17, 192 |
| abstract_inverted_index.that | 142 |
| abstract_inverted_index.this | 51, 59, 175 |
| abstract_inverted_index.with | 15, 24, 139 |
| abstract_inverted_index.work | 38 |
| abstract_inverted_index.(MPC) | 10 |
| abstract_inverted_index.Ishai | 42 |
| abstract_inverted_index.NIMPC | 150, 181 |
| abstract_inverted_index.admit | 21, 98 |
| abstract_inverted_index.given | 195 |
| abstract_inverted_index.learn | 82 |
| abstract_inverted_index.model | 145 |
| abstract_inverted_index.party | 79, 162 |
| abstract_inverted_index.prior | 198 |
| abstract_inverted_index.since | 36 |
| abstract_inverted_index.terms | 108 |
| abstract_inverted_index.which | 20, 44, 69, 120, 186 |
| abstract_inverted_index.work, | 52 |
| abstract_inverted_index.work. | 199 |
| abstract_inverted_index.(CPS), | 119 |
| abstract_inverted_index.2014), | 154 |
| abstract_inverted_index.called | 115 |
| abstract_inverted_index.define | 168 |
| abstract_inverted_index.inputs | 74 |
| abstract_inverted_index.little | 34 |
| abstract_inverted_index.obtain | 134 |
| abstract_inverted_index.secure | 7, 100, 137 |
| abstract_inverted_index.stated | 106 |
| abstract_inverted_index.theory | 5 |
| abstract_inverted_index.(2001), | 43 |
| abstract_inverted_index.(Beimel | 151 |
| abstract_inverted_index.Systems | 118 |
| abstract_inverted_index.against | 27 |
| abstract_inverted_index.capture | 174 |
| abstract_inverted_index.minimal | 140 |
| abstract_inverted_index.parties | 19, 71 |
| abstract_inverted_index.passive | 28 |
| abstract_inverted_index.present | 179 |
| abstract_inverted_index.problem | 2 |
| abstract_inverted_index.simpler | 188 |
| abstract_inverted_index.towards | 57 |
| abstract_inverted_index.trusted | 161 |
| abstract_inverted_index.without | 156 |
| abstract_inverted_index.(UNIMPC) | 172 |
| abstract_inverted_index.generate | 164 |
| abstract_inverted_index.progress | 35, 56 |
| abstract_inverted_index.protocol | 138, 182 |
| abstract_inverted_index.question | 31, 60 |
| abstract_inverted_index.security | 26 |
| abstract_inverted_index.slightly | 91 |
| abstract_inverted_index.stronger | 92 |
| abstract_inverted_index.variant. | 176 |
| abstract_inverted_index.Commuting | 116 |
| abstract_inverted_index.P1,...,Pm | 72 |
| abstract_inverted_index.algebraic | 111 |
| abstract_inverted_index.condition | 88, 94, 130 |
| abstract_inverted_index.efficient | 191 |
| abstract_inverted_index.functions | 14 |
| abstract_inverted_index.important | 63 |
| abstract_inverted_index.interest. | 126 |
| abstract_inverted_index.introduce | 114 |
| abstract_inverted_index.necessary | 87 |
| abstract_inverted_index.perfectly | 136 |
| abstract_inverted_index.protocol. | 101 |
| abstract_inverted_index.protocols | 23 |
| abstract_inverted_index.resolving | 48, 58 |
| abstract_inverted_index.structure | 112 |
| abstract_inverted_index.x1,...,xm | 75 |
| abstract_inverted_index.Unassisted | 169 |
| abstract_inverted_index.conditions | 104 |
| abstract_inverted_index.correlated | 165 |
| abstract_inverted_index.sufficient | 93 |
| abstract_inverted_index.aggregating | 66, 78 |
| abstract_inverted_index.computation | 9 |
| abstract_inverted_index.corruption. | 29 |
| abstract_inverted_index.fundamental | 1 |
| abstract_inverted_index.independent | 124 |
| abstract_inverted_index.multi-party | 8 |
| abstract_inverted_index.randomness. | 166 |
| abstract_inverted_index.significant | 55 |
| abstract_inverted_index.sufficiency | 129 |
| abstract_inverted_index.Permutations | 117 |
| abstract_inverted_index.characterize | 13 |
| abstract_inverted_index.demonstrated | 45 |
| abstract_inverted_index.difficulties | 46 |
| abstract_inverted_index.interaction, | 141 |
| abstract_inverted_index.combinatorial | 125 |
| abstract_inverted_index.f(x1,...,xm). | 83 |
| abstract_inverted_index.Non-Interactive | 147, 170 |
| abstract_inverted_index.functionalities, | 67, 185 |
| abstract_inverted_index.information-theoretic | 25 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile.value | 0.12721272 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |