A Quasipolynomial Reduction for Generalized Selective Decryption on Trees

Abstract

Generalized Selective Decryption (GSD), introduced by Panjwani [TCC’07], is a game for a symmetric encryption scheme Enc that captures the difficulty of proving adaptive security of certain protocols, most notably the Logical Key Hierarchy (LKH) multicast encryption protocol. In the GSD game there are n keys k1, . . . , kn, which the adversary may… (More)
DOI: 10.1007/978-3-662-47989-6_29

Topics

4 Figures and Tables