Secret Sharing from Non-Extractable Randomness
Researchers show two-of-two secret sharing of long secrets does not need extractable randomness.
3 stories, newest first · one card per story
Researchers show two-of-two secret sharing of long secrets does not need extractable randomness.
A Polygon smart-contract design mitigates the last-revealer attack in commit-and-reveal on-chain lotteries.
Empirical study using IBM DiffPrivLib shows differential privacy mechanisms detect manipulated entropy when roughly 1 in 8-16 bits is biased or correlated.
Today 1.6K readers · 2.4K views · 774 reads · all time 189K views