Abstract: In validating a new validator for a proof-of-origin blockchain, an announce message is received including: a unique tag (T) uniquely identifying one fixed communication line of a subscriber of a fixed communication operator; a peer identifier (peer@) of the new validator; an identifier of an authorised signer, and a cryptographic signature (S2) of the authorised signer over at least the unique tag (T) and the peer identifier (peer@); validity of the announce message is verified, including checking from the PoO blockchain that the authorised signer is registered there as an authorised signer and checking the cryptographic signature (S2) of the authorised signer in the announce message. If each checking of the verifying is positive, then accepting the new validator for the PoO blockchain and mapping in the PoO blockchain the unique tag with at least the peer identifier, otherwise refusing the new validator.

Abstract: A system, method and computer program product for providing access to private digital content are disclosed. The private digital content is owned by an owner and installed on a content server and access is provided to a first client which is capable of rendering said digital content. Predetermined information required for gaining authorized access to said content server by said first client is generated by a second client. The predetermined information is transferred from said second client to said first client then used by said first client to get access to said private digital content.

Abstract: A method for storing tagged content items in a distributed data exchange system, comprising: A1. generating a Bloom 1 filter for each tag associated with a content item; A2. generating a key consisting of the juxtaposition of a membership word of the Bloom 1 filter and a membership word index inside the Bloom 1 filter; A3, generating a value comprising a compact representation of all tags, and a reference to the content item; and A4. adding the key-value pair to a distributed hash table. and for searching tagged content items, comprising: B1. receiving a multiple keyword search query; B2. choosing a keyword; B3. retrieving from the distributed hash table a first list of content items having the keyword as associated tag; and B4. filtering the first list via the compact representation of all tags to obtain a second list of content items that comprise all keywords as associated tags.

Abstract: A system, method and computer program product for providing access to private digital content are disclosed. The private digital content is owned by an owner and installed on a content server and access is provided to a first client which is capable of rendering said digital content. Predetermined information required for gaining authorized access to said content server by said first client is generated by a second client. The predetermined information is transferred from said second client to said first client then used by said first client to get access to said private digital content.

Abstract: This invention concerns an arrangement for identifying a data model of at least one service (2103, 2104, 2105), the arrangement comprises a discovery service (2106), comprising storage means for storing data models of the at least one service and for storing a relationship between the data models, and the arrangement comprises inspection means for gathering data models of a service and for establishing relationship between the data models and data models of the at least one service. The invention also concerns a data federation method for identifying a data model of at least one service, by inspecting a service and deriving a data model of the service, establishing a relationship between already known data models of the at least one service, and providing the data models of these services and the relationship between the data models.

Abstract: This invention concerns an arrangement for invoking a requested service, the arrangement comprises a discovery service (2106), the discovery service (2106) comprising storage means for storing a data model of at least one service and retrieval means for retrieving a service (2103, 2104, 2105), where the storage means are adapted to store relationships between services, comprising in advance retrieval means for retrieving a path of multiple services in said data model, where the concatenation of the services correspond to the requested service. The invention concerns also a method for invoking a requested service, the method comprising the steps of retrieving in advance a path of multiple services in said data model, where the concatenation of the services correspond to a requested service for invoking the service on the path consecutively.