The interval revocation scheme for broadcasting messages to stateless receivers

A. Zych, M. Petkovic, W. Jonker

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    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.
    Original languageEnglish
    Title of host publicationProceedings of the 21st Annual IFIP WG 11.3 Working Conference on Data and Applications Security (Data and Applications Security XXI) 8-11 July 2007, Redondo Beach, California, USA
    EditorsS. Barker, G.J. Ahn
    Place of PublicationBerlin
    PublisherSpringer
    Pages95-97
    ISBN (Print)978-3-540-73533-5
    DOIs
    Publication statusPublished - 2007
    Eventconference; Data and Applications Security XXI; 2007-07-08; 2007-07-11 -
    Duration: 8 Jul 200711 Jul 2007

    Publication series

    NameLecture Notes in Computer Science
    Volume4602
    ISSN (Print)0302-9743

    Conference

    Conferenceconference; Data and Applications Security XXI; 2007-07-08; 2007-07-11
    Period8/07/0711/07/07
    OtherData and Applications Security XXI

    Fingerprint Dive into the research topics of 'The interval revocation scheme for broadcasting messages to stateless receivers'. Together they form a unique fingerprint.

    Cite this