A blockchain is a data structure consisting of a list of blocks containing transactions and maintained by a network of nodes in a decentralized manner. In permissionless blockchains, anyone can contribute to the decentralization and security of the transactions. With the advent of smart contracts, programs whose execution is replicated by all the nodes of the network, the blockchain can be deemed not only a reliable and auditable data repository, but also a secure and verifiable computational infrastructure. However, due to the aforementioned features, the throughput of most permissionless blockchains is low, and executing a smart contract can be expensive, depending on its computational complexity. To mitigate these issues, a popular research line studies the implementation of Layer 2 solutions, which consists of nodes that operate off-chain yet remaining tethered to the blockchain. Our literature analysis revealed that a majority of the research articles surveying Layer 2 technologies and solutions typically classify them on the basis of the Layer 2 operations they perform, as well as their ability to improve the processing capacity of the blockchain. In this paper, instead, we survey the methodologies that provide a secure binding between Layer 2 and the blockchain. We refer to these binding techniques as “proving schemes” which we classify as: data integrity proofs, validity proofs, and fraud proofs. For each proving scheme, we describe its intended purpose, the advantages it offers, the methodologies commonly used to connect the operations performed at Layer 2 with the blockchain, and the applications that benefit from such scheme. Finally, we discuss and compare them to give a general comprehension about how schemes can satisfy general requirements common to most Decentralized Applications.

Recent years have witnessed, especially in Europe, a shift aimed at bringing users back at the center of digital systems. This has driven innovation towards the affirmation of decentralized systems, in line with the Self Sovereign Identity paradigm. User control over the consumption and disclosure of their data is a key topic of such drive. In this paper we show how it is possible to apply this increasingly popular concept to a traditionally centralized and opaque digital process: Access Control systems. To this aim we expand the XACML standard for Attribute Based Access Control systems with the novel concept of private attributes, i.e. attributes whose values should not be disclosed while still contributing to a policy evaluation result after user consent. Basing our proposal on blockchain systems, we show how to leverage smart contracts and zero knowledge proofs to allow for transparent policies evaluation without disclosing the value of such sensible attributes. Beside formalizing our goals, presenting the system architecture, and discussing its advantages and drawbacks with respect to the traditional model, we provide a reference example to show our proposal innovative capabilities and provide a prototype experimental evaluation to prove its feasibility.

The blockchain technology has been gaining an increasing popularity for the last years, and smart contracts are being used for a growing number of applications in several scenarios. The execution of smart contracts on public blockchains can be invoked by any user with a transaction, although in many scenarios there would be the need for restricting the right of executing smart contracts only to a restricted set of users. To help deal with this issue, this article proposes a system based on a popular access control framework called RT, Role-based Trust Management, to regulate smart contracts execution rights. The proposed system, called Layer 2 DecentrAlized Role-based Trust management (L2DART), implements the RT framework on a public blockchain, and it is designed as a layer-2 technology that involves both on-chain and off-chain functionalities to reduce the blockchain costs while keeping blockchain auditability, i.e., immutability and transparency. The on-chain costs of L2DART have been evaluated on Ethereum and compared with a previous solution implementing on-chain all the functionalities. The results show that the on-chain costs of L2DART are relatively low, making the system deployable in real-world scenarios.

Every person has associated a set of attributes that need to be shown to perform daily operations, such as the ones in personal identity card. The Self Sovereign Identity framework brings this to the digital world, giving to the user full responsibility of their own attributes. Each user receives a set of attributes is paired with as a Verifiable Credential, which could be issued, for example, by a municipality as a digitally signed ID card. However, it is not possible to disclose only one attribute of the ID card without invalidating the signature, therefore Selective Disclosure approaches have been defined to address this problem. This paper describes a selective disclosure method based on hashing, showing that the method is secure and applicable to the real world due to its low requirement in terms of space and time to create and verify a credential.

The Lightning Network is a P2P overlay that allows two Bitcoin users to create a new payment channel with a transaction, and later exchange cryptocurrency on that channel independently from the Bitcoin blockchain, improving Bitcoin’s scalability issues and making it more suitable for frequent micropayments. Moreover, the channels can also be used to route payments between two users who do not share a direct channel themselves.In this paper we study the topology of the Lightning Network in a given time period, performing a number of analysis on the channels and on the nodes composing the network. We study the churn rate, we evaluate centrality measurements and the clustering coefficient to evaluate the network connectivity, and finally we analyze the presence of a pattern that we named "bouquet". The importance of this pattern is proven by the finding that, removing specific nodes of the "bouquets" (1% of the total) causes the disconnection from the largest component of about 41% nodes.

In the past years, trust management systems have been proven suitable for solving the authorization problem in distributed systems, such as peer to peer systems, social networks, cloud, mobile ad-hoc networks, and Internet of things. Trust management systems could be either managed by a central authority or decentralized. In both cases the entity or, respectively, the set of entities managing the system need to be trusted for all users. To overcome this limitation, this paper brings blockchain technology into trust management systems, proposing a novel implementation of the Role-based Trust management framework (RT) on blockchain. The approach relies on smart contracts to represent user trust networks and to infer new trust relations through the chain discovery algorithm. We evaluated a prototype implemented on Ethereum on a representative set of policies related to different scenarios.

Recommender Systems (RSs) are becoming increasingly popular in the last years. They collect reviews concerning several types of items (e.g., shops, professionals, services, songs or videos) in order to rank them according to a given criterion, and to suggest the most relevant ones to their users. However, most of the currently used RSs exhibit two main drawbacks: they are based on a centralized control model and they do not provide reward mechanisms to encourage the participation of users. To deal with these challenges, the architectures of current RSs could be enhanced through blockchain technology, thus providing novel solutions to decentralize them. As a matter of fact, the blockchain technology could be successfully adopted in this context because smart contracts would allow the decentralization of system control, while cryptocurrency and tokens could be used to implement the reward mechanism. In the light of the above considerations, this manuscript presents a decentralized rating framework aimed to support the users of RSs based on blockchain technology, providing a token-based reward mechanism that remunerates users submitting their reviews to incentivize their participation. Moreover, the proposed system provides a flexible strategy to rank items, allowing users to choose among different functions to combine reviews to obtain item ranking. The performance and the cost of using the proposed system have been evaluated on the Ropsten Ethereum test network. For instance, our experiments have shown that the median time required to store a batch of 35 ratings is about 47 s, while the average time required to obtain the score of an item having 6000 ratings is less than 2.5 s.