<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Papaioannou, Thanasis G</style></author><author><style face="normal" font="default" size="100%">Ritas, Vaios</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">VChain: Establishing Trust Based on Verifiable Credential Chains</style></title><secondary-title><style face="normal" font="default" size="100%">2025 28th Conference on Innovation in Clouds, Internet and Networks (ICIN)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">a microservice</style></keyword><keyword><style  face="normal" font="default" size="100%">a user</style></keyword><keyword><style  face="normal" font="default" size="100%">a VC is linked to very specific properties for which it is issued and its trustworthiness is associated to its root of trust. However</style></keyword><keyword><style  face="normal" font="default" size="100%">Abstract-Verifiable credentials (VCs) appear as a promising solution for holders to prove to verifiers the possession of certain desirable qualities or characteristics in a trustworthy and privacy-aware manner. Currently</style></keyword><keyword><style  face="normal" font="default" size="100%">accuracy</style></keyword><keyword><style  face="normal" font="default" size="100%">CAM and LPwE</style></keyword><keyword><style  face="normal" font="default" size="100%">can be strict and accurate enough to perform even access control or authorization in various practical settings. Moreover</style></keyword><keyword><style  face="normal" font="default" size="100%">determining the trustworthiness of a digital entity</style></keyword><keyword><style  face="normal" font="default" size="100%">e.g</style></keyword><keyword><style  face="normal" font="default" size="100%">etc</style></keyword><keyword><style  face="normal" font="default" size="100%">even if such a derivation could be trivial in the physical world</style></keyword><keyword><style  face="normal" font="default" size="100%">Heuristic algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">i.e</style></keyword><keyword><style  face="normal" font="default" size="100%">Metadata</style></keyword><keyword><style  face="normal" font="default" size="100%">Microservice architectures</style></keyword><keyword><style  face="normal" font="default" size="100%">namely GSP-X</style></keyword><keyword><style  face="normal" font="default" size="100%">Noise</style></keyword><keyword><style  face="normal" font="default" size="100%">on arbitrary properties cannot be currently done based on their existing VCs</style></keyword><keyword><style  face="normal" font="default" size="100%">Open systems</style></keyword><keyword><style  face="normal" font="default" size="100%">Organizations</style></keyword><keyword><style  face="normal" font="default" size="100%">respectively. The algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">Smart contracts</style></keyword><keyword><style  face="normal" font="default" size="100%">Synthetic data</style></keyword><keyword><style  face="normal" font="default" size="100%">Technological innovation</style></keyword><keyword><style  face="normal" font="default" size="100%">the certified access to an organization subdomain should provide access to the domain that includes it. In this paper</style></keyword><keyword><style  face="normal" font="default" size="100%">the likelihood of a microservice to meet advertised qualities for which it possesses no VCs. With synthetic datasets of credential chains of varying degrees of noise and hidden credentials from the ground truth</style></keyword><keyword><style  face="normal" font="default" size="100%">they are able to estimate a level of confidence on the possession of specific attributes based on the VCs available at the holder. Implementing one of the proposed algorithms within a blockchain smart contract can serve as a trust broker for assessing tru</style></keyword><keyword><style  face="normal" font="default" size="100%">we define and experimentally analyze three different algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">we experimentally establish that CAM and LPwE can accurately infer additional information about an entity's attributes or qualities even based on 50% and 60% of available ground truth</style></keyword><keyword><style  face="normal" font="default" size="100%">when properly parametrized</style></keyword><keyword><style  face="normal" font="default" size="100%">while employ VCs of multiple holders to infer the trustworthiness of a specific entity to possess specific properties of interest within a certain context</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2025</style></year></dates><pages><style face="normal" font="default" size="100%">41-48</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>