• Corpus ID: 18681338


  author={Watson Ladd},
Bitcoin is [6] a peer-to-peer distributed currency system. Bitcoin attempts to provide anonymity to users by cycling keys [6] however such protection is of limited value. [8] In this paper I present a new means of forming transactions that prevents a sender of bitcoins from linking the public key of the reciever to a transaction, requiring only a single additional option for what 
A New Blind ECDSA Scheme for Bitcoin Transaction Anonymity
A new blind signature scheme is proposed that allows generating a blind signature compatible with the standard ECDSA and is built on a variant of the Paillier cryptosystem and its homomorphic properties.
Research on Anonymization and De-anonymization in the Bitcoin System
This paper studies anonymization and de-anonymization technologies and proposes some directions for further research.
A Survey on Anonymity and Privacy in Bitcoin-Like Digital Cash Systems
This survey presents guidelines for designing an anonymity/privacy improvement and discusses future research directions, and examines the studies in the literature/Web in two major categories: analyses of anonymity and privacy in Bitcoin and extensions and alternatives to Bitcoin, which improve anonymity and Privacy.
Xim: Distributed Match-and-Mix for Bitcoin
Xim is proposed: a complete decentralized mixing protocol that aims to minimize the losses of an honest participant if they interact with an adversary, and is effective in deterring denial-of-service, inference, and Sybil attacks.
Sybil-Resistant Mixing for Bitcoin
Xim is proposed, a two-party mixing protocol that is compatible with Bitcoin and related virtual currencies, and is the first decentralized protocol to simultaneously address Sybil attackers, denial-of-service attacks, and timing-based inference attacks.
Partially Blind ECDSA Scheme and Its Application to Bitcoin
This scheme is the first ECDSA-based partially blind signature scheme compatible with the current Bitcoin protocol and to the best of the knowledge, compared with other state-of-the-art schemes.
A Blind-Mixing Scheme for Bitcoin based on an Elliptic Curve Cryptography Blind Digital Signature Algorithm
A centralized coin-mixing algorithm based on an elliptic curve blind signature scheme (denoted as Blind-Mixing) that obstructs mixers from linking an input address with an output address and is determined that BlindCoin may be deanonymized because of its use of a public log.
Bitcoins and secure financial transaction processing, recent advances
  • Sidharth Quamara, A. Singh
  • Economics
    2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)
  • 2016
The current article discusses the security issues associated with the bitcoins based financial transaction processing system and various proposed research endeavors to combat them in recent years.
Bitcoin and Beyond: A Technical Survey on Decentralized Digital Currencies
This survey unroll and structure the manyfold results and research directions of Bitcoin, and deduce the fundamental structures and insights at the core of the Bitcoin protocol and its applications.


Bitcoin: A Peer-to-Peer Electronic Cash System
This work proposes a solution to the double-spending problem using a peer-to-peer network, where 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.
Untraceable Electronic Cash
An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 and receiving from the second party a note including a digital signature.
Efficient Proofs that a Committed Number Lies in an Interval
This paper presents a new proof, which is both efficient and exact, for proving that a committed number lies in a specific interval.
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.
Privacy-Preserving Set Operations
By building a framework of multiset operations, employing the mathematical properties of polynomials, this work designs efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations.
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
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.
E-mail address: watsonbladd@gmail.com
  • E-mail address: watsonbladd@gmail.com
Satochi's Client. https://github.com/bitcoin
  • Satochi's Client. https://github.com/bitcoin
Blind signatures with dsa/ecdsa?
  • Blind signatures with dsa/ecdsa?
  • 2004