Beyond Anonymity Sets: A Security Model for Distributed Shuffling in Adversarial Environments (opens in new tab)

Distributed shuffling is a core primitive underlying mix-nets, electronic voting, and, more recently, single secret leader election \(SSLE\) protocols for proof-of-stake blockchains\. In these settings, a collection of resource-constrained parties jointly permutes a list of ciphertexts or commitments in order to conceal the correspondence between inputs and outputs\. Existing security analyzes of such protocols typically rely on heuristic anonymity measures or implicitly assume honest behavio...

Read the original article
Sign in to keep reading the full article.

Keyboard Shortcuts

Navigation

Next / previous post
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Discover
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help