Threshold Yoking/Grouping Proofs Based on CP-ABE for IoT Applications

Lyes Touati (1, 2) , Hamed Hellaoui (3) , Yacine Challal (3, 4)

1 Labex MS2T - Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques"
2 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
3 LMCS - Laboratoire de Méthodes de Conception de Systèmes
4 CERIST - Centre de recherche sur l'Information Scientifique et Technique

The Internet of Things (IoT) introduces a new vision in which objects are connected to the network. This paradigm is receiving much attention of the scientific community and it is applied in many fields. In some cases, it is useful to prove that a number of objects are simultaneously present in a group. For instance, a client might want to authorize NFC payment with his mobile only if k of his devices are present to ensure that he is the right person. This principle is known as yoking/grouping Proofs. However, existing grouping schemes are mostly designed for RFID systems and don't fulfill the IoT characteristics. In this paper, we tackle this issue and propose a threshold yoking/grouping proof for IoT applications. Our scheme uses the Ciphertext-Policy Attribut-Based Encryption (CP-ABE) protocol to encrypt a message so that it can be decrypted only if at least k nodes are simultaneously present. A security analysis and performance evaluation is conducted to show the effectivenesses of our proposal solution.

Mots clés: IoT; Grouping proofs; CP-ABE; Pairing Cryptography

Domaines: Réseaux et télécommunications [cs.NI]

Lyes Touati, Hamed Hellaoui, Yacine Challal. Threshold Yoking/Grouping Proofs Based on CP-ABE for IoT Applications. The 15th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom-16), Aug 2016, Tianjin, China. pp.568 - 575, ⟨10.1109/TrustCom.2016.0111⟩. ⟨hal-01466908⟩