A construction of a weighted evolving 3 -threshold scheme over the polynomial quotient ring for an (cid:96) -bit secret and a framework to extend the framework to a general secret sharing scheme.
It is proved that the proposed scheme satisfies correctness and perfect secrecy, thereby providing unconditional security against unauthorized coalitions while outperforming existing code-based secret sharing schemes in terms of supported secret size, scalability, and practical runtime.
This work considers N secrets, of which N are linearly independent input values and the remaining N -K secrets are determined by linear computations on these inputs, and analyses the existence of LERS-derived leakage that exploits this structure.
Secret image sharing (SIS) under general access structures (GAS) offers a flexible and secure way to manage distributed images. However, conventional frameworks only guarantee lossless reconstruction when all participants pool their shares. If an authorized group tries to recover the image without everyone participatin...
This work introduces a new PSU protocol that is simple, efficient, and secure against known during-execution leakage and hashing-related leakage without relying on Cuckoo Hashing, and achieves linear complexity.
Sang-Min Lee, Jiseung Kim, Yong-Ha Son· Scientific Reports· 0 citations
A new private telemetry system for computing t - heavy hitters in the STAR and POPSTAR model that efficiently adapts multi-dealer secret sharing to the STAR/POPSTAR model and introduces a novel oblivious secret-share sampling protocol to ensure security against a colluding Aggregation Server.
Harry Eldridge, Aditya Hegde, Brennon Brimhall et al.· IACR Cryptology ePrint Archi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.