Paper 2022/1632
Cryptography with Weights: MPC, Encryption and Signatures
Abstract
The security of several cryptosystems rests on the trust assumption that a certain fraction of the parties are honest. This trust assumption has enabled a diverse of cryptographic applications such as secure multiparty computation, threshold encryption, and threshold signatures. However, current and emerging practical use cases suggest that this paradigm of
one-person-one-vote is outdated.
In this work, we consider {\em weighted} cryptosystems where every party is assigned a certain weight and the trust assumption is that a certain fraction of the total weight is honest. This setting can be translated to the standard setting (where each party has a unit weight) via virtualization. However, this method is quite expensive, incurring a multiplicative overhead in the weight.
We present new weighted cryptosystems with significantly better efficiency. Specifically, our proposed schemes incur only an {\em additive} overhead in weights.
\begin{itemize}
\item We first present a weighted ramp secret-sharing scheme where the size of the secret share is as short as
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A minor revision of an IACR publication in CRYPTO 2023
- Keywords
- weighted secret sharingmpcthreshold decryptionthreshold signature
- Contact author(s)
-
sanjamg @ berkeley edu
abhishek @ cs jhu edu
pratyay85 @ gmail com
sinharo @ gmail com
mingyuan @ berkeley edu
yinuo @ berkeley edu - History
- 2023-06-27: revised
- 2022-11-24: received
- See all versions
- Short URL
- https://ia.cr/2022/1632
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1632, author = {Sanjam Garg and Abhishek Jain and Pratyay Mukherjee and Rohit Sinha and Mingyuan Wang and Yinuo Zhang}, title = {Cryptography with Weights: {MPC}, Encryption and Signatures}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1632}, year = {2022}, url = {https://eprint.iacr.org/2022/1632} }