This paper presents an evaluation of ABE. They begin by presenting an overview of ABE. ABE works by using threshold encryption to require that some set of attributes be present for decryption. They also present a random oracle construction for encryption and an optimization for decryption. They follow their overview with a discussion on AKI, including a brief discussion on attribute revocation. The authors then present Attribute Policies which define how an object is to be encrypted. They also go into great detail on how conjunction and disjunction are modeled in policies. The authors also note that conjunction is susceptible to collusion attacks. Two applications of ABE are then presented. They describe how policies for a HIPAA compliant distributed files system would be set up followed and then describe policies for a social network. Finally, the authors present an evaluation of ABE using various different forms of encryption and also with or without a random oracle. They use 2 forms of elliptic curves, SS and MNT. For encryption, without Random oracles, SS is much worse then MNT, however there is no significant difference between SS and MNT when oracles are present. For Decryption, SS is better then MNT, both with and with oracles. The authors also present a comparison between ABE and RSA. They finally present an evaluation of their 2 applications. and discussion of key length and revocation. The solution they present for revocation is to have expiring attributes. Voting R - 0 WR - 0 WA - 9 A - 4