188宝金博页面版

  • 图案背景
  • 纯色背景
视图
标记
批注
批注本地保存成功，开通会员云端永久保存 去开通
dredger

上传于：2015-01-01

粉丝量：174

该文档贡献者很忙，什么也没留下。


  • 相关
  • 目录
  • 笔记
  • 书签

188宝金博页面版:更多相关文档

  • A Peer-to-Peer Electronic Cash System

    星级： 9 页

  • 1bitcoin a P2P electronic Cash System

    星级： 9 页

  • a survey of electronic cash,

    星级： 110 页

  • Electronic Cash

    星级： 33 页

  • electronic cash

    星级： 55 页

  • cash讲义(a卷)

    星级： 6 页

  • electronic cash and set

    星级： 14 页

  • ELECTRONIC CASH AND SET

    星级： 14 页

  • A Taxonomy of Electronic Cash Schemes

    星级： 12 页

  • Petty Cash System

    星级： 2 页

  • cash講義.doc(A卷).doc

    星级： 6 页

  • Cash Flow S.A.

    星级： 1 页

  • BitcoinA A Peer-to-Peer Electronic Cash System英文版教材电子版下载

    星级： 6 页

  • netcard - a practical electronic cash system

    星级： 9 页

  • NetCard - A practical electronic cash system

    星级： 9 页

暂无目录

点击鼠标右键菜单,创建目录

    暂无笔记

    选择文本，点击鼠标右键菜单，添加笔记

    暂无书签

    在左侧文档中，点击鼠标右键，添加书签

    188宝金博页面版: 1-bitcoin - a P2P electronic Cash System

    下载积分： 10

    内容提示： Bitcoin: A Peer-to-Peer Electronic Cash SystemSatoshi Nakamotosatoshin@gmx.comwww.bitcoin.orgAbstract. A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. Th...

    文档格式：PDF | 页数：9 | 浏览次数：16 | 上传日期：2015-01-01 15:55:10 | 文档星级：
    Bitcoin: A Peer-to-Peer Electronic Cash SystemSatoshi Nakamotosatoshin@gmx.comwww.bitcoin.orgAbstract. A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.1.IntroductionCommerce on the Internet has come to rely almost exclusively on financial institutions serving as trusted third parties to process electronic payments. While the system works well enough for most transactions, it still suffers from the inherent weaknesses of the trust based model. Completely non-reversible transactions are not really possible, since financial institutions cannot avoid mediating disputes. The cost of mediation increases transaction costs, limiting the minimum practical transaction size and cutting off the possibility for small casual transactions, and there is a broader cost in the loss of ability to make non-reversible payments for non-reversible services. With the possibility of reversal, the need for trust spreads. Merchants must be wary of their customers, hassling them for more information than they would otherwise need. A certain percentage of fraud is accepted as unavoidable. These costs and payment uncertainties can be avoided in person by using physical currency, but no mechanism exists to make payments over a communications channel without a trusted party.What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers. In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.1

    阅读了该文档的用户还阅读了这些文档

    188宝金博页面版:关于我们

    188宝金博页面版:帮助中心

    188宝金博页面版:关注我们

    • 新浪微博

    关注188宝金博页面版公众号

    188宝金博页面版
    阅读
    APP
    阅读
    返回
    顶部
    188宝金博页面版官网登录在线平台入口（2026已更新）—江苏协昌电子科技股份有限公司