PAPatrick Ali

Patrick Ali

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Patrick Ali has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Data Sovereignty Provision Blockchain for Remote Healthcare Service

    by Hyunho Ryu, Hyunsung Kim, Saurabh Agarwal, Dilip Kumar Sharma, Beaton Kapito, Patrick Ali

    Remote healthcare services provide more opportunities for communication between doctors and patients, strengthening their relationships and improving patient satisfaction and loyalty. However, those services face specific security and privacy challenges that constrain growth. Furthermore, patients’ information is scattered in several hospitals with various formats, which does not provide the data sovereignty of patients. Data sovereignty is a way for any service to control or regain its data. This paper proposes a privacy-preserving blockchain for remote healthcare services to solve these issues. There is only one database of patient electronic health records in our data structure, and various hospitals could use it. The proposed data structure keeps the patient’s electronic health records and the doctor’s diagnosis and prescription data separate. Each entity in our system has different access rights to its role. The proposed system is based on some security primitives, including pseudonym policy, delegation, data encryption, and digital signature, depending on the privacy requirements. The proposed blockchain could be a solution against the previous centralized system and provide remote healthcare services’ data sovereignty, privacy, and security.


  • Bounds on the Steiner radius of a graph

    by Patrick Ali, Edy Tri Baskoro

    For a connected graph [ ] of order [ ] and a set [ ], the Steiner distance of [ ] is the minimum number of edges in a connected subgraph of [ ] containing [ ]. If [ ] is an integer, [ ] and a vertex [ ], the Steiner [ ]-eccentricity of a vertex [ ] of [ ], [ ], is the maximum Steiner distance of all [ ]-subsets of [ ] containing [ ]. The Steiner [ ]-radius of [ ], [ ], is the minimum Steiner [ ]-eccentricities of all vertices in [ ]. We give bounds on [ ] in terms of the order of [ ] and the minimum degree of [ ] for all graphs and for graphs that contain no triangles. We shall also investigate the relation between the [ ]-radius of a graph [ ] and its complement [ ].