Fully secure ciphertext policy attribute‐based encryption with constant length ciphertext and faster decryption. Issue 11 (15th November 2013)

• Record Type: Journal Article
• Authors: Doshi, Nishant; Jinwala, Devesh C.
• Is Part Of: Security and communication networks. Volume 7:Issue 11(2014:Nov.)
• Page Start: 1988
• Page End: 2002
• Publication Date: 2013-11-15
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.913
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main" id="sec913-abs-0001"> <title>ABSTRACT</title> <p id="sec913-para-0001">In PKC 2010, Herranz <italic>et al.</italic> proposed the first fully threshold ciphertext policy attribute‐based encryption (CP‐ABE) scheme with constant length ciphertext. However, their scheme is selectively secure with respect to the chosen plaintext attack. They have left three open problems for CP‐ABE with constant ciphertext length, that is, Security against the Chosen Ciphertext Attacks, Security Reduction to a better mathematical problem and to make the scheme Fully Secure. Indeed, in ACISP 2012, Ge <italic>et al.</italic> proposed the solutions to the first two problems but left their proposed scheme selective secure. This makes their scheme weaker because it is secure only for a particular policy. With an aim to propose a fully secure constant ciphertext length CP‐ABE scheme, in this paper, we discuss our attempts at extending the approach of Lewko <italic>et al.</italic> (in EUROCRYPT 2010). The scheme that we propose here allows any subset of attributes of the secret key as a part of the ciphertext policy. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>