Peer-To-Peer Affine Commitment Using Bitcoin

PLDI(2015)

引用 37|浏览22
暂无评分
摘要
The power of linear and affine logic lies in their ability to model state change. However, in a trustless, peer-to-peer setting, it is difficult to force principals to commit to state changes. We show how to solve the peer-to-peer affine commitment problem using a generalization of Bitcoin in which transactions deal in types rather than numbers. This has applications to proof-carrying authorization and mechanically executable contracts. Importantly, our system can be-and is-implemented on top of the existing Bitcoin network, so there is no need to recruit computing power to a new protocol.
更多
查看译文
关键词
Proof-carrying authorization,cryptocurrencies,distributed systems
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要