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

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.

[1]  Aiman Majid Nassar,et al.  The Internet of Things - A Survey , 2018, مؤتمرات الآداب والعلوم الانسانية والطبيعية.

[2]  Kwangjo Kim,et al.  Grouping-Proof Protocol for RFID Tags: Security Definition and Scalable Construction , 2009, IACR Cryptol. ePrint Arch..

[3]  Chiara Petrioli,et al.  AGREE: exploiting energy harvesting to support data-centric access control in WSNs , 2013, Ad Hoc Networks.

[4]  Yacine Challal,et al.  Efficient CP-ABE Attribute/Key Management for IoT Applications , 2015, 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing.

[5]  Selwyn Piramuthu,et al.  On Existence Proofs for Multiple RFID Tags , 2006, 2006 ACS/IEEE International Conference on Pervasive Services.

[6]  Brent Waters,et al.  Online/Offline Attribute-Based Encryption , 2014, IACR Cryptol. ePrint Arch..

[7]  Sang-Soo Yeo,et al.  Enhanced Yoking Proof Protocols for RFID Tags and Tag Groups , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[8]  Nikita Borisov,et al.  PIRATTE: Proxy-based Immediate Revocation of ATTribute-based Encryption , 2012, ArXiv.

[9]  Leonid Bolotnyy,et al.  Generalized "Yoking-Proofs" for a Group of RFID Tags , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

[10]  Brent Waters,et al.  Ciphertext-Policy Attribute-Based Encryption , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).

[11]  Brent Waters,et al.  Secure attribute-based systems , 2006, CCS '06.

[12]  Yacine Challal,et al.  Batch-based CP-ABE with attribute revocation mechanism for the Internet of Things , 2015, 2015 International Conference on Computing, Networking and Communications (ICNC).

[13]  Juan E. Tapiador,et al.  Probabilistic yoking proofs for large scale IoT systems , 2015, Ad Hoc Networks.

[14]  Matt Blaze,et al.  Divertible Protocols and Atomic Proxy Cryptography , 1998, EUROCRYPT.

[15]  P. MuraliKrishna,et al.  SECURE SCHEMES FOR SECRET SHARING AND KEY DISTRIBUTION USING PELL'S EQUATION , 2013 .

[16]  Kouichi Sakurai,et al.  Grouping proof for RFID tags , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[17]  Yacine Challal,et al.  C-CP-ABE: Cooperative Ciphertext Policy Attribute-Based Encryption for the Internet of Things , 2014, 2014 International Conference on Advanced Networking Distributed Systems and Applications.

[18]  Ari Juels,et al.  "Yoking-proofs" for RFID tags , 2004, IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second.