z-logo
open-access-imgOpen Access
Constant-size Threshold Attribute based SignCryption for Cloud Applications
Author(s) -
Sana Belguith,
Nesrine Kaaniche,
Maryline Laurent,
Abderrazak Jemai,
Rabah Attia
Publication year - 2017
Publication title -
proceedings of the 15th international joint conference on e-business and telecommunications
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5220/0006469202120225
Subject(s) - signcryption , random oracle , computer science , ciphertext , cryptographic primitive , anonymity , cryptography , theoretical computer science , overhead (engineering) , cloud computing , constant (computer programming) , scheme (mathematics) , encryption , computer network , public key cryptography , computer security , mathematics , cryptographic protocol , programming language , operating system , mathematical analysis
International audienceIn this paper, we propose a novel constant-size threshold attribute-based signcryption scheme for securely sharing data through public clouds. Our proposal has several advantages. First, it provides flexible cryptographic access control, while preserving users' privacy as the identifying information for satisfying the access control policy are not revealed. Second, the proposed scheme guarantees both data origin authentication and anonymity thanks to the novel use of attribute based signcryption mechanism, while ensuring the unlinkability between the different access sessions. Third, the proposed signcryption scheme has efficient computation cost and constant communication overhead whatever the number of involved attributes. Finally, our scheme satisfies strong security properties in the random oracle model, namely Indistinguishability against the Adaptive Chosen Ciphertext Attacks (IND-CCA2), Existential Unforgeability against Chosen Message Attacks (EUFCMA) and privacy preservation of the attributes involved in the signcryption process, based on the assumption that the augmented Multi-Sequence of Exponents Decisional Diffie-Hellman (aMSE-DDH) problem and the Computational Diffie Hellman Assumption (CDH) are har

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom