The recent EU regulation on Markets in Crypto Assets Regulation (MiCA) represents significant progress in establishing a multi-jurisdiction framework for crypto-assets that will enable the greater participation of consumers in the digital assets industry. One type of token recognized by MiCA is the asset-referenced token, where the value-bearing physical asset being referenced by the token is external to the token. We discuss several design considerations for the on-chain and off- chain metadata for the asset-referenced token that represents physical real-world assets. The EU Data Spaces provides an interesting data management framework for the off-chain metadata underpinning the MiCA asset-referenced tokens, including asset definition schemas, asset profiles, digitized asset records, and tokenized asset records. The Web3 decentralized registries for assets-related metadata should be a promising application of the data spaces framework in the EU.

Existing interoperability mechanisms usually en-compass asset exchanges, asset transfers, and general data transfers. However, most of the solutions based on these mechanisms work only for pairs of permissionless blockchains, falling short in use cases that require more complex business relationships. Furthermore, contrary to existing legacy systems, there is little standardization for cross-domain communication, which multiple players in industry and academia are exploring. We present the Multi-Party Secure Asset Transfer Protocol (MP-SATP), a resilient multi-party asset transfer protocol built on top of the Secure Asset Transfer Protocol (SATP), which is being developed by theInternet Engineering Task Force(IETF). Furthermore, we enhance SATP’s crash recovery mechanism to improve the reliability and performance of our solution. Using MP-SATP, we explain how to perform N -to-N resilient asset transfers in permissioned environments by decoupling them into multiple 1-to-1 asset transfers. Our results show that the latency of the protocol is driven by the latency of the slowest 1-to-1 session and that the use of backup gateways avoids the overhead caused by rollbacks.

Decentralized ledger technology (DLT) is becoming ubiquitous in today’s society. However, organizations need to connect their existing systems and processes to blockchains (centralized, decentralized) securely and reliably, sometimes also implying that they need to connect blockchains (decentralized, decentralized). This challenge is known as blockchain interoperability. We put the case forward that academia and industry must propose evaluation frameworks for blockchain interoperability solutions that address the three interoperability modes. Those are data transfers, asset transfers, and asset exchanges. In this position paper, we illustrate the remaining challenges of interoperability, focusing on the systematic evaluation of interoperability mechanisms based on the state of the art and our own experience. Our evaluation is a systematic online survey of 17 items targeting blockchain specialists. Our quantitative analysis shows that several interesting metrics can show promising directions for systematically evaluating integration solutions.

Recent years have witnessed significant advancements in cross-chain technology. However, the field faces two pressing challenges. On the one hand, hacks on cross-chain bridges have led to monetary losses of around 3.1 billion USD, highlighting flaws in security models governing interoperability mechanisms and the ineffectiveness of incident response frameworks. On the other hand, users and bridge operators experience restricted privacy, which broadens the potential attack surface.In this paper, we present the most comprehensive study to date on the security and privacy of blockchain interoperability. We employ a systematic literature review, yielding a corpus of 212 relevant documents, including 58 academic papers and 154 gray literature documents, out of a pool of 531 results. We systematically categorize 57 interoperability solutions based on a novel security and privacy taxonomy. Our dataset, comprising academic research, disclosures from bug bounty programs, and audit reports, exposes 45 cross-chain vulnerabilities, 4 privacy leaks, and 92 mitigation strategies. Leveraging this data, we analyze 18 notable bridge hacks accounting for over 2.9 billion USD in losses, mapping them to the identified vulnerabilities.Our findings reveal that a substantial portion (65.8%) of stolen funds originates from projects secured by intermediary permissioned networks with unsecured cryptographic key operations. Privacy-wise, we demonstrate that achieving unlinkability in cross-chain transactions is contingent on the underlying ledgers providing some form of confidentiality. Our study offers 17 critical insights into the security and privacy of cross-chain systems. We pinpoint promising future research directions, underscoring the urgency of enhancing security and privacy efforts in cross-chain technology. The identified improvements have the potential to mitigate the financial risks associated with bridge hacks, fostering user trust in the blockchain ecosystem and, consequently, wider adoption.

