Randomness Requirements for Three-Secret Sharing

We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted. The dealer produces three shares such that every pair of shares reveals a unique secret and reveals nothing about the ot...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2023-04
Main Authors: Hari Krishnan P Anilkumar, Aayush Rajesh, Narayanan, Varun, Prabhakaran, Manoj M, Prabhakaran, Vinod M
Format: Article
Language:English
Subjects:
Randomness
Upper bounds
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Hari Krishnan P Anilkumar
Aayush Rajesh
Narayanan, Varun
Prabhakaran, Manoj M
Prabhakaran, Vinod M
description We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted. The dealer produces three shares such that every pair of shares reveals a unique secret and reveals nothing about the other two secrets, other than what can be inferred from the revealed secret. For the case of binary secrets, we exactly determine the minimum amount of randomness required by the dealer, for each possible set of permitted combinations. Our characterization is based on new lower and upper bounds.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2808084038</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2808084038</sourcerecordid><originalsourceid>FETCH-proquest_journals_28080840383</originalsourceid><addsrcrecordid>eNqNissKwjAQAIMgWLT_EPAcWJNWcxfFc9t7Cbp9YRO7m_y_PfgBMoc5zGxEpo05KVtovRM58wQA-nzRZWkyAZXzrzB7ZJYVLmkknNFHll0g2QyEqGp8EkZZD45G3x_EtnNvxvznvTjeb831oT4UloQc2ykk8mtqtYWVAow1_11fhDAzQw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2808084038</pqid></control><display><type>article</type><title>Randomness Requirements for Three-Secret Sharing</title><source>Publicly Available Content Database</source><creator>Hari Krishnan P Anilkumar ; Aayush Rajesh ; Narayanan, Varun ; Prabhakaran, Manoj M ; Prabhakaran, Vinod M</creator><creatorcontrib>Hari Krishnan P Anilkumar ; Aayush Rajesh ; Narayanan, Varun ; Prabhakaran, Manoj M ; Prabhakaran, Vinod M</creatorcontrib><description>We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted. The dealer produces three shares such that every pair of shares reveals a unique secret and reveals nothing about the other two secrets, other than what can be inferred from the revealed secret. For the case of binary secrets, we exactly determine the minimum amount of randomness required by the dealer, for each possible set of permitted combinations. Our characterization is based on new lower and upper bounds.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Randomness ; Upper bounds</subject><ispartof>arXiv.org, 2023-04</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2808084038?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25731,36989,44566</link.rule.ids></links><search><creatorcontrib>Hari Krishnan P Anilkumar</creatorcontrib><creatorcontrib>Aayush Rajesh</creatorcontrib><creatorcontrib>Narayanan, Varun</creatorcontrib><creatorcontrib>Prabhakaran, Manoj M</creatorcontrib><creatorcontrib>Prabhakaran, Vinod M</creatorcontrib><title>Randomness Requirements for Three-Secret Sharing</title><title>arXiv.org</title><description>We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted. The dealer produces three shares such that every pair of shares reveals a unique secret and reveals nothing about the other two secrets, other than what can be inferred from the revealed secret. For the case of binary secrets, we exactly determine the minimum amount of randomness required by the dealer, for each possible set of permitted combinations. Our characterization is based on new lower and upper bounds.</description><subject>Randomness</subject><subject>Upper bounds</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNissKwjAQAIMgWLT_EPAcWJNWcxfFc9t7Cbp9YRO7m_y_PfgBMoc5zGxEpo05KVtovRM58wQA-nzRZWkyAZXzrzB7ZJYVLmkknNFHll0g2QyEqGp8EkZZD45G3x_EtnNvxvznvTjeb831oT4UloQc2ykk8mtqtYWVAow1_11fhDAzQw</recordid><startdate>20230428</startdate><enddate>20230428</enddate><creator>Hari Krishnan P Anilkumar</creator><creator>Aayush Rajesh</creator><creator>Narayanan, Varun</creator><creator>Prabhakaran, Manoj M</creator><creator>Prabhakaran, Vinod M</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230428</creationdate><title>Randomness Requirements for Three-Secret Sharing</title><author>Hari Krishnan P Anilkumar ; Aayush Rajesh ; Narayanan, Varun ; Prabhakaran, Manoj M ; Prabhakaran, Vinod M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28080840383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Randomness</topic><topic>Upper bounds</topic><toplevel>online_resources</toplevel><creatorcontrib>Hari Krishnan P Anilkumar</creatorcontrib><creatorcontrib>Aayush Rajesh</creatorcontrib><creatorcontrib>Narayanan, Varun</creatorcontrib><creatorcontrib>Prabhakaran, Manoj M</creatorcontrib><creatorcontrib>Prabhakaran, Vinod M</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hari Krishnan P Anilkumar</au><au>Aayush Rajesh</au><au>Narayanan, Varun</au><au>Prabhakaran, Manoj M</au><au>Prabhakaran, Vinod M</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Randomness Requirements for Three-Secret Sharing</atitle><jtitle>arXiv.org</jtitle><date>2023-04-28</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted. The dealer produces three shares such that every pair of shares reveals a unique secret and reveals nothing about the other two secrets, other than what can be inferred from the revealed secret. For the case of binary secrets, we exactly determine the minimum amount of randomness required by the dealer, for each possible set of permitted combinations. Our characterization is based on new lower and upper bounds.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-04
issn 2331-8422
language eng
recordid cdi_proquest_journals_2808084038
source Publicly Available Content Database
subjects Randomness
Upper bounds
title Randomness Requirements for Three-Secret Sharing
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T00%3A39%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Randomness%20Requirements%20for%20Three-Secret%20Sharing&rft.jtitle=arXiv.org&rft.au=Hari%20Krishnan%20P%20Anilkumar&rft.date=2023-04-28&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2808084038%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_28080840383%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2808084038&rft_id=info:pmid/&rfr_iscdi=true