{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:40:51Z","timestamp":1760190051686,"version":"build-2065373602"},"reference-count":45,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T00:00:00Z","timestamp":1561075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>The Internet of Things (IoT) is very attractive because of its promises. However, it brings many challenges, mainly issues about privacy preservation and lightweight cryptography. Many schemes have been designed so far but none of them simultaneously takes into account these aspects. In this paper, we propose an efficient attribute-based credential scheme for IoT devices. We use elliptic curve cryptography without pairing, blind signing, and zero-knowledge proof. Our scheme supports block signing, selective disclosure, and randomization. It provides data minimization and transaction unlinkability. Our construction is efficient since smaller key size can be used, and computing time can be reduced. As a result, it is a suitable solution for IoT devices characterized by three major constraints, namely low-energy power, small storage capacity, and low computing power.<\/jats:p>","DOI":"10.3390\/cryptography3020016","type":"journal-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T11:54:31Z","timestamp":1561118071000},"page":"16","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["I2PA: An Efficient ABC for IoT"],"prefix":"10.3390","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6408-1343","authenticated-orcid":false,"given":"Ibou","family":"Sene","sequence":"first","affiliation":[{"name":"Laboratoire de Traitement de l\u2019Information et des Syst\u00e8mes Intelligents, Ecole Polytechnique de Thi\u00e8s, P.O. Box A10 Thi\u00e8s, Senegal"},{"name":"Ecole Doctorale D\u00e9veloppement Durable et Soci\u00e9t\u00e9, Universit\u00e9 de Thi\u00e8s, P.O. Box 967 Thi\u00e8s, Senegal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5941-4687","authenticated-orcid":false,"given":"Abdoul Aziz","family":"Ciss","sequence":"additional","affiliation":[{"name":"Laboratoire de Traitement de l\u2019Information et des Syst\u00e8mes Intelligents, Ecole Polytechnique de Thi\u00e8s, P.O. Box A10 Thi\u00e8s, Senegal"}]},{"given":"Oumar","family":"Niang","sequence":"additional","affiliation":[{"name":"Laboratoire de Traitement de l\u2019Information et des Syst\u00e8mes Intelligents, Ecole Polytechnique de Thi\u00e8s, P.O. Box A10 Thi\u00e8s, Senegal"}]}],"member":"1968","published-online":{"date-parts":[[2019,6,21]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MIC.2015.24","article-title":"From the Internet of Things to the Internet of People","volume":"19","author":"Miranda","year":"2015","journal-title":"IEEE Internet Comput."},{"key":"ref_2","unstructured":"Bradley, J., Barbier, J., and Handler, D. (2018, March 12). L\u2019internet of Everything, un Potentiel de 14,4 Trillions de Dollars. Available online: https:\/\/www.cisco.com\/web\/FR\/tomorrow-starts-here\/pdf\/ioe_economy_report_fr.pdf."},{"key":"ref_3","unstructured":"Mbaye, A., Ciss, A.A., and Niang, O. (2014). A Lightweight Identification Protocol for Embedded Devices. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Alpar, G., and Hoepman, J.H. (2013, January 8). A secure channel for attribute-based credentials: [Short paper]. Proceedings of the 2013 ACM Workshop on Digital Identity Management, Berlin, Germany.","DOI":"10.1145\/2517881.2517884"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Camenisch, J., and Van Herreweghen, E. (2002, January 18\u201322). Design and implementation of the idemix anonymous credential system. Proceedings of the 9th ACM Conference on Computer and Communications Security, Washington, DC, USA.","DOI":"10.1145\/586111.586114"},{"key":"ref_6","unstructured":"Paquin, C., and Zaverucha, G. (2011). U-Prove Cryptographic Specification v1.1, Microsoft Corporation. Technical Report."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Vullers, P., and Alp\u00e1r, G. (2013). Efficient selective disclosure on smart cards using idemix. IFIP Working Conference on Policies and Research in Identity Management, Springer.","DOI":"10.1007\/978-3-642-37282-7_5"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Alp\u00e1r, G., Batina, L., and Lueks, W. (2012). Designated attribute-based proofs for RFID applications. International Workshop on Radio Frequency Identification: Security and Privacy Issues, Springer.","DOI":"10.1007\/978-3-642-36140-1_5"},{"key":"ref_9","first-page":"720","article-title":"Performance based comparison study of RSA and elliptic curve cryptography","volume":"4","author":"Sinha","year":"2013","journal-title":"Int. J. Sci. Eng. Res."},{"key":"ref_10","first-page":"6384186","article-title":"Holistic privacy-preserving identity management system for the internet of things","volume":"2017","year":"2017","journal-title":"Mob. Inf. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Persiano, G., and Visconti, I. (2004). An Efficient and Usable Multi-show Non-transferable Anonymous Credential System. Financial Cryptography, Springer.","DOI":"10.1007\/978-3-540-27809-2_21"},{"key":"ref_12","unstructured":"(2018, March 03). About IRMA. Available online: https:\/\/privacybydesign.foundation\/irma-en\/."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3301","DOI":"10.1002\/sec.1254","article-title":"Performance evaluation of twisted Edwards-form elliptic curve cryptography for wireless sensor nodes","volume":"8","author":"Liu","year":"2015","journal-title":"Secur. Commun. Netw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1007\/s00779-017-1057-6","article-title":"Assessment of attribute-based credentials for privacy-preserving road traffic services in smart cities","volume":"21","author":"Veseli","year":"2017","journal-title":"Person. Ubiquitous Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.cose.2016.11.018","article-title":"Fast revocation of attribute-based credentials for both users and verifiers","volume":"67","author":"Lueks","year":"2017","journal-title":"Comput. Secur."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MC.2018.3011042","article-title":"Attribute-Based Credentials for Privacy-Aware Smart Health Services in IoT-Based Smart Cities","volume":"51","author":"Solanas","year":"2018","journal-title":"Computer"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3836","DOI":"10.1002\/sec.1304","article-title":"Attribute-based credentials with cryptographic collusion prevention","volume":"8","author":"Hajny","year":"2015","journal-title":"Secur. Commun. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Camenisch, J., and Lysyanskaya, A. (2001). An efficient system for non-transferable anonymous credentials with optional anonymity revocation. International Conference on the Theory and Applications of Cryptographic Techniques, Springer.","DOI":"10.1007\/3-540-44987-6_7"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Brands, S.A. (2000). Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy, MIT Press.","DOI":"10.7551\/mitpress\/5931.001.0001"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Camenisch, J., and Lysyanskaya, A. (2004). Signature schemes and anonymous credentials from bilinear maps. Annual International Cryptology Conference, Springer.","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"ref_21","unstructured":"Alp\u00e1r, G. (2018, September 16). Attribute-Based Identity Management : Bridging the Cryptographic Design of ABCs with the Real World. Available online: https:\/\/repository.ubn.ru.nl\/bitstream\/handle\/2066\/135177\/135177.pdf."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Hanzlik, L., and Kluczniak, K. (2014). A short paper on how to improve U-Prove using self-blindable certificates. International Conference on Financial Cryptography and Data Security, Springer.","DOI":"10.1007\/978-3-662-45472-5_17"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Dzurenda, P., Hajny, J., Malina, L., and Ricci, S. (2017, January 24\u201326). Anonymous Credentials with Practical Revocation using Elliptic Curves. Proceedings of the 14th International Joint Conference on e-Business and Telecommunications\u2014Volume 6: SECRYPT, Madrid, Spain.","DOI":"10.5220\/0006467705340539"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Hajny, J., Dzurenda, P., and Malina, L. (2014, January 3). Privacy-PAC: Privacy-Enhanced Physical Access Control. Proceedings of the 13th Workshop on Privacy in the Electronic Society, Scottsdale, AZ, USA.","DOI":"10.1145\/2665943.2665969"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve cryptosystems","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comput."},{"key":"ref_26","unstructured":"Miller, V.S. (1985). Use of elliptic curves in cryptography. Conference on the Theory and Application of Cryptographic Techniques, Springer."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Hu, X., Zheng, X., Zhang, S., Li, W., Cai, S., and Xiong, X. (2019). A High-Performance Elliptic Curve Cryptographic Processor of SM2 over GF(p). Electronics, 8.","DOI":"10.3390\/electronics8040431"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Hu, X., Zheng, X., Zhang, S., Cai, S., and Xiong, X. (2018). A Low Hardware Consumption Elliptic Curve Cryptographic Architecture over GF(p) in Embedded Application. Electronics, 7.","DOI":"10.3390\/electronics7070104"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Lara-Nino, C.A., Diaz-Perez, A., and Morales-Sandoval, M. (2019). Energy\/Area-Efficient Scalar Multiplication with Binary Edwards Curves for the IoT. Sensors, 19.","DOI":"10.3390\/s19030720"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1109\/TIFS.2018.2856123","article-title":"IoT-NUMS: Evaluating NUMS elliptic curve cryptography for IoT platforms","volume":"14","author":"Liu","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.comcom.2016.03.014","article-title":"A privacy-preserving smart parking system using an IoT elliptic curve based security platform","volume":"89","author":"Chatzigiannakis","year":"2016","journal-title":"Comput. Commun."},{"key":"ref_32","first-page":"1","article-title":"Trends in Elliptic Curves Cryptography","volume":"2","year":"2015","journal-title":"IMHOTEP Afr. J. Pure Appl. Math."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., and Lange, T. (2007). Faster addition and doubling on elliptic curves. International Conference on the Theory and Application of Cryptology and Information Security, Springer.","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., and Peters, C. (2008). Twisted edwards curves. International Conference on Cryptology in Africa, Springer.","DOI":"10.1007\/978-3-540-68164-9_26"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Hisil, H., Wong, K.K.H., Carter, G., and Dawson, E. (2008). Twisted Edwards curves revisited. International Conference on the Theory and Application of Cryptology and Information Security, Springer.","DOI":"10.1007\/978-3-540-89255-7_20"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., and Rackoff, C. (1985, January 6\u20138). The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, RI, USA.","DOI":"10.1145\/22145.22178"},{"key":"ref_37","first-page":"1066","article-title":"Cryptanalysis of A Privacy-Preserving Smart Metering Scheme Using Linkable Anonymous Credential","volume":"2015","author":"Qu","year":"2015","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_38","unstructured":"H\u00fclsing, A. (2019, February 24). Digital Signature Schemes and the Random Oracle Model. Available online: https:\/\/www.win.tue.nl\/applied_crypto\/2016\/20161115_ROM_Signatures.pdf."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10207-010-0109-y","article-title":"Efficient online\/offline identity-based signature for wireless sensor network","volume":"9","author":"Liu","year":"2010","journal-title":"Int. J. Inf. Secur."},{"key":"ref_40","unstructured":"Jansma, N., and Arrendondo, B. (2019, February 24). Performance Comparison of Elliptic Curve and RSA Digital Signatures. Available online: http:\/\/www.nicj.net\/files\/performance_comparison_of_elliptic_curve_and_rsa_digital_signatures.pdf."},{"key":"ref_41","unstructured":"Camenisch, J. (2007). Direct Anonymous Attestation Explained, IBM Research. Technical Report."},{"key":"ref_42","unstructured":"Alpar, G. (2018, February 24). Cryptography Fact Sheet about Idemix\u2019s Basic Proof Techniques. Available online: https:\/\/privacybydesign.foundation\/pdf\/idemix_overview.pdf."},{"key":"ref_43","unstructured":"ALPAR, G. (2018, February 24). U-PROVE CRYPTOGRAPHY. Available online: http:\/\/www.cs.ru.nl\/ gergely\/objects\/u-prove.pdf."},{"key":"ref_44","unstructured":"El Housni, Y. (2018). Edwards Curves, HAL. Working Paper or Preprint; HAL Id: hal-01942759."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Josefsson, S., and Liusvaara, I. (2017). Edwards-Curve Digital Signature Algorithm (EdDSA), RFC. Available online: http:\/\/www.rfc-editor.org\/info\/rfc8032.","DOI":"10.17487\/RFC8032"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/3\/2\/16\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:00:20Z","timestamp":1760187620000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/3\/2\/16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,21]]},"references-count":45,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,6]]}},"alternative-id":["cryptography3020016"],"URL":"https:\/\/doi.org\/10.3390\/cryptography3020016","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2019,6,21]]}}}