Securely transferring tokenised assets between largely non-interoperable blockchain networks is a great challenge to take on. Implementations must coordinate transactions on multiple blockchain networks which have inherently different characteristics and functionality. Moreover, implementations must coordinate transactions in strict order, in an atomic, synchronised way so that owners do not risk their assets becoming lost, while also mitigating the age-old problem of “avoiding double spend”. Several protocols for cross-network asset transfer, i.e. the bridging of assets, exist, and several production bridge implementations exist. However, frequent high-profile security breaches have arguably given bridges a bad reputation. Therefore, there is a clear need for standardised bridge protocols to re-establish trust. One initiative for standardising cross-network bridges is the Secure Asset Transfer Protocol (SATP) developed by the Internet Engineering Task Force (IETF). This protocol establishes four distinctive phases for the asset transfer process, driven by a standardised messaging cycle between specialised bridge orchestration applications, known as gateways. In this paper, we demonstrate a reference framework with functions needed to implement SATP. We describe our implementation of this reference framework, why SATP is unique and why SATP is likely to be an important contribution to powering future bridges.

Entrepreneurs, enterprises, and governments are using distributed ledger technology (DLT) as a component of complex information systems, and therefore interoperability capabilities are required. Interoperating DLTs enable network effects and synergies, and similarly to the rise of the Internet, it unlocks the full potential of the technology. However, due to the novelty of the area, interoperability mechanisms (IMs) are still not well understood, as interoperability is studied in silos. Consequently, choosing the proper IM for a use case is challenging. Our article has three contributions: first, we systematically study the research area of DLT interoperability by dissecting and analyzing previous work. We study the logical separation of interoperability layers, how a DLT can connect to others (connection mode), the object of interoperation (interoperation mode), and propose a new categorization for IMs. Second, we propose the first interoperability assessment for DLTs that systematically evaluates the interoperability degree of an IM. This framework allows comparing the potentiality, compatibility, and performance among solutions. Finally, we propose two decision models to assist in choosing an IM, considering different requirements. The first decision model assists in choosing the infrastructure of an IM, while the second decision model assists in choosing its functionality.

Abstract If blockchain networks are to become the building blocks of the infrastructure for the future digital economy, then several challenges related to the resiliency and survivability of blockchain networks need to be addressed. The survivability of a blockchain network is influenced by the diversity of its nodes. Trustworthy device-levelattestationspermits nodes in a blockchain network to provide truthful evidence regarding their current configuration, operational state, keying material and other system attributes. In the current work we review the recent developments towards a standard attestation architecture and evidence conveyance protocols. We explore the applicability and benefits of a standard attestation architecture to blockchain networks. Finally, we discuss a number of open challenges related to node attestations that has arisen due to changing model of blockchain network deployments, such as the use of virtualization and containerization technologies for nodes in cloud infrastructures.

A portal is expected to promote the creation of enterprise communication. In this paper, the communication process of the Architecture Board utilizing a global enterprise portal is analysed. On the basis of the results, a method for promoting the global enterprise portal is evaluated and proposed for the near future.

In light of digitalization, customers increasingly share private data through their online behaviors and actions. Yet, customers have become reluctant to share data due to privacy concerns. From a psychological perspective, a reduction of users' perceived risks should result in a higher willingness to share sensitive data. The development of blockchain-supported, multi-part computation thereby represents an interesting novel empirical context to study such willingness to disclose personal data, as such technologies involve a privacy-preserving approach that could not only technically solve privacy issues but also ought to address precisely the user's risk perception. Therefore, we conducted an online experiment with 420 participants to examine the willingness to disclose personal data dependent on different privacy protection mechanisms. A deception based experiment allowed to measure not only user intention, but also real user behavior. Surprisingly, our results demonstrate that participants shared similar amounts of personal data for blockchain-supported approaches and standard privacy policies. Even though an aversion to the blockchain system due to its novelty and potentially perceived complexity was not detected. Furthermore, we found that the willingness to share data increased significantly specifically for technically affine people when they were presented with the opportunity to monetize their data. We further discuss the effects of privacy awareness and whether prior knowledge of blockchain technology had a supporting effect for user acceptance.

