1,721,039 research outputs found
Advancing Orchestration Synthesis for Contract Automata - Complementary Material
No full text<p>This repository contains the complementary material for the paper "Advancing Orchestration Synthesis for Contract Automata" by Davide Basile and Maurice H. ter Beek, published in the Journal of Logical and Algebraic Methods in Programming. </p>
<p>This repository contains:</p>
<ul>
<li>a snapshot of the repository https://github.com/contractautomataproject/ContractAutomataLib/tree/953b9167070842f767f85d227df9235f7a7dca6d (the contract automata library implementing the splitting orchestration synthesis),</li>
<li>a snapshot of the repository https://github.com/contractautomataproject/jlampIce2023experiments/tree/c5fb9dee3059800188c99eb8484e1b55b96b6410 (the code used for the experiments in the paper),</li>
<li>an archive containing the automata of the other examples used in the paper.</li>
</ul>
Enhancing Blockchain-Based Processes with Decentralized Oracles
No full textThe automation of business processes via blockchain-based systems allows for trust, reliability and accountability of execution. The link that connects modules that operate within the on-chain sphere and the off-chain world is key as processes often involve the handling of physical entities and external services. The components that create that link are named oracles. Numerous studies on oracles and their implementations are arising in the literature. Nevertheless, their availability, integrity and trust could be undermined if centralized architectures are adopted, as taking over an oracle could produce the effect of a supply-chain attack on the whole system. Solutions are emerging that overcome this issue by turning the architecture underneath the oracles into a distributed one. In this paper, we investigate the design and application of oracles, distinguishing their adoption for the in-flow or out-flow of information and according to the initiator of the exchange (hence, pull- or push-based)
A formal framework for secure and complying services
No full textInternet is offering a variety of services that are assembled to accomplish
requests made by clients. While serving a request, security of the communications and
of the data exchanged among services is crucial. Since communications occur along
specific channels, it is equally important to guarantee that the interactions between a
client and a server never get blocked because either cannot access a selected channel.
We address here both these problems, from a formal point of view. A static analysis is
presented, guaranteeing that a composition of a client and of possibly nested services
respects both security policies for access control, and compliance between clients and
servers
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
A Blockchain-driven Architecture for Usage Control in Solid
No full textDecentralization initiatives like Solid enable data owners to control who has access to their data and to stimulate innovation by creating both application and data markets. Once data owners share their data with others, though, it is no longer possible for them to control how their data are used. To address this issue, we propose a usage control architecture to monitor compliance with usage control policies. To this end, our solution relies on blockchain and trusted execution environments. We demonstrate the potential of the architecture by describing the various workflows needed to realize a motivating use case scenario for data markets. Additionally, we discuss the merits of the approach from privacy, security, integrateability, and affordability perspectives
Automata for Specifying and Orchestrating Service Contracts
Get PDFAn approach to the formal description of service contracts is presented in terms of
automata. We focus on the basic property of guaranteeing that in the multi-party composition of principals each of them gets his requests satisfied, so that the overall composition reaches its goal.
Depending on whether requests are satisfied synchronously or asynchronously, we construct an orchestrator that at static time either yields composed services enjoying the required properties or detects the principals responsible for possible violations. To do that in the asynchronous case we resort to Linear Programming techniques. We also relate our automata with two logically based methods for specifying contracts
Trusted Execution Environment for Decentralized Process Mining
Get PDFInter-organizational business processes involve multiple independent organizations collaborating to achieve mutual interests. Process mining techniques have the potential to allow these organizations to enhance operational efficiency, improve performance, and deepen the understanding of their business based on the recorded process event data. However, inter-organizational process mining faces substantial challenges, including topical secrecy concerns: The involved organizations may not be willing to expose their own data to run mining algorithms jointly with their counterparts or third parties. In this paper, we introduce CONFINE, a novel approach that unlocks process mining on multiple actors’ process event data while safeguarding the secrecy and integrity of the original records in an inter-organizational business setting. To ensure that the phases of the presented interaction protocol are secure and that the processed information is hidden from involved and external actors alike, our approach resorts to a decentralized architecture comprised of trusted applications running in Trusted Execution Environments (TEEs). We show the feasibility of our solution by showcasing its application to a healthcare scenario and evaluating our implementation in terms of memory usage and scalability on real-world event logs
- …
