SN-10001 附来源、原文与上下文。
我准备发表一篇论文，其中引用了你的 Hashcash 论文，想确认引用格式是否正确。我目前写的是：
I'm getting ready to release a paper that references your Hashcash paper and I wanted to make sure I have the citation right. Here's what I have:
[5] A. Back，"Hashcash——一种拒绝服务攻击对策，" http://www.hashcash.org/papers/hashcash.pdf，2002。
[5] A. Back, "Hashcash - a denial of service counter-measure," http://www.hashcash.org/papers/hashcash.pdf, 2002.
我想你会觉得有意思，因为它为基于哈希的工作量证明找到了新用途，用它来实现电子现金。你可以在 http://www.upload.ae/file/6157/ecash-pdf.html 下载发表前的草稿。欢迎转发给其他你认为会感兴趣的人。我也快完成一个 C++ 实现了，准备以开源形式发布。
I think you would find it interesting, since it finds a new use for hash-based proof-of-work as a way to make e-cash work. You can download a pre-release draft at http://www.upload.ae/file/6157/ecash-pdf.html Feel free to forward it to anyone else you think would be interested. I'm also nearly finished with a C++ implementation to release as open source.
标题：无需可信第三方的电子现金
Title: Electronic Cash Without a Trusted Third Party
摘要：纯粹的点对点电子现金可以让一方直接向另一方发送在线支付，免去经过金融机构的负担。数字签名提供了部分解决方案，但如果仍然需要可信方来防止双重支付，主要好处就失去了。我们提出一种使用点对点网络解决双重支付问题的方案。网络将交易进行哈希运算，纳入一条持续延伸、基于哈希的工作量证明链，以此为交易加上时间戳，形成一份不重新完成工作量证明就无法更改的记录。最长链不仅证明了所见事件的先后顺序，也证明它来自最大的 CPU 算力集合。只要诚实节点控制着网络中最多的 CPU 算力，就能生成最长链并超过任何攻击者。网络本身只需要最基本的结构。消息尽力广播，节点可以随时离开并重新加入网络，接受最长工作量证明链，作为其离线期间所发生事件的证明。
Abstract: A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without the burdens of going through a financial institution. Digital signatures offer part of the solution, but the main benefits are lost if a trusted 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 honest nodes control the most CPU power on the network, they can generate the longest chain and outpace any attackers. The network itself requires minimal structure. Messages are broadcasted 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.
