Assuming rational parties and watchtowers - Will a party commit - - PowerPoint PPT Presentation

assuming rational parties and watchtowers will a party
SMART_READER_LITE
LIVE PREVIEW

Assuming rational parties and watchtowers - Will a party commit - - PowerPoint PPT Presentation

Assuming rational parties and watchtowers - Will a party commit fraud? - Will a watchtower get paid? - Will a party commit fraud? - Will a watchtower get paid? - Will a party commit fraud? ... Watchtowers Active Inactive Parties


slide-1
SLIDE 1
slide-2
SLIDE 2
slide-3
SLIDE 3

Assuming rational parties and watchtowers…

  • Will a party commit fraud?
  • Will a watchtower get paid?
  • Will a party commit fraud?
  • Will a watchtower get paid?
  • Will a party commit fraud? ...
slide-4
SLIDE 4

Watchtowers → Parties ↓ Active Inactive Fraud No Fraud

slide-5
SLIDE 5

Premiums

Watchtowers → Parties ↓ Active Inactive Fraud No Fraud

slide-6
SLIDE 6

Collateral

slide-7
SLIDE 7

a σB ai ai+1 bi+1 a b (σA⋀Δt)⋁σAB

Commitment (1)

Published by A

Funding

On-chain

Commitment (i)

Published by A

Commitment (i+1)

Published by A

Revocation

Published by B, W

σAB #σA #σB b a+b (σA⋀Δt)⋁σAB σB (σA⋀Δt)⋁σAB σB ai σAB bi σB

slide-8
SLIDE 8

a σBW #σW c ai bi ai+1 bi+1 a b (σA⋀Δt)⋁σAW

Commitment (1)

Published by A

Funding

On-chain

Collateral

On-chain

Commitment (i)

Published by A

Commitment (i+1)

Published by A

Revocation

Published by B, W

Penalty 1

Published by B

Reclaim

Published by W

σAB #σA #σB b a+b σBW (σA⋀Δt)⋁σAW σBW (σA⋀Δt)⋁σAW σB ai +bi σB c +bi σBW c σAW

slide-9
SLIDE 9

a (σB ⋀ Δt)⋁σBW #σW c ai bi ai+1 bi+1 a b (σA⋀Δt)⋁σAW

Commitment (1)

Published by A

Funding

On-chain

Collateral

On-chain

Commitment (i)

Published by A

Commitment (i+1)

Published by A

Revocation

Published by B, W

Penalty 1

Published by B

Reclaim

Published by W

σAB #σA #σB b a+b (σA⋀Δt)⋁σAW (σA⋀Δt)⋁σAW σB ai +bi σB c +bi σBW c σAW (σB⋀Δt)⋁σBW (σB⋀Δt)⋁σBW

σB⋀Δt

σBW

slide-10
SLIDE 10

a

σB⋀Δt

(σW⋀ΔΤ)⋁σBW (σB ⋀ Δt)⋁σBW #σW c ai bi ai+1 bi+1 a b c (σA⋀Δt)⋁σAW

Commitment (1)

Published by A

Funding

On-chain

Collateral

On-chain

Commitment (i)

Published by A

Commitment (i+1)

Published by A

Revocation

Published by B, W

Penalty 1

Published by B

Penalty 2

Published by B

Reclaim

Published by W

σAB #σA #σB b a+b (σB⋀Δt)⋁σBW (σA⋀Δt)⋁σAW (σB⋀Δt)⋁σBW (σA⋀Δt)⋁σAW σB ai +bi σB c +bi σB c +bi σBW c σBW

σB⋀Δt

σBW σAW

slide-11
SLIDE 11
slide-12
SLIDE 12

Funding Commitment Dispute period

slide-13
SLIDE 13

Funding Commitment Dispute period ➔ Eclipse ➔ Censor ➔ Congestion

slide-14
SLIDE 14
slide-15
SLIDE 15

A s y n c h r

  • n
  • u

s c h a n n e l s ?

slide-16
SLIDE 16
slide-17
SLIDE 17

Funding Close Signatures of Alice & Bob OR Signatures of ⅔ WT & (Alice or Bob)

slide-18
SLIDE 18

1) Consensus is costly 2) Privacy is important 3) Incentives are critical

slide-19
SLIDE 19

➔ O(n) communication complexity for state updates ➔ Verification of consensus between Alice & Bob ➔ No liveness guarantees, if Alice & Bob both misbehave ➔ Consensus needed only for closing, if there is a dispute

slide-20
SLIDE 20

H( ) H( )

➔ Privacy preserving ➔ Alice/Bob cannot publish a previous transaction

H( )

slide-21
SLIDE 21

H( ) H( )

(1) Update (2) Consistent Broadcast (2) Consistent Broadcast (3) Execute (3) Execute

H( )

slide-22
SLIDE 22
  • Unilateral channel for fees:

Repeated game lifts fair exchange impossibility

  • Fees for closing the channels:

Only payable in dispute → Incentive to agree

  • Collateral for anti-bribing:

Reduction to fair-exchange WT Committee size ↑ → per WT collateral ↓

slide-23
SLIDE 23
  • Asynchronous channels
  • Security even under L1 failure
  • Privacy
  • Incentive-compatible
  • Embarrassingly parallel
  • Linear communication

[Avarikioti et al. Brick: Asynchronous State Channels.]