A game-theoretic cryptographic framework for trustless provenance trees on blockchains where honest registration is the unique stable strategy and complete integrity needs cryptographic priority, governance cascade, and contract enforcement.
Layer 2 blockchain scaling: A survey
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
The paper introduces an incentive-secure Proof-of-Learning protocol for blockchain consensus that claims provable security against two attacks, reduced computational overhead, and guarantees even with untrusted problem providers and verifiers.
The paper reviews blockchain interoperability platforms, presents a case study, and outlines future challenges in connecting heterogeneous blockchains.
citing papers explorer
-
Trustless Provenance Trees: A Game-Theoretic Framework for Operator-Gated Blockchain Registries
A game-theoretic cryptographic framework for trustless provenance trees on blockchains where honest registration is the unique stable strategy and complete integrity needs cryptographic priority, governance cascade, and contract enforcement.
-
Proof-of-Learning with Incentive Security
The paper introduces an incentive-secure Proof-of-Learning protocol for blockchain consensus that claims provable security against two attacks, reduced computational overhead, and guarantees even with untrusted problem providers and verifiers.
-
Exploring Blockchain Interoperability: Frameworks, Use Cases, and Future Challenges
The paper reviews blockchain interoperability platforms, presents a case study, and outlines future challenges in connecting heterogeneous blockchains.