Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements
Aiming to strengthen classical secret-sharing to make it a more directly useful primitive for human endusers, we develop definitions, theorems, and efficient constructions for what we call adept secret-sharing. Our primary concerns are the properties we call privacy, authenticity, and error correcti...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2020-10-01
|
| Series: | Proceedings on Privacy Enhancing Technologies |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/popets-2020-0082 |
| id |
doaj-437461a29bf24418b4307459bf158a18 |
|---|---|
| record_format |
Article |
| spelling |
doaj-437461a29bf24418b4307459bf158a182021-09-05T14:01:11ZengSciendoProceedings on Privacy Enhancing Technologies2299-09842020-10-012020446149010.2478/popets-2020-0082popets-2020-0082Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness RequirementsBellare Mihir0Dai Wei1Rogaway Phillip2University of California, San Diego, USA.University of California, San Diego, USA.University of California, Davis, USA.Aiming to strengthen classical secret-sharing to make it a more directly useful primitive for human endusers, we develop definitions, theorems, and efficient constructions for what we call adept secret-sharing. Our primary concerns are the properties we call privacy, authenticity, and error correction. Privacy strengthens the classical requirement by ensuring maximal confidentiality even if the dealer does not employ fresh, uniformly random coins with each sharing. That might happen either intentionally—to enable reproducible secretsharing— or unintentionally, when an entropy source fails. Authenticity is a shareholder’s guarantee that a secret recovered using his or her share will coincide with the value the dealer committed to at the time the secret was shared. Error correction is the guarantee that recovery of a secret will succeed, also identifying the valid shares, exactly when there is a unique explanation as to which shares implicate what secret. These concerns arise organically from a desire to create general-purpose libraries and apps for secret sharing that can withstand both strong adversaries and routine operational errors.https://doi.org/10.2478/popets-2020-0082adept secret-sharingcomputational secret sharingcryptographic definitionssecret sharing |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Bellare Mihir Dai Wei Rogaway Phillip |
| spellingShingle |
Bellare Mihir Dai Wei Rogaway Phillip Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements Proceedings on Privacy Enhancing Technologies adept secret-sharing computational secret sharing cryptographic definitions secret sharing |
| author_facet |
Bellare Mihir Dai Wei Rogaway Phillip |
| author_sort |
Bellare Mihir |
| title |
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements |
| title_short |
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements |
| title_full |
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements |
| title_fullStr |
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements |
| title_full_unstemmed |
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements |
| title_sort |
reimagining secret sharing: creating a safer and more versatile primitive by adding authenticity, correcting errors, and reducing randomness requirements |
| publisher |
Sciendo |
| series |
Proceedings on Privacy Enhancing Technologies |
| issn |
2299-0984 |
| publishDate |
2020-10-01 |
| description |
Aiming to strengthen classical secret-sharing to make it a more directly useful primitive for human endusers, we develop definitions, theorems, and efficient constructions for what we call adept secret-sharing. Our primary concerns are the properties we call privacy, authenticity, and error correction. Privacy strengthens the classical requirement by ensuring maximal confidentiality even if the dealer does not employ fresh, uniformly random coins with each sharing. That might happen either intentionally—to enable reproducible secretsharing— or unintentionally, when an entropy source fails. Authenticity is a shareholder’s guarantee that a secret recovered using his or her share will coincide with the value the dealer committed to at the time the secret was shared. Error correction is the guarantee that recovery of a secret will succeed, also identifying the valid shares, exactly when there is a unique explanation as to which shares implicate what secret. These concerns arise organically from a desire to create general-purpose libraries and apps for secret sharing that can withstand both strong adversaries and routine operational errors. |
| topic |
adept secret-sharing computational secret sharing cryptographic definitions secret sharing |
| url |
https://doi.org/10.2478/popets-2020-0082 |
| work_keys_str_mv |
AT bellaremihir reimaginingsecretsharingcreatingasaferandmoreversatileprimitivebyaddingauthenticitycorrectingerrorsandreducingrandomnessrequirements AT daiwei reimaginingsecretsharingcreatingasaferandmoreversatileprimitivebyaddingauthenticitycorrectingerrorsandreducingrandomnessrequirements AT rogawayphillip reimaginingsecretsharingcreatingasaferandmoreversatileprimitivebyaddingauthenticitycorrectingerrorsandreducingrandomnessrequirements |
| _version_ |
1717810593941946368 |