Combating Double-Spending Using Cooperative P2P Systems

@article{Osipkov2007CombatingDU,
  title={Combating Double-Spending Using Cooperative P2P Systems},
  author={Ivan Osipkov and Eugene Y. Vasserman and N. Hopper and Yongdae Kim},
  journal={27th International Conference on Distributed Computing Systems (ICDCS '07)},
  year={2007},
  pages={41-41}
}
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that the broker cannot link spent coins to the user who withdraws them. A variety of schemes with various security properties have been proposed for this purpose, but because strings of bits are inherently copyable, they must all deal with the problem of double-spending. In this paper, we present an electronic cash scheme… Expand
Privacy and Cryptocurrencies—A Systematic Literature Review
TLDR
This work presents the development of digital money from electronic cash to cryptocurrencies and focuses on the techniques that are employed to enhance user-privacy, and presents flaws of the current cryptocurrency systems, which reduce the privacy of the cryptocurrency users. Expand
Distributed architectures for electronic cash schemes: a survey
TLDR
This paper identifies and analyse the different distributed architectural styles underlying existing e-cash schemes and discusses the strengths and limitations of these architectures with respect to fundamental system distribution criteria, and makes some recommendations for designing effective distributed e- cash systems from an architectural perspective. Expand
Double Spending Protection for E-Cash Based on Risk Management
TLDR
This paper proposes a risk management approach for double spending protection which allows suitable tradeoffs between efficiency and effectiveness and involves using the service of a trader, who is a trusted third party that will cover the risk involved in offline payment transactions, against some remuneration. Expand
A novel double spending attack countermeasure in blockchain
  • Kervins Nicolas, Yi Wang
  • Computer Science
  • 2019 IEEE 10th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)
  • 2019
TLDR
The MSP (Multistage Secure Pool) framework was proposed in order to address the vulnerabilities on the blockchain and shows that there was a decrease in the amount of attacks propagating through the system based on the system's robustness and capabilities. Expand
PPAB: A Privacy-Preserving Authentication and Billing Architecture for Metropolitan Area Sharing Networks
TLDR
It is shown that the proposed authentication and billing architecture can support localized inter-WISP authentication through the divisible blind signature scheme and a local witness strategy and a detailed analysis on a number of performance metrics is given to validate the performance of the proposed architectures. Expand
Disincentivizing Double Spend Attacks Across Interoperable Blockchains
  • Kuheli Sai, D. Tipper
  • Computer Science
  • 2019 First IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA)
  • 2019
TLDR
It is shown that the observers, can detect double spending, while remaining honest to the protocol as it is more profitable to them than colluding due to the proposed disincentivization scheme and its cost-effectiveness. Expand
Private and censorship-resistant communication over public networks
TLDR
A new game theoretic model of the problem of encouraging cooperation between selfish actors under conditions of scarcity is presented, and a strategy for the game that provides rational incentives for cooperation under a wide range of conditions is developed. Expand
Comprehensive Overview of Selfish Mining and Double Spending Attack Countermeasures
TLDR
This survey is organized around the aspects pertaining to countermeasures of selfish mining and double spending attacks, and aims to identify implications of these countermeasures to address vulnerabilities in the blockchain network for future research on this topic. Expand
On PAR for Attack
In The Onion Router (TOR) system, anonymity is provided by router services run by TOR users who volunteer their computational resources. Scalability concerns stem from the TOR design becauseExpand
Sovereign Digital Currency System with Decentralized Infrastructure
In this paper, we consider the concept of a 1-tier national monetary system based on a digital sovereign currency issued by a central bank. In contrast to the approach, based on a centralizedExpand
...
1
2
3
4
...

References

SHOWING 1-10 OF 51 REFERENCES
Compact E-Cash
TLDR
This paper presents efficient off-line anonymous e-cash schemes where a user can withdraw a wallet containing 2 coins each of which she can spend unlinkably, and offers exculpability of users, that is, the bank can prove to third parties that a user has double-spent. Expand
An Efficient Micropayment System Based on Probabilistic Polling
TLDR
A new hybrid scheme is proposed that combines the advantages of both of the above traditional design strategies and allows for control of overspending at a cost of only a modest increase in communication compared to the off-line schemes. Expand
WhoPay: A Scalable and Anonymous Payment System for Peer-to-Peer Environments
TLDR
This basic version of WhoPay is as secure and scalable as existing peer-to-peer payment schemes, while providing a much higher level of user anonymity and the idea of real-time double spending detection is introduced. Expand
The Millicent Protocols for Electronic Commerce
  • M. Manasse
  • Business, Computer Science
  • USENIX Workshop on Electronic Commerce
  • 1995
TLDR
Many protocols have been proposed in the last year which address the problem of securely transferring money over a public network, to enable transactions with properties similar to those achievable today using credit cards, to provide consumers and vendors with guarantees imilar to those afforded by credit cards or to translate existing payment mechanisms into electronic equivalents. Expand
NetCard - A Practical Electronic-Cash System
TLDR
This work has shown how the recursive hashing technique can be used in simple payment schemes based on both the smartcard and the online processing models of electronic commerce, and can also provide some novel and valuable features, such as a security recovery facility that does not depend on either the legacy systems or the SET protocols. Expand
Untraceable Oo-line Cash in Wallets with Observers
Incorporating the property of untraceability of payments into oo-line electronic cash systems has turned out to be no easy matter. Two key concepts have been proposed in order to attain the sameExpand
Mis-representation of Identities in E-cash Schemes and how to Prevent it
TLDR
It is demonstrated one efficient attack on Okamoto's scheme and two on Brands' scheme which allow users to mis-represent their identities and double-spend in an undetectable manner, hence defeating the most essential security aspect of the schemes. Expand
How to Date Blind Signatures
TLDR
It is proved that forging the proposed scheme by multiple signing is as difficult as breaking RSA and an electronic cash system is shown that successfully minimizes the growth of the bank's database. Expand
Micropayments via Efficient Coin-Flipping
TLDR
An authenticated coin-flipping protocol and its proof of security are presented and it is demonstrated the applicability of the scheme for online randomized micro-payment protocols. Expand
Random oracles are practical: a paradigm for designing efficient protocols
TLDR
It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. Expand
...
1
2
3
4
5
...