Increasing Anonymity in Bitcoin

被引：33

作者：

Saxena, Amitabh ^{[1
]}

Misra, Janardan ^{[1
]}

Dhar, Aritra ^{[2
]}

机构：

[1] Accenture Technol Labs, Bangalore 560066, Karnataka, India

[2] Indraprastha Inst Informat Technol, New Delhi, India

来源：

FINANCIAL CRYPTOGRAPHY AND DATA SECURITY: FC 2014 WORKSHOPS, BITCOIN AND WAHC 2014 | 2014年 / 8438卷

关键词：

Bitcoin; Cryptocurrency; Aggregate signatures; Plausible deniability; Anonymity; SEQUENTIAL AGGREGATE SIGNATURES;

D O I：

10.1007/978-3-662-44774-1_9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Bitcoin prevents double-spending using the blockchain, a public ledger kept with every client. Every single transaction till date is present in this ledger. Due to this, true anonymity is not present in bitcoin. We present a method to enhance anonymity in bitcoin-type cryptocurrencies. In the blockchain, each block holds a list of transactions linking the sending and receiving addresses. In our modified protocol the transactions (and blocks) do not contain any such links. Using this, we obtain a far higher degree of anonymity. Our method uses a new primitive known as composite signatures. Our security is based on the hardness of the Computation Diffie-Hellman assumption in bilinear maps.

引用

页码：122 / 139

页数：18

共 25 条

[1]

Androulaki E., 2012, 2012596 CRYPT EPRINT

[2]

[Anonymous], LNCS

[3]

[Anonymous], BITCOIN PEER TO PEER

[4]

Bitcoin Developers, 2008, BITC CLIENT SOURC CO

[5]

Boldyreva A, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P276

[6]

Boneh D, 2003, LECT NOTES COMPUT SC, V2656, P416

[7]

Brogle K, 2012, LECT NOTES COMPUT SC, V7658, P644, DOI 10.1007/978-3-642-34961-4_39

[8] HARD KNAPSACK-PROBLEMS [J].

CHVATAL, V .

OPERATIONS RESEARCH, 1980, 28 (06) :1402-1411

[9]

Coron JS, 2003, LECT NOTES COMPUT SC, V2894, P392

[10]

Fischlin Marc, 2012, Security and Cryptography for Networks. Proceedings of the 8th International Conference (SCN 2012), P113, DOI 10.1007/978-3-642-32928-9_7

← 1 2 3 →