REVIEW 2 cited by
Blockchain Gateways, Bridges and Delegated Hash-Locks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In the current work we discuss the notion of gateways as a means for interoperability across different blockchain systems. We discuss two key principles for the design of gateway nodes and scalable gateway protocols, namely (i) the opaque ledgers principle as the analogue of the autonomous systems principle in IP datagram routing, and (ii) the externalization of value principle as the analogue of the end-to-end principle in the Internet architecture. We illustrate the need for a standard gateway protocol by describing a unidirectional asset movement protocol between two peer gateways, under the strict condition of both blockchains being private/permissioned with their ledgers inaccessible to external entities. Several aspects of gateways and the gateway protocol is discussed, including gateway identities, gateway certificates and certificate hierarchies, passive locking transactions by gateways, and the potential use of delegated hash-locks to expand the functionality of gateways.
Forward citations
Cited by 2 Pith papers
-
Aggregating Digital Identities through Bridging. An Integration of Open Authentication Protocols for Web3 Identifiers
A digital identity bridge that encrypts centralised credentials client-side and logs attestations on-chain lets Web3 users reuse Web2 identities, demonstrated with a DAO proof of concept.
-
Enhancing Blockchain Cross Chain Interoperability: A Comprehensive Survey
A systematic survey that organizes blockchain cross-chain interoperability techniques into a classification and compares them with industry practice, while identifying open challenges.
Discussion (0). Continue with ORCID to comment.