Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > BENNY PINKAS:
All reports by Author Benny Pinkas:

TR23-087 | 9th June 2023
Benny Applebaum, Oded Nir, Benny Pinkas

How to Recover a Secret with $O(n)$ Additions

Revisions: 1

Threshold cryptography is typically based on the idea of secret-sharing a private-key $s\in F$ ``in the exponent'' of some cryptographic group $G$, or more generally, encoding $s$ in some linearly homomorphic domain. In each invocation of the threshold system (e.g., for signing or decrypting) an ``encoding'' of the secret is ... more >>>




ISSN 1433-8092 | Imprint