Secure computation of randomized functions Article Swipe
Two user secure computation of randomized functions is considered, where only\none user computes the output. Both the users are semi-honest; and computation\nis such that no user learns any additional information about the other user's\ninput and output other than what cannot be inferred from its own input and\noutput. First we consider a scenario, where privacy conditions are against both\nthe users. In perfect security setting Kilian [STOC 2000] gave a\ncharacterization of securely computable randomized functions, and we provide\nrate-optimal protocols for such functions. We prove that the same\ncharacterization holds in asymptotic security setting as well and give a\nrate-optimal protocol. In another scenario, where privacy condition is only\nagainst the user who is not computing the function, we provide rate-optimal\nprotocols. For perfect security in both the scenarios, our results are in terms\nof chromatic entropies of different graphs. In asymptotic security setting, we\nget single-letter expressions of rates in both the scenarios.\n
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.1109/isit.2016.7541860
- OA Status
- green
- Cited By
- 5
- References
- 28
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2254102530
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2254102530Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1109/isit.2016.7541860Digital Object Identifier
- Title
-
Secure computation of randomized functionsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2016Year of publication
- Publication date
-
2016-07-01Full publication date if available
- Authors
-
Deepesh DataList of authors in order
- Landing page
-
https://doi.org/10.1109/isit.2016.7541860Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/1601.06562Direct OA link when available
- Concepts
-
Computer science, Computation, AlgorithmTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
5Total citation count in OpenAlex
- Citations by year (recent)
-
2022: 1, 2018: 2, 2017: 1, 2016: 1Per-year citation counts (last 5 years)
- References (count)
-
28Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2254102530 |
|---|---|
| doi | https://doi.org/10.1109/isit.2016.7541860 |
| ids.doi | https://doi.org/10.1109/isit.2016.7541860 |
| ids.mag | 2254102530 |
| ids.openalex | https://openalex.org/W2254102530 |
| fwci | 1.12750752 |
| type | preprint |
| title | Secure computation of randomized functions |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 3057 |
| biblio.first_page | 3053 |
| topics[0].id | https://openalex.org/T10237 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998000264167786 |
| 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 | Cryptography and Data Security |
| topics[1].id | https://openalex.org/T11017 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9998000264167786 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1707 |
| topics[1].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[1].display_name | Chaos-based Image/Signal Encryption |
| topics[2].id | https://openalex.org/T10388 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9986000061035156 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1707 |
| topics[2].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[2].display_name | Advanced Steganography and Watermarking Techniques |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.6547233462333679 |
| 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.49671584367752075 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q12525525 |
| concepts[1].display_name | Computation |
| concepts[2].id | https://openalex.org/C11413529 |
| concepts[2].level | 1 |
| concepts[2].score | 0.16274267435073853 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[2].display_name | Algorithm |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.6547233462333679 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/computation |
| keywords[1].score | 0.49671584367752075 |
| keywords[1].display_name | Computation |
| keywords[2].id | https://openalex.org/keywords/algorithm |
| keywords[2].score | 0.16274267435073853 |
| keywords[2].display_name | Algorithm |
| language | en |
| locations[0].id | doi:10.1109/isit.2016.7541860 |
| locations[0].is_oa | False |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | |
| 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 | 2016 IEEE International Symposium on Information Theory (ISIT) |
| locations[0].landing_page_url | https://doi.org/10.1109/isit.2016.7541860 |
| locations[1].id | pmh:oai:arXiv.org:1601.06562 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | https://arxiv.org/pdf/1601.06562 |
| locations[1].version | submittedVersion |
| locations[1].raw_type | text |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | http://arxiv.org/abs/1601.06562 |
| indexed_in | arxiv, crossref |
| authorships[0].author.id | https://openalex.org/A5023777978 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-3544-8414 |
| authorships[0].author.display_name | Deepesh Data |
| authorships[0].countries | IN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I11947397 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Technology & Computer Science, Tata Institute of Fundamental Research, Mumbai, India |
| authorships[0].institutions[0].id | https://openalex.org/I11947397 |
| authorships[0].institutions[0].ror | https://ror.org/03ht1xw27 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I11947397, https://openalex.org/I2799351866, https://openalex.org/I3149292468 |
| authorships[0].institutions[0].country_code | IN |
| authorships[0].institutions[0].display_name | Tata Institute of Fundamental Research |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Deepesh Data |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | School of Technology & Computer Science, Tata Institute of Fundamental Research, Mumbai, India |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/1601.06562 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Secure computation of randomized functions |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10237 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998000264167786 |
| 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 | Cryptography and Data Security |
| related_works | https://openalex.org/W4391375266, https://openalex.org/W2748952813, https://openalex.org/W2390279801, https://openalex.org/W2358668433, https://openalex.org/W4396701345, https://openalex.org/W2376932109, https://openalex.org/W2001405890, https://openalex.org/W4396696052, https://openalex.org/W4402327032, https://openalex.org/W2382290278 |
| cited_by_count | 5 |
| counts_by_year[0].year | 2022 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2018 |
| counts_by_year[1].cited_by_count | 2 |
| counts_by_year[2].year | 2017 |
| counts_by_year[2].cited_by_count | 1 |
| counts_by_year[3].year | 2016 |
| counts_by_year[3].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:1601.06562 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| 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 | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/1601.06562 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/1601.06562 |
| primary_location.id | doi:10.1109/isit.2016.7541860 |
| primary_location.is_oa | False |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | |
| 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 | 2016 IEEE International Symposium on Information Theory (ISIT) |
| primary_location.landing_page_url | https://doi.org/10.1109/isit.2016.7541860 |
| publication_date | 2016-07-01 |
| publication_year | 2016 |
| referenced_works | https://openalex.org/W2027340571, https://openalex.org/W2053161644, https://openalex.org/W6680312481, https://openalex.org/W2099213070, https://openalex.org/W2254102530, https://openalex.org/W2119336214, https://openalex.org/W2164651000, https://openalex.org/W6682866549, https://openalex.org/W3141585064, https://openalex.org/W6600733612, https://openalex.org/W1607225066, https://openalex.org/W1629606403, https://openalex.org/W6629159543, https://openalex.org/W6677934245, https://openalex.org/W1964580496, https://openalex.org/W6687575909, https://openalex.org/W2092422002, https://openalex.org/W1549664537, https://openalex.org/W3105601691, https://openalex.org/W1486265451, https://openalex.org/W18422675, https://openalex.org/W2397857137, https://openalex.org/W2136644914, https://openalex.org/W2156001253, https://openalex.org/W2119422255, https://openalex.org/W2039320535, https://openalex.org/W2197751114, https://openalex.org/W1964435016 |
| referenced_works_count | 28 |
| abstract_inverted_index.a | 50 |
| abstract_inverted_index.In | 59, 96, 132 |
| abstract_inverted_index.We | 80 |
| abstract_inverted_index.as | 90 |
| abstract_inverted_index.be | 40 |
| abstract_inverted_index.in | 86, 118, 125, 141 |
| abstract_inverted_index.is | 7, 102, 107 |
| abstract_inverted_index.no | 24 |
| abstract_inverted_index.of | 4, 68, 129, 139 |
| abstract_inverted_index.we | 48, 74, 112 |
| abstract_inverted_index.For | 115 |
| abstract_inverted_index.Two | 0 |
| abstract_inverted_index.and | 20, 34, 73, 92 |
| abstract_inverted_index.any | 27 |
| abstract_inverted_index.are | 18, 55, 124 |
| abstract_inverted_index.for | 77 |
| abstract_inverted_index.its | 43 |
| abstract_inverted_index.not | 108 |
| abstract_inverted_index.our | 122 |
| abstract_inverted_index.own | 44 |
| abstract_inverted_index.the | 13, 16, 31, 83, 104, 110, 120, 143 |
| abstract_inverted_index.who | 106 |
| abstract_inverted_index.Both | 15 |
| abstract_inverted_index.both | 119, 142 |
| abstract_inverted_index.from | 42 |
| abstract_inverted_index.gave | 66 |
| abstract_inverted_index.give | 93 |
| abstract_inverted_index.such | 22, 78 |
| abstract_inverted_index.than | 37 |
| abstract_inverted_index.that | 23, 82 |
| abstract_inverted_index.user | 1, 11, 25, 105 |
| abstract_inverted_index.well | 91 |
| abstract_inverted_index.what | 38 |
| abstract_inverted_index.2000] | 65 |
| abstract_inverted_index.First | 47 |
| abstract_inverted_index.[STOC | 64 |
| abstract_inverted_index.about | 30 |
| abstract_inverted_index.holds | 85 |
| abstract_inverted_index.input | 45 |
| abstract_inverted_index.other | 32, 36 |
| abstract_inverted_index.prove | 81 |
| abstract_inverted_index.rates | 140 |
| abstract_inverted_index.users | 17 |
| abstract_inverted_index.where | 9, 52, 99 |
| abstract_inverted_index.Kilian | 63 |
| abstract_inverted_index.cannot | 39 |
| abstract_inverted_index.learns | 26 |
| abstract_inverted_index.output | 35 |
| abstract_inverted_index.secure | 2 |
| abstract_inverted_index.users. | 58 |
| abstract_inverted_index.against | 56 |
| abstract_inverted_index.another | 97 |
| abstract_inverted_index.graphs. | 131 |
| abstract_inverted_index.output. | 14 |
| abstract_inverted_index.perfect | 60, 116 |
| abstract_inverted_index.privacy | 53, 100 |
| abstract_inverted_index.provide | 113 |
| abstract_inverted_index.results | 123 |
| abstract_inverted_index.setting | 62, 89 |
| abstract_inverted_index.we\nget | 136 |
| abstract_inverted_index.computes | 12 |
| abstract_inverted_index.consider | 49 |
| abstract_inverted_index.inferred | 41 |
| abstract_inverted_index.securely | 69 |
| abstract_inverted_index.security | 61, 88, 117, 134 |
| abstract_inverted_index.setting, | 135 |
| abstract_inverted_index.both\nthe | 57 |
| abstract_inverted_index.chromatic | 127 |
| abstract_inverted_index.computing | 109 |
| abstract_inverted_index.condition | 101 |
| abstract_inverted_index.different | 130 |
| abstract_inverted_index.entropies | 128 |
| abstract_inverted_index.function, | 111 |
| abstract_inverted_index.functions | 6 |
| abstract_inverted_index.only\none | 10 |
| abstract_inverted_index.protocol. | 95 |
| abstract_inverted_index.protocols | 76 |
| abstract_inverted_index.scenario, | 51, 98 |
| abstract_inverted_index.terms\nof | 126 |
| abstract_inverted_index.additional | 28 |
| abstract_inverted_index.asymptotic | 87, 133 |
| abstract_inverted_index.computable | 70 |
| abstract_inverted_index.conditions | 54 |
| abstract_inverted_index.functions, | 72 |
| abstract_inverted_index.functions. | 79 |
| abstract_inverted_index.randomized | 5, 71 |
| abstract_inverted_index.scenarios, | 121 |
| abstract_inverted_index.computation | 3 |
| abstract_inverted_index.considered, | 8 |
| abstract_inverted_index.expressions | 138 |
| abstract_inverted_index.information | 29 |
| abstract_inverted_index.and\noutput. | 46 |
| abstract_inverted_index.scenarios.\n | 144 |
| abstract_inverted_index.semi-honest; | 19 |
| abstract_inverted_index.only\nagainst | 103 |
| abstract_inverted_index.single-letter | 137 |
| abstract_inverted_index.user's\ninput | 33 |
| abstract_inverted_index.a\nrate-optimal | 94 |
| abstract_inverted_index.computation\nis | 21 |
| abstract_inverted_index.a\ncharacterization | 67 |
| abstract_inverted_index.provide\nrate-optimal | 75 |
| abstract_inverted_index.same\ncharacterization | 84 |
| abstract_inverted_index.rate-optimal\nprotocols. | 114 |
| cited_by_percentile_year.max | 96 |
| cited_by_percentile_year.min | 89 |
| corresponding_author_ids | https://openalex.org/A5023777978 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 1 |
| corresponding_institution_ids | https://openalex.org/I11947397 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.5199999809265137 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile.value | 0.90606828 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |