Secure degree attestation and traceability verification based on zero trust using QP-DSA and RD-ECC
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2024.15.spl-2.30Keywords:
Degree attestation, Blockchain, Data encryption, Smart contract, Hash-based message authentication code, Elliptic curve cryptography, Higher education credentials.Dimensions Badge
Issue
Section
License
Copyright (c) 2024 The Scientific Temper

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
The process of rendering authenticity to the Degree Certificate (DC) is known as Degree Attestation (DA). None of the prevailing works have focused on zero trust-based DA, verification, and traceability for secured DA. So, zero trust-based secured DA, verification, and traceability of degree credentials are presented in the paper. Primarily, to upload the DC of the student, the university registers and logs in to the Blockchain (BC). Subsequently, by utilizing radioactive decay-based elliptic curve cryptography (RD-ECC), the DC is secured. Next, by utilizing Glorot initialization-based Proof-of-Stake (GPoS), the data is stored in the BC. Further, to verify the traceability of the data, a Smart Contract (SC) is created. In the meantime, the student registers and logs in to the BC and gives attestation requests to the university. By utilizing rail fence cipher (RFC) RD-ECC hash-based message authentication code (RFCR-HMAC), the university authenticates the request. By utilizing a quadratic probing-based digital signature algorithm (QP-DSA), the university attests the DC after authentication. Lastly, by utilizing RD-ECC, the attested certificate is encrypted and sent to the student. Hence, the certificate is secured with an encryption time (ET) of 5971ms and DA is performed with a Signature Generation Time (SGT) of 6637ms.Abstract
How to Cite
Downloads
Similar Articles
- Sivakumar S, Rajasekaran Kondareddy, Kalyani Ayyemperumal, Building SaaS solutions using microsoft azure for achieving safe and secure tax related software , The Scientific Temper: Vol. 14 No. 02 (2023): The Scientific Temper
- Regasa Begna, Worku Masho, Wondosan Wondimu, Yaregal Tilahun, Tilahun Bekele, Benyam Tadesse, Haile Negash, Participatory evaluation and demonstration of productive performance of Bovans Brown chicken under village production system in Menit Shasha Woreda, West Omo Zone, Ethiopia , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- P. Ananthi, A. Chandrabose, Exploring learning-assisted optimization for mobile crowd sensing , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- R. Thiagarajan, S. Prakash Kumar, Performance of public transport appraisal using machine learning , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- Ayalew Ali, Baylign Abebe , The link between CEO’s financial literacy and technological innovation of cooperative unions , The Scientific Temper: Vol. 16 No. 04 (2025): The Scientific Temper
- Yanbo Wang, Yonghong Zhu, Jingjing Liu, Research on the current situation and influencing factors of college students learning engagement in a blended teaching environment , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- M.V. RADHAKRISHNAN, E. SUGUMARAN, EFFECT OF A BIODEGRADABLE SUBSTRATE SUGARCANE BAGASSE ON EGG AND SPERM QUALITY OF THE CATFISH, CLARIAS BATRACHUS (LINN.) , The Scientific Temper: Vol. 3 No. 1&2 (2012): The Scientific Temper
- B. Nivedetha, Water Quality Prediction using AI and ML Algorithms , The Scientific Temper: Vol. 14 No. 02 (2023): The Scientific Temper
- Nupur Dogra, Shaveta Sharma, Impact of social networking sites on adolescent alienation and depression with special reference to Facebook usage , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- Aarthi Monalisa M, Anli Suresh, Adoptive bancassurance models transforming patronization among the insured , The Scientific Temper: Vol. 16 No. Spl-2 (2025): The Scientific Temper
<< < 30 31 32 33 34 35 36 37 38 39 > >>
You may also start an advanced similarity search for this article.

