On the Leakage of Massey Secret Sharing Schemes under Linear Computations
Researchers extend leakage attacks on Massey secret sharing schemes to multiple secrets linked by linear computations, widening the set of vulnerable code parameters.
2 stories, newest first · one card per story
Researchers extend leakage attacks on Massey secret sharing schemes to multiple secrets linked by linear computations, widening the set of vulnerable code parameters.
Researchers prove proximity-gap bounds for rank-metric and Gabidulin codes, enabling the first polynomial commitment scheme framework based on rank-metric error-correcting codes.
Today 1.6K readers · 2.4K views · 774 reads · all time 189K views