Pith. sign in

REVIEW 2 cited by

Teechan: Payment Channels Using Trusted Execution Environments

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

arxiv 1612.07766 v2 pith:RDNLNBQH submitted 2016-12-22 cs.CR

classification cs.CR
keywords teechanblockchainpaymentbitcoinchannelchannelsexecutionlatency
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Blockchain protocols are inherently limited in transaction throughput and latency. Recent efforts to address performance and scale blockchains have focused on off-chain payment channels. While such channels can achieve low latency and high throughput, deploying them securely on top of the Bitcoin blockchain has been difficult, partly because building a secure implementation requires changes to the underlying protocol and the ecosystem. We present Teechan, a full-duplex payment channel framework that exploits trusted execution environments. Teechan can be deployed securely on the existing Bitcoin blockchain without having to modify the protocol. It: (i) achieves a higher transaction throughput and lower transaction latency than prior solutions; (ii) enables unlimited full-duplex payments as long as the balance does not exceed the channel's credit; (iii) requires only a single message to be sent per payment in any direction; and (iv) places at most two transactions on the blockchain under any execution scenario. We have built and deployed the Teechan framework using Intel SGX on the Bitcoin network. Our experiments show that, not counting network latencies, Teechan can achieve 2,480 transactions per second on a single channel, with sub-millisecond latencies.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains

    cs.CR 2019-09 reject novelty 5.0 of 10

    T3 combines SGX and a two-tree ORAM to give Bitcoin SPV clients privacy-preserving UTXO lookups with sub-millisecond to 2.4 ms reads in simulation, but its privacy argument has a multi-client linkability gap.

  2. Enhancing Blockchain Cross Chain Interoperability: A Comprehensive Survey

    cs.CR 2025-05 conditional novelty 3.0 of 10

    A systematic survey that organizes blockchain cross-chain interoperability techniques into a classification and compares them with industry practice, while identifying open challenges.

Pith tools