Increasing anonymity in bitcoin

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8438, Issue , 2014, Pages 122-139

  Saxena, Amitabh ^a   Misra, Janardan ^a   Dhar, Aritra ^b  

^a Accenture Services Pvt Ltd India   (India)

^b INDRAPRASTHA INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

Aggregate signatures; Anonymity; Bitcoin; Cryptocurrency; Plausible deniability

Indexed keywords

CRYPTOGRAPHY; NETWORK SECURITY;

AGGREGATE SIGNATURE; ANONYMITY; BITCOIN; CRYPTOCURRENCY; PLAUSIBLE DENIABILITY;

SECURITY OF DATA;

EID: 84910627417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44774-1_9     Document Type: Conference Paper

References (25)

1. Nakamoto, S.: Bitcoin: A Peer-to-Peer Electronic Cash System.
2. Martins, S., Yang, Y.: Introduction to bitcoins: a pseudo-anonymous electronic currency system. In: Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research, CASCON '11, Riverton, NJ, USA, pp. 349-350. IBM Corp. (2011).
3. Bitcoin Developers. Bitcoin client source code (github) (2008).
4. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416-432. Springer, Heidelberg (2003).
5. Coron, J.-S., Naccache, D.: Boneh et al. 's k-Element aggregate extraction assumption is equivalent to the diffie-hellman assumption. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 392-397. Springer, Heidelberg (2003).
6. Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential aggregate signatures from trapdoor permutations. In: Cachin, C., Camenisch, J. L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 74-90. Springer, Heidelberg (2004).
7. Zhu, H., Bao, F., Li, T., Wu, Y.: Sequential aggregate signatures for wireless routing protocols. In: 2005 IEEE Wireless Communications and Networking Conference, vol. 4, pp. 2436-2439 (2005).
8. Ma, D.: Practical forward secure sequential aggregate signatures. In: Abe, M., Gligor, V. D. (eds.), ASIACCS, pp. 341-352. ACM (2008).
9. Boldyreva, A., Gentry, C., O'Neill, A., Yum, D. H.: Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. In: CCS '07: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 276-285. ACM, New York (2007).
10. Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential aggregate signatures and multisignatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 465-485. Springer, Heidelberg (2006).
11. Fischlin, M., Lehmann, A., Schröder, D.: History-free sequential aggregate signatures. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 113-130. Springer, Heidelberg (2012).
12. Brogle, K., Goldberg, S., Reyzin, L.: Sequential aggregate signatures with lazy verification from trapdoor permutations. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 644-662. Springer, Heidelberg (2012).
13. Androulaki, E., Karame, G., Roeschlin, M., Scherer, T., Capkun, S.: Evaluating user privacy in bitcoin. Cryptology ePrint Archive, Report 2012/596 (2012).
14. Reid, F., Harrigan, M.: An analysis of anonymity in the bitcoin system. In: Altshuler, Y., Elovici, Y., Cremers, A. B., Aharony, N., Pentland, A. (eds.) Security and Privacy in Social Networks, pp. 197-223. Springer, New York (2013).
15. Ron, D., Shamir, A.: Quantitative analysis of the full bitcoin transaction graph. Cryptology ePrint Archive, Report 2012/584 (2012). http://eprint. iacr. org/.
16. Zerocoin: Anonymous distributed e-cash from bitcoin (2012).
17. Maxwell, G.: Coinjoin: Bitcoin privacy for the real world (2013).
18. Pisinger, D.: Where are the hard knapsack problems. Comput. Oper. Res. 32, 2271-2284 (2005).
19. Chvatal, V.: Hard knapsack problems. Oper. Res. 28(6), 1402-1411 (1980).
20. Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient oneway functions. Comput. Complex. 16(4), 365-411 (2007). (Prelim. In: FOCS 2002).
21. Miller, V. S.: The Weil pairing, and its efficient calculation. J. Cryptology 17(4), 235-261 (2004).
22. Uchida, Y., Uchiyama, S.: The tate-lichtenbaum pairing on a hyperelliptic curve via hyperelliptic nets. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 218-233. Springer, Heidelberg (2013).
23. Hess, F., Smart, N. P., Vercauteren, F.: The Eta pairing revisited. IEEE Trans. Inf. Theor. 52(10), 4595-4602 (2006).
24. T pairing. In: Ryan, M. D., Smyth, B., Wang, G. (eds.) ISPEC 2012. LNCS, vol. 7232, pp. 228-244. Springer, Heidelberg (2012).
25. Scott, M.: Scaling security in pairing-based protocols. IACR Cryptology ePrint Archive 2005, 139 (2005).