GovernanceCrypto

Accountability for Encrypted Mempools

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 05/10/2026, 13:43:26 UTC.

Briefings

This briefing outlines the accountability problem in committee-based encrypted mempools where fewer than t committee members collude to assemble partial decryption capability before the reveal point. The authors propose a traceable threshold encryption construction based on Paillier encryption and VRFs to identify such colluding parties without falsely accusing honest members. The research focuses on mitigating share leakage through traitor tracing techniques adapted from prior work on secret sharing and VRFs.

Key points

• The accountability problem involves identifying committee members who contribute to a partial decryption capability formed by fewer than t colluding parties before the intended reveal point.
• The authors propose a traceable threshold encryption construction using Paillier encryption and VRFs to identify colluding parties without falsely accusing honest members.

Context and limitations

The study focuses on traitor tracing for partial decoder boxes; significant challenges remain regarding setup and the tracing authority. The post is a first step toward mitigation and does not provide a fully deployment-ready solution.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 05/10/2026, 19:07:39 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeicnrkdtvk2s3xikx2r47jpfgah4qflipetxzcv5rk3fikshhgk43u