scispace - formally typeset
K

Katina Kralevska

Researcher at Norwegian University of Science and Technology

Publications -  77
Citations -  975

Katina Kralevska is an academic researcher from Norwegian University of Science and Technology. The author has contributed to research in topics: Network packet & Scheduling (computing). The author has an hindex of 9, co-authored 73 publications receiving 470 citations. Previous affiliations of Katina Kralevska include Imperial College London.

Papers
More filters
Journal ArticleDOI

Blockchain in healthcare and health sciences-A scoping review.

TL;DR: This study shows that the endeavors of using blockchain technology in the health domain are increasing exponentially and there are areas within the healthdomain that potentially could be highly impacted by blockchain technology.
Posted ContentDOI

VerifyMed -- A blockchain platform for transparent trust in virtualized healthcare: Proof-of-concept

TL;DR: VerifyMed is the first proof-of-concept platform, built on Ethereum, for transparently validating the authorization and competence of medical professionals using blockchain technology and enables a healthcare professional to build a portfolio of real-life work experience and further validates the competence by storing outcome metrics reported by the patients.
Journal ArticleDOI

SoK of Used Cryptography in Blockchain

TL;DR: In this article, the authors thoroughly review and systematize all cryptographic concepts which are already used in blockchain and give a list of cryptographic concepts that have not yet been applied but have big potentials to improve the current blockchain solutions.
Journal ArticleDOI

HashTag Erasure Codes: From Theory to Practice

TL;DR: HashTag Erasure Codes (HTECs) as mentioned in this paper provide the lowest data read and data transfer, and thus the lowest repair time for an arbitrary subpacketization level, where the repair process is linear and highly parallel.
Journal ArticleDOI

General Sub-Packetized Access-Optimal Regenerating Codes

TL;DR: A novel construction of (n, k, d = n - 1) access-optimal regenerating codes for an arbitrary sub-packetization level α for exact repair of any systematic node for flexible construction of codes for different code rates compared with existing approaches.