Paper 2026/2791

New Results in Adaptively-Secure Broadcast Encryption and Succinct Computational Secret Sharing from Standard Lattices

Rishab Goyal, University of Wisconsin-Madison
Saikumar Yadugiri, University of Wisconsin-Madison
Abstract

Projective pseudorandom generators (PPRGs), introduced by [Applebaum et al.; STOC'23], expand a short seed into a long pseudorandom string, with a special feature that one can generate a short $\textit{projected}$ key, for any set $S$, such that it reveals the output bits in $S$ while preserving pseudorandomness of the remaining bits. They demonstrated that PPRGs can bypass the 'representation size barrier' in computational secret sharing schemes, and designed PPRGs assuming hardness of a variety of standard cryptographic assumptions. Later, [Hsieh, Waters, and Wu; EUROCRYPT'25] showed that PPRGs can also be used to design adaptively-secure broadcast encryption in the standard model, without relying on unprovable heuristics. In this work, we design succinct computational secret sharing schemes for graph access structures and adaptively-secure flexible broadcast encryption in the standard model, both with optimal parameters. The main driver for both our results is a new construction of a compact programmable pseudorandom set sampler (PPS), introduced by [Goyal and Yadugiri; CRYPTO'26], from standard Learning with Errors (LWE) assumption [Regev; STOC'05]. We show that PPS generically imply PPRGs with many useful properties and, moreover, by replacing PPRGs with PPS we can achieve full succinctness in the underlying applications to secret sharing and adaptive security compilers for broadcast encryption. This yields the $\textit{first}$ flexible broadcast encryption scheme in the standard model from $\textit{any}$ falsifiable assumption with fully compact ciphertext size, and a succinct computational secret sharing for evolving graph access structures with optimal share size from standard LWE.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
Keywords
Broadcast EncryptionFlexible Broadcast EncryptionProjective PRGs
Contact author(s)
rishab @ cs wisc edu
saikumar @ cs wisc edu
History
2026-11-09: approved
2026-11-05: received
See all versions
Short URL
https://ia.cr/2026/2791
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2791,
      author = {Rishab Goyal and Saikumar Yadugiri},
      title = {New Results in Adaptively-Secure Broadcast Encryption and Succinct Computational Secret Sharing from Standard Lattices},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2791},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2791}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.