• Corpus ID: 236214795

Bitcoin: A Peer-to-Peer Electronic Cash System

@inproceedings{Nakamoto2008BitcoinAP,
  title={Bitcoin: A Peer-to-Peer Electronic Cash System},
  author={Satoshi Nakamoto},
  year={2008}
}
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… 
Bitcoin Plus: Peer-to-Peer Crypto-Currency with Proof-of-Stake
TLDR
Under this hybrid design proof-of-work mainly provides initial minting and is largely non-essential in the long run thus providing an energy-efficient and more cost-competitive peer-to-peer crypto-currency.
qBitcoin: A Peer-to-Peer Quantum Cash System
  • Kazuki Ikeda
  • Computer Science
    Advances in Intelligent Systems and Computing
  • 2018
TLDR
A decentralized online quantum cash system, called qBitcoin, is given which has great benefits of quantization in the following sense: the double-spending problem never happens, its security is guaranteed theoretically by virtue of quantum information theory, and the system is based on a quantum chain, instead of blocks.
An Efficient Peer-to-Peer Bitcoin Protocol with Probabilistic Flooding
  • Huy Vu, H. Tewari
  • Computer Science
    Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
  • 2019
TLDR
This paper proposes a novel protocol that changes the current flooding protocol to a probabilistic flooding approach, which allows nodes to maintain certain probabilities of sending information to their neighbours, based on previous message exchanges between the nodes.
Hybrid Decentralized Solution for Bitcoin Zero-Confirmation Transactions
  • Prerna Arote, J. Kuri
  • Computer Science
    2019 11th International Conference on Communication Systems & Networks (COMSNETS)
  • 2019
TLDR
A protocol that offers freedom to do micropayment transaction with anyone as per the need without any prior knowledge about the parties is presented and gives an alternate secured path for zero-confirmation transactions.
Bitcoin-Compatible Virtual Channels
TLDR
This work presents the first virtual channel protocols that are built on the UTXO-model and require a scripting language supporting only a digital signature scheme and a timelock functionality, being thus backward compatible with virtually every cryptocurrency, including Bitcoin.
Bitcoin Cooperative Proof-of-Stake
TLDR
A hard-fork reconfiguration of the peer to peer Bitcoin network is described that substitutes tamper-evident logs and proof- of-stake consensus for proof-of-work consensus and enables the processing of numerous microtransactions.
An Analysis of Anonymity in the Bitcoin System
  • F. Reid, Martin Harrigan
  • Computer Science, Mathematics
    2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing
  • 2011
TLDR
It is shown that the two networks derived from Bitcoin's public transaction history have a non-trivial topological structure, provide complementary views of the Bit coin system and have implications for anonymity.
KopperCoin - A Distributed File Storage with Financial Incentives
TLDR
KopperCoin is a token system inspired by Bitcoin’s blockchain which can be integrated into a peer-to-peer file storage system and provides direct reward to participants contributing storage resources.
Short Paper: Secure Offline Payments in Bitcoin
TLDR
This paper took the opposite approach that the payee (not the wallets) verifies the legitimacy of preloaded coins at the time of offline payment, and shows that, with light-weight tamper-proof wallets, completely decentralized offline payment is possible without any modification to the existing Bitcoin network.
Deanonymisation of Clients in Bitcoin P2P Network
TLDR
This work presents an efficient method to deanonymize Bitcoin users, which allows to link user pseudonyms to the IP addresses where the transactions are generated and shows that a natural countermeasure of using Tor or other anonymity services can be cut-off by abusing anti-DoS countermeasures of the Bitcoin network.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 84 REFERENCES
Hashcash - A Denial of Service Counter-Measure
TLDR
This paper captures in one place the various applications, improvements suggested and related subsequent publications, and describes initial experience from experiments using hashcash.
Tangler: a censorship-resistant publishing system based on document entanglements
TLDR
The design of a censorship-resistant system that employs a unique document storage mechanism designed to eject non-compliant servers and prevent them from doing more harm than good is described.
Time-lock Puzzles and Timed-release Crypto
TLDR
There are two natural approaches to implementing timed-release crypto: Use ``time-lock puzzles''--computational problems that can not be solved without running a computer continuously for at least a certain amount of time, and use trusted agents who promise not to reveal certain information until a specified date.
Trusted distribution of software over the Internet
  • A. Rubin
  • Computer Science
    Proceedings of the Symposium on Network and Distributed System Security
  • 1995
TLDR
Bellcore's Trusted Software Integrity (Betsi) System, an implementation of the design, is presented and a detailed design is provided.
Self-certifying file system
TLDR
While other file systems need key management to map file names to encryption keys, SFS file names effectively contain public keys, making them self-certifying pathnames, making SFS more versatile than any file system with built-in key management.
Secure names for bit-strings
The increasing use of digital documents, and the need to refer to them conveniently and unambiguously, raise an important question: can one “name” a digital document in a way that conveniently
Collision Free Hash Functions and Public Key Signature Schemes
TLDR
The ability of a hash function to improve security and speed of a signature scheme is discussed: for example, it can combine the RSA-system with a collision free hash function based on factoring to get a scheme which is more efficient and much more secure.
One-Way Group Actions
TLDR
One-way group actions provides a unified theory for all the known bit commitment schemes that offer unconditional protection for the originator of the commitments, and for many of those that offer her statistical protection.
The Security of Cipher Block Chaining
TLDR
This work provides its first formal justification, showing the following general lemma: that cipher block chaining a pseudorandom function gives a Pseudo-Cipher Block Chaining function.
One-way functions are necessary and sufficient for secure signatures
  • J. Rompel
  • Computer Science, Mathematics
    STOC '90
  • 1990
TLDR
This paper is interested in signature schemes which are secure agMnst existential forgery under adaptive chosen message attacks, and the existence of trapdoor permutations can be shown to be necessary and sufficient for secure encryption schemes.
...
1
2
3
4
5
...