Paper 2026/2205
DKG Is All You Need
, Commonware, Inc.Abstract
We construct the first Batched Threshold Encryption scheme with a transparent setup where public parameters are independent of the batch size. As a result batches of arbitrary sizes can be decrypted, without imposing an a priori fixed bound. We prove security under a constant size assumption -- the decisional bilinear square Diffie-Hellman assumption. Setup is just a distributed key generation protocol to sample secret shares of a random value. Ciphertexts consist of two G1 elements, one G2 element and the encrypted message, plus a NIZK for CCA security (two F elements with a sigma protocol). Partial decryptions are a single G1 element, computed with one scalar multiplication. Decrypting a batch of B ciphertexts costs O(B) pairings and O(B log^2 B) group operations.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- BatchedThresholdEncryptionDKG
- Contact author(s)
- guruvamsi policharla @ gmail com
- History
- 2026-09-27: approved
- 2026-09-24: received
- See all versions
- Short URL
- https://ia.cr/2026/2205
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2205,
author = {Guru-Vamsi Policharla},
title = {{DKG} Is All You Need},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2205},
year = {2026},
url = {https://eprint.iacr.org/2026/2205}
}
