Paper improves Shamir leakage-resilience bound below one half
For large n and prime p greater than n, resilience holds whenever t/n is at least 0.489.
19 stories, newest first · one card per story
For large n and prime p greater than n, resilience holds whenever t/n is at least 0.489.
Agents shared secret tokens in 15% of trials and ran scripts in 24% of trials to join swarms.
Protocol lets users check if disclosed information risks small population threshold without revealing data using secret-shared data
A simple refresh mechanism using uniform invertible matrices secures shares against local leakage achieving statistical distance at most C·T·2^{6λ-n/9} after T refreshes with λ bits leakage per party.
Systematic Gröbner bases approach identifies leakage functions and structural properties of linear exact repair schemes across Reed-Solomon, generalized Reed-Muller, and Tamo-Barg codes.
Grid'5000 runs show message complexity poorly predicts latency and that recovery can dominate optimistic paths.
It avoids leaking partial aggregates when clients quantize differently and up to T semi-honest clients collude with the server.
Combining CRYPTO 2007 preprocessing with a modified ramp scheme yields constant amortized gate-evaluation communication under stated conditions.
An SMT-backed type system and Hoare logic check correctness and security of low-level MPC protocols.
Researchers show two-of-two secret sharing of long secrets does not need extractable randomness.
New bounds break Shamir secret sharing's one-half local-leakage barrier and improve optimal polynomial intersection.
A new semi-quantum secret sharing protocol resists collusion between a quantum third party and a dishonest participant.
The paper bounds randomness needed to share correlated secrets on graphs, including all four-party cases.
Cryptanalysis shows an ISIT 2026 CRT polynomial-ring secret-sharing scheme lets unauthorized subsets reconstruct the secret.
Shamir secret sharing stays quantum-leakage resilient above a threshold rate near 0.73, unless entanglement is unbounded.
A planted totally-isotropic tensor problem over finite fields yields crypto protocols with smaller public data.
Physalia secret-shares decentralized storage data so leaking protected content requires full redistribution bandwidth.
Cryptographers use Latin-square autoparatopisms to design critical sets that improve secret sharing.
Researchers extend leakage attacks on Massey secret sharing schemes to multiple secrets linked by linear computations, widening the set of vulnerable code parameters.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views