Distributed Monotone-Policy Encryption with Silent Setup from Lattices

Paper 2026/372

Distributed Monotone-Policy Encryption with Silent Setup from Lattices

Abtin Afshar, University of Wisconsin-Madison

Rishab Goyal, University of Wisconsin-Madison

Saikumar Yadugiri

, University of Wisconsin-Madison

Abstract

Distributed cryptography serves as a cornerstone for building trustless systems, yet existing solutions for distributed policy encryption typically require either a trusted dealer or complex interactive setup protocols. Recent advances have introduced the concept of $silent~setup$, where users independently generate keys and a joint public key is derived deterministically. However, all current silent-setup constructions rely on bilinear pairings, leaving them vulnerable to quantum adversaries. In this work, we present the first distributed monotone-policy encryption scheme with silent setup based on lattices. Our construction supports arbitrary monotone policies represented as Disjunctive Normal Forms (DNFs) and provides a robust, post-quantum foundation for decentralized access control.

Note: Added details about concurrent work

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
Keywords: Distributed Encryption Secret Sharing
Contact author(s): abtin @ cs wisc edu
rishab @ cs wisc edu
saikumar @ cs wisc edu
History: 2026-02-24: revised; 2026-02-23: received; See all versions
Short URL: https://ia.cr/2026/372
License: CC BY

BibTeX

@misc{cryptoeprint:2026/372,
      author = {Abtin Afshar and Rishab Goyal and Saikumar Yadugiri},
      title = {Distributed Monotone-Policy Encryption with Silent Setup from Lattices},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/372},
      year = {2026},
      url = {https://eprint.iacr.org/2026/372}
}