The Interval Revocation Scheme for Broadcasting Messages to Stateless Receivers
暂无分享,去创建一个
The Broadcast Encryption methods, often referred to as revocation schemes, allow data to be efficiently broadcast to a dynamically changing group of users. A special case is when the receivers are stateless [2,1]. Naor et al. [2] propose the Complete Subset Method (CSM) and the Subset Difference Method (SDM). Asano [1] puts forth two other methods, AM1 and AM2, which use public prime parameters to generate the decryption keys. The efficiency of broadcast encryption methods is measured by three parameters: (i) message size - the number of transmitted ciphertexts; (ii) storage at receiver - the number of private keys each receiver is required to store; and (iii) key derivation time - the computational overhead needed to access the decryption keys.
[1] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[2] Moni Naor,et al. Revocation and Tracing Schemes for Stateless Receivers , 2001, CRYPTO.
[3] Tomoyuki Asano. A Revocation Scheme with Minimal Storage at Receivers , 2002, ASIACRYPT.
[4] Yuliang Zheng,et al. Advances in Cryptology — ASIACRYPT 2002 , 2002, Lecture Notes in Computer Science.