IP multicast deployment has been slow due to several factors. One of the important reasons is a lack of support for debugging, accounting and billing services for multicast protocols. We propose a common framework that can be used to provide multiple multicast services efficiently. The framework collects information such as multicast router status, flow statistics and stores them in a database. The data could be used for debugging, traffic engineering, accounting and billing. We illustrate the use of the framework for accounting and billing. We describe a prototype implementation of our approach. Our contributions include a protocol independent tree discovery mechanism and an efficient algorithm for per-receiver accounting.

The current work looks closer at the problem of receiver access control within the Protocol Independent Multicast (PIM) protocol-specifically PIM Sparse Mode-and proposes a practical solution to this problem for PIM-SM. The proposed solution has a number of benefits. The approach adheres to the basic IP multicast model and maintains the "anonymous-receiver" principle of the model, thereby maintaining the scalability of the original model. In accordance to the basic model, PIM routers in the domain need not maintain or propagate any host identification information. The solution makes use of the authentication-key arrangement of the PIM Working Group (IETF) and adheres to it. Finally, the distributed decision-making approach adopted allows routers (other than the RP) to decide whether or not a new branch of the distribution tree is to be created towards a given receiver thereby relieving the RP from being the sole decision-point and making the overall solution scalable.

The current work proposes a secure group membership verification (SGMV) protocol for IP multicast. The aim of the SGMV protocol is to allow any valid members of a multicast group to verify the membership of the group without a (trusted) third party vouching for a complete membership list. SGMV allows a valid member of the multicast group to verify the membership of the group on its own and in real-time. This achieved by requiring other valid members to respond to a membership-query message issued by a querying member. Two underlying principles of the current SGMV approach are the independence of the SGMV protocol from the underlying multicast routing protocol and the independence from the group key management protocol(s) employed for the multicast group.

Article Free Access Share on Collection servers: an architecture for multicast receiver reporting Authors: Brad Cain Bay Architecture Laboratory, Nortel Networks, 3 Federal Street, BL3-03 Billerica, MA Bay Architecture Laboratory, Nortel Networks, 3 Federal Street, BL3-03 Billerica, MAView Profile , Thomas Hardjono Bay Architecture Laboratory, Nortel Networks, 3 Federal Street, BL3-03 Billerica, MA Bay Architecture Laboratory, Nortel Networks, 3 Federal Street, BL3-03 Billerica, MAView Profile Authors Info & Claims MULTIMEDIA '99: Proceedings of the seventh ACM international conference on Multimedia (Part 2)October 1999 Pages 107–109https://doi.org/10.1145/319878.319907Published:01 October 1999Publication History 0citation140DownloadsMetricsTotal Citations0Total Downloads140Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The paper contributes a new architecture for secure and scalable inter-domain group key management for N-to-N (conference) IP multicast. The architecture views the multicast routing infrastructure from the key management plane, and logically divides it into two general types of regions for key management to achieve scalability. The work extends the centralized solution of (Wong et al., 1998) into a distributed key management scheme suitable for inter-domain multicast group key management. Methods for initiating new multicast groups, as well as for members joining and leaving, are presented. The paper also considers two general types of IP-multicast that need to be made secure if multicast is to be one of the vehicles for future wide-scale delivery of voice, video and text over the Internet.

Reliable authentication of communicating entities is essential for achieving security in a distributed computing environment. The design of such systems as Kerberos, SPX and more recently KryptoKnight and Kuperee, have largely been successful in addr

A (t, w) threshold scheme is a method for sharing a secret among w shareholders so that the collaboration of at least t shareholders is required in order to reconstruct the shared secret. This paper is concerned with the re-use of shares possessed by shareholders in threshold schemes. We propose a simple (t, w) threshold scheme based on the use of cryptographically strong pseudo-random functions and universal hash functions. A remarkable advantage of the scheme is that a shareholder can use a single string in the share of many different secrets; in particular, a shareholder need not be given a new share each time a new secret is to be shared.