Paper 2026/2768
Cryptanalysis of Pairing-Based Additive Masking with Prime-Field Secrets
Abstract
We analyze the public values generated by a pairing-based multi-secret sharing construction in which each secret is added to a power of a common pairing value. The secrets lie in the prime subfield of the extension field containing the public values. We show that the first two public values determine the common mask whenever an explicit nonzero condition holds. We also show that the exceptional case is resolved for the parameter set considered in the numerical example. Consequently, the complete public transcript determines every secret, without requiring a participant share or an initially compromised secret. We further describe two related forms of leakage: recovery of all secrets after disclosure of one suitable secret, and a reduction in the possible values of a secret from a single public value. Our conclusions concern the field-valued, common-base masking construction analyzed here; they do not imply that pairing-based secret sharing in general is insecure.
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- Keywords
- secret sharingbilinear pairingselliptic curvesfinite fieldscryptanalysis
- Contact author(s)
- sh harliv @ gmail com
- History
- 2026-11-06: approved
- 2026-11-04: received
- See all versions
- Short URL
- https://ia.cr/2026/2768
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2768,
author = {Harliv Singh},
title = {Cryptanalysis of Pairing-Based Additive Masking with Prime-Field Secrets},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2768},
year = {2026},
url = {https://eprint.iacr.org/2026/2768}
}
