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
- Elangovan G. Reddy, Anjana Devi V, Subedha V, Tirapathi Reddy B, Viswanathan R, A smart irrigation monitoring service using wireless sensor networks , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- S. Gomathi, C. Radhika, A secure messaging application using steganography and AES encryption a dual-layer secure messaging system , The Scientific Temper: Vol. 16 No. 02 (2025): The Scientific Temper
- Shripada Patil, Sandeep N. Jagdale, Prashant Kalshetti, Management education system in the 21st century: Challenges and opportunities , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- Rekha R., P. Meenakshi Sundaram, Enhanced malicious node identification in WSNs with directed acyclic graphs and RC4-based encryption , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- N. Saranya, M. Kalpana Devi, A. Mythili, Summia P. H, Data science and machine learning methods for detecting credit card fraud , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- Balaji V, Purnendu Bikash Acharjee, Muniyandy Elangovan, Gauri Kalnoor, Ravi Rastogi, Vishnu Patidar, Developing a semantic framework for categorizing IoT agriculture sensor data: A machine learning and web semantics approach , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- Amala Deepa V., T. Lucia Agnes Beena, Enhancing data imputation in complex datasets using Lagrange polynomial interpolation and hot-deck fusion , The Scientific Temper: Vol. 16 No. 02 (2025): The Scientific Temper
- Rekha Raghavendra, Shobha Gowda, Jissy Thomas, Fingerprint doorlock system using Arduino uno , The Scientific Temper: Vol. 16 No. Spl-2 (2025): The Scientific Temper
- Santhanalakshmi M, Ms Lakshana K, Ms Shahitya G M, Enhanced AES-256 cipher round algorithm for IoT applications , The Scientific Temper: Vol. 14 No. 01 (2023): The Scientific Temper
- Partha Majumdar, Empowering skill development through generative AI bridging gaps for a sustainable future , The Scientific Temper: Vol. 16 No. Spl-1 (2025): The Scientific Temper
<< < 1 2 3 4 5 6 7 8 9 10 > >>
You may also start an advanced similarity search for this article.

