{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T00:37:30Z","timestamp":1726187850754},"reference-count":65,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"1","license":[{"start":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T00:00:00Z","timestamp":1637366400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose a new theoretical approach for building anonymous mixing mechanisms for cryptocurrencies. Rather than requiring a fully uniform permutation during mixing, we relax the requirement, insisting only that neighboring permutations are similarly likely. This is defined formally by borrowing from the definition of differential privacy. This relaxed privacy definition allows us to greatly reduce the amount of interaction and computation in the mixing protocol. Our construction achieves<jats:italic>O<\/jats:italic>(<jats:italic>n\u00b7<\/jats:italic>polylog(<jats:italic>n<\/jats:italic>)) computation time for mixing<jats:italic>n<\/jats:italic>addresses, whereas all other mixing schemes require<jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>2<\/jats:sup>) total computation across all parties. Additionally, we support a smooth tolerance of fail-stop adversaries and do not require any trusted setup. We analyze the security of our generic protocol under the UC framework, and under a stand-alone, game-based definition. We finally describe an instantiation using ring signatures and confidential transactions.<\/jats:p>","DOI":"10.2478\/popets-2022-0004","type":"journal-article","created":{"date-parts":[[2021,11,21]],"date-time":"2021-11-21T02:41:33Z","timestamp":1637462493000},"page":"49-74","source":"Crossref","is-referenced-by-count":0,"title":["(\u2208, \u03b4)-Indistinguishable Mixing for Cryptocurrencies"],"prefix":"10.56553","volume":"2022","author":[{"given":"Mingyu","family":"Liang","sequence":"first","affiliation":[{"name":"George Mason University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioanna","family":"Karantaidou","sequence":"additional","affiliation":[{"name":"George Mason University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Foteini","family":"Baldimtsi","sequence":"additional","affiliation":[{"name":"George Mason University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Dov","family":"Gordon","sequence":"additional","affiliation":[{"name":"George Mason University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayank","family":"Varia","sequence":"additional","affiliation":[{"name":"Boston University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"35752","published-online":{"date-parts":[[2021,11,20]]},"reference":[{"key":"2022062314360580927_j_popets-2022-0004_ref_001","doi-asserted-by":"crossref","unstructured":"[1] Masayuki Abe. Mix-networks on permutation networks. In Kwok-Yan Lam, Eiji Okamoto, and Chaoping Xing, editors, Advances in Cryptology \u2013 ASIACRYPT\u201999, volume 1716 of Lecture Notes in Computer Science, pages 258\u2013273, Singapore, November 14\u201318, 1999. Springer, Heidelberg, Germany.10.1007\/978-3-540-48000-6_21","DOI":"10.1007\/978-3-540-48000-6_21"},{"key":"2022062314360580927_j_popets-2022-0004_ref_002","doi-asserted-by":"crossref","unstructured":"[2] Elli Androulaki, Ghassan Karame, Marc Roeschlin, Tobias Scherer, and Srdjan Capkun. Evaluating user privacy in bitcoin. In FC, 2013.10.1007\/978-3-642-39884-1_4","DOI":"10.1007\/978-3-642-39884-1_4"},{"key":"2022062314360580927_j_popets-2022-0004_ref_003","doi-asserted-by":"crossref","unstructured":"[3] Michael Backes, Praveen Manoharan, and Esfandiar Mohammadi. TUC: time-sensitive and modular analysis of anonymous communication. In CSF, 2014.10.1109\/CSF.2014.34","DOI":"10.1109\/CSF.2014.34"},{"key":"2022062314360580927_j_popets-2022-0004_ref_004","doi-asserted-by":"crossref","unstructured":"[4] Christian Badertscher, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas. Bitcoin as a transaction ledger: A composable treatment. In CRYPTO, 2017.10.1007\/978-3-319-63688-7_11","DOI":"10.1007\/978-3-319-63688-7_11"},{"key":"2022062314360580927_j_popets-2022-0004_ref_005","unstructured":"[5] Amos Beimel, Kobbi Nissim, and Mohammad Zaheri. Exploring differential obliviousness. CoRR, abs\/1905.01373, 2019."},{"key":"2022062314360580927_j_popets-2022-0004_ref_006","unstructured":"[6] Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. Scalable, transparent, and post-quantum secure computational integrity. IACR ePrint, 2018."},{"key":"2022062314360580927_j_popets-2022-0004_ref_007","doi-asserted-by":"crossref","unstructured":"[7] Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, and Madars Virza. Zerocash: Decentralized anonymous payments from bitcoin. In IEEE-SP, 2014.10.1109\/SP.2014.36","DOI":"10.1109\/SP.2014.36"},{"key":"2022062314360580927_j_popets-2022-0004_ref_008","doi-asserted-by":"crossref","unstructured":"[8] Alex Biryukov and Sergei Tikhomirov. Deanonymization and linkability of cryptocurrency transactions based on network analysis. In EuroS&P, 2019.10.1109\/EuroSP.2019.00022","DOI":"10.1109\/EuroSP.2019.00022"},{"key":"2022062314360580927_j_popets-2022-0004_ref_009","doi-asserted-by":"crossref","unstructured":"[9] Joseph Bonneau, Arvind Narayanan, Andrew Miller, Jeremy Clark, Joshua A. Kroll, and Edward W. Felten. Mixcoin: Anonymity for bitcoin with accountable mixes. In FC, 2014.10.1007\/978-3-662-45472-5_31","DOI":"10.1007\/978-3-662-45472-5_31"},{"key":"2022062314360580927_j_popets-2022-0004_ref_010","doi-asserted-by":"crossref","unstructured":"[10] Elette Boyle, Saleet Klein, Alon Rosen, and Gil Segev. Securing abe\u2019s mix-net against malicious verifiers via witness indistinguishability. In Dario Catalano and Roberto De Prisco, editors, SCN 18: 11th International Conference on Security in Communication Networks, volume 11035 of Lecture Notes in Computer Science, pages 274\u2013291, Amalfi, Italy, September 5\u20137, 2018. Springer, Heidelberg, Germany.10.1007\/978-3-319-98113-0_15","DOI":"10.1007\/978-3-319-98113-0_15"},{"key":"2022062314360580927_j_popets-2022-0004_ref_011","doi-asserted-by":"crossref","unstructured":"[11] Benedikt B\u00fcnz, Shashank Agrawal, Mahdi Zamani, and Dan Boneh. Zether: Towards privacy in a smart contract world. In International Conference on Financial Cryptography and Data Security, pages 423\u2013443. Springer, 2020.10.1007\/978-3-030-51280-4_23","DOI":"10.1007\/978-3-030-51280-4_23"},{"key":"2022062314360580927_j_popets-2022-0004_ref_012","doi-asserted-by":"crossref","unstructured":"[12] Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell. Bulletproofs: Short proofs for confidential transactions and more. In IEEE-SP, 2018.10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"2022062314360580927_j_popets-2022-0004_ref_013","unstructured":"[13] Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067, 2000. http:\/\/eprint.iacr.org\/2000\/067."},{"key":"2022062314360580927_j_popets-2022-0004_ref_014","unstructured":"[14] Ran Canetti. Universally composable signature, certification, and authentication. In CSFW-17, 2004."},{"key":"2022062314360580927_j_popets-2022-0004_ref_015","doi-asserted-by":"crossref","unstructured":"[15] Ran Canetti, Yevgeniy Dodis, Rafael Pass, and Shabsi Walfish. Universally composable security with global setup. In Salil P. Vadhan, editor, TCC 2007: 4th Theory of Cryptography Conference, volume 4392 of Lecture Notes in Computer Science, pages 61\u201385, Amsterdam, The Netherlands, February 21\u201324, 2007. Springer, Heidelberg, Germany.10.1007\/978-3-540-70936-7_4","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"2022062314360580927_j_popets-2022-0004_ref_016","doi-asserted-by":"crossref","unstructured":"[16] Ran Canetti, Kyle Hogan, Aanchal Malhotra, and Mayank Varia. A universally composable treatment of network time. In CSF, 2017.10.1109\/CSF.2017.38","DOI":"10.1109\/CSF.2017.38"},{"key":"2022062314360580927_j_popets-2022-0004_ref_017","doi-asserted-by":"crossref","unstructured":"[17] Ran Canetti, Daniel Shahaf, and Margarita Vald. Universally composable authentication and key-exchange with global PKI. In PKC, pages 265\u2013296, 2016.10.1007\/978-3-662-49387-8_11","DOI":"10.1007\/978-3-662-49387-8_11"},{"key":"2022062314360580927_j_popets-2022-0004_ref_018","unstructured":"[18] T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, and Elaine Shi. Foundations of differentially oblivious algorithms. In SODA, 2019."},{"key":"2022062314360580927_j_popets-2022-0004_ref_019","doi-asserted-by":"crossref","unstructured":"[19] David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology, 1:65\u201375, 1988.","DOI":"10.1007\/BF00206326"},{"key":"2022062314360580927_j_popets-2022-0004_ref_020","unstructured":"[20] Coinmarketcap https:\/\/coinmarketcap.com\/. Accessed 2\/25\/2021."},{"key":"2022062314360580927_j_popets-2022-0004_ref_021","unstructured":"[21] Adrian Zmudzinski (Cointelegraph). Chainalysis rolls out real-time threat detector for 15 major cryptos), 2019. Accessed 9\/23\/2020."},{"key":"2022062314360580927_j_popets-2022-0004_ref_022","unstructured":"[22] Joshua Mapperson (Cointelegraph). Understanding litecoin\u2019s dusting attack: What happened and why), 2019. Accessed 9\/23\/2020."},{"key":"2022062314360580927_j_popets-2022-0004_ref_023","doi-asserted-by":"crossref","unstructured":"[23] Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In Shai Halevi and Tal Rabin, editors, TCC 2006: 3rd Theory of Cryptography Conference, volume 3876 of Lecture Notes in Computer Science, pages 265\u2013284, New York, NY, USA, March 4\u20137, 2006. Springer, Heidelberg, Germany.10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"2022062314360580927_j_popets-2022-0004_ref_024","doi-asserted-by":"crossref","unstructured":"[24] Cynthia Dwork and Aaron Roth. The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci., 9:211\u2013407, August 2014.10.1561\/0400000042","DOI":"10.1561\/0400000042"},{"key":"2022062314360580927_j_popets-2022-0004_ref_025","doi-asserted-by":"crossref","unstructured":"[25] Prastudy Fauzi, Sarah Meiklejohn, Rebekah Mercer, and Claudio Orlandi. Quisquis: A new design for anonymous cryptocurrencies. In Asiacrypt, 2019.10.1007\/978-3-030-34578-5_23","DOI":"10.1007\/978-3-030-34578-5_23"},{"key":"2022062314360580927_j_popets-2022-0004_ref_026","doi-asserted-by":"crossref","unstructured":"[26] Steven Goldfeder, Harry A. Kalodner, Dillon Reisman, and Arvind Narayanan. When the cookie meets the blockchain: Privacy risks of web payments via cryptocurrencies. Proc. Priv. Enhancing Technol., 2018(4):179\u2013199, 2018.","DOI":"10.1515\/popets-2018-0038"},{"key":"2022062314360580927_j_popets-2022-0004_ref_027","unstructured":"[27] Brandon Goodell, Sarang Noether, and RandomRun. Concise linkable ring signatures and forgery against adversarial keys. Cryptology ePrint Archive, Report 2019\/654, 2019. https:\/\/eprint.iacr.org\/2019\/654."},{"key":"2022062314360580927_j_popets-2022-0004_ref_028","doi-asserted-by":"crossref","unstructured":"[28] Jens Groth. On the size of pairing-based non-interactive arguments. In Eurocrypt, pages 305\u2013326. Springer, 2016.10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"2022062314360580927_j_popets-2022-0004_ref_029","unstructured":"[29] Andrey Gubichev. Online-routing on the butterfly network: probabilistic analysis, 2008. Accessed 9\/26\/2020."},{"key":"2022062314360580927_j_popets-2022-0004_ref_030","doi-asserted-by":"crossref","unstructured":"[30] Xi He, Ashwin Machanavajjhala, Cheryl J. Flynn, and Divesh Srivastava. Composing differential privacy and secure computation: A case study on scaling private record linkage. In Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, editors, ACM CCS 2017: 24th Conference on Computer and Communications Security, pages 1389\u20131406, Dallas, TX, USA, October 31 \u2013 November 2, 2017. ACM Press.","DOI":"10.1145\/3133956.3134030"},{"key":"2022062314360580927_j_popets-2022-0004_ref_031","doi-asserted-by":"crossref","unstructured":"[31] Ethan Heilman, Leen Alshenibr, Foteini Baldimtsi, Alessandra Scafuro, and Sharon Goldberg. Tumblebit: An untrusted bitcoin-compatible anonymous payment hub. In NDSS, 2017.10.14722\/ndss.2017.23086","DOI":"10.14722\/ndss.2017.23086"},{"key":"2022062314360580927_j_popets-2022-0004_ref_032","unstructured":"[32] Shiva Prasad Kasiviswanathan and Adam D. Smith. A note on differential privacy: Defining resistance to arbitrary side information. CoRR, abs\/0803.3946, 2008."},{"key":"2022062314360580927_j_popets-2022-0004_ref_033","doi-asserted-by":"crossref","unstructured":"[33] Jonathan Katz, Ueli Maurer, Bj\u00f6rn Tackmann, and Vassilis Zikas. Universally composable synchronous computation. In TCC, 2013.10.1007\/978-3-642-36594-2_27","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"2022062314360580927_j_popets-2022-0004_ref_034","unstructured":"[34] Georgios Kellaris, George Kollios, Kobbi Nissim, and Adam O\u2019Neill. Accessing data while preserving privacy. CoRR, abs\/1706.01552, 2017."},{"key":"2022062314360580927_j_popets-2022-0004_ref_035","doi-asserted-by":"crossref","unstructured":"[35] Aggelos Kiayias, Hong-Sheng Zhou, and Vassilis Zikas. Fair and robust multi-party computation using a global transaction ledger. In EUROCRYPT, 2016.10.1007\/978-3-662-49896-5_25","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"2022062314360580927_j_popets-2022-0004_ref_036","unstructured":"[36] Robin Klusman and Tim Dijkhuizen. Deanonymisation in ethereum using existing methods for bitcoin, 2018. Technical Report, https:\/\/delaat.net\/rp\/2017-2018\/p61\/report.pdf."},{"key":"2022062314360580927_j_popets-2022-0004_ref_037","unstructured":"[37] Russell WF Lai, Viktoria Ronge, Tim Ruffing, Dominique Schr\u00f6der, Sri Aravinda Krishnan Thyagarajan, and Jiafan Wang. Omniring: Scaling up private payments without trusted setup. IACR Cryptology ePrint Archive, 2019:580, 2019."},{"key":"2022062314360580927_j_popets-2022-0004_ref_038","unstructured":"[38] David Lazar, Yossi Gilad, and Nickolai Zeldovich. Karaoke: Distributed private messaging immune to passive traffic analysis. In USENIX, 2018."},{"key":"2022062314360580927_j_popets-2022-0004_ref_039","doi-asserted-by":"crossref","unstructured":"[39] Mary Maller, Sean Bowe, Markulf Kohlweiss, and Sarah Meiklejohn. Sonic: Zero-knowledge snarks from linear-size universal and updateable structured reference strings. IACR Cryptology ePrint Archive, 2019:99, 2019.","DOI":"10.1145\/3319535.3339817"},{"key":"2022062314360580927_j_popets-2022-0004_ref_040","doi-asserted-by":"crossref","unstructured":"[40] Felix Konstantin Maurer, Till Neudecker, and Martin Florian. Anonymous coinjoin transactions with arbitrary values. In 2017 IEEE Trustcom\/BigDataSE\/ICESS, pages 522\u2013529. IEEE, 2017.","DOI":"10.1109\/Trustcom\/BigDataSE\/ICESS.2017.280"},{"key":"2022062314360580927_j_popets-2022-0004_ref_041","doi-asserted-by":"crossref","unstructured":"[41] Sahar Mazloom and S. Dov Gordon. Secure computation with differentially private access patterns. In ACM-CCS, 2018.10.1145\/3243734.3243851","DOI":"10.1145\/3243734.3243851"},{"key":"2022062314360580927_j_popets-2022-0004_ref_042","doi-asserted-by":"crossref","unstructured":"[42] Sarah Meiklejohn, Marjori Pomarole, Grant Jordan, Kirill Levchenko, Damon McCoy, Geoffrey M. Voelker, and Stefan Savage. A fistful of bitcoins: characterizing payments among men with no names. In IMC, 2013.10.1145\/2504730.2504747","DOI":"10.1145\/2504730.2504747"},{"key":"2022062314360580927_j_popets-2022-0004_ref_043","unstructured":"[43] Monero, https:\/\/getmonero.org\/home. Accessed 2\/25\/2021."},{"key":"2022062314360580927_j_popets-2022-0004_ref_044","doi-asserted-by":"crossref","unstructured":"[44] Pedro Moreno-Sanchez, Tim Ruffing, and Aniket Kate. Pathshuffle: Credit mixing and anonymous payments for ripple. PoPETS, 2017.10.1515\/popets-2017-0031","DOI":"10.1515\/popets-2017-0031"},{"key":"2022062314360580927_j_popets-2022-0004_ref_045","doi-asserted-by":"crossref","unstructured":"[45] Pedro Moreno-Sanchez, Muhammad Bilal Zafar, and Aniket Kate. Listening to whispers of ripple: Linking wallets and deanonymizing transactions in the ripple network. PoPETs, 2016(4):436\u2013453, 2016.","DOI":"10.1515\/popets-2016-0049"},{"key":"2022062314360580927_j_popets-2022-0004_ref_046","doi-asserted-by":"crossref","unstructured":"[46] Malte M\u00f6ser, Kyle Soska, Ethan Heilman, Kevin Lee, Henry Heffan, Shashvat Srivastava, Kyle Hogan, Jason Hennessey, Andrew Miller, Arvind Narayanan, and Nicolas Christin. An empirical analysis of traceability in the monero blockchain. PoPETs, 2018(3):143\u2013163, 2018.10.1515\/popets-2018-0025","DOI":"10.1515\/popets-2018-0025"},{"key":"2022062314360580927_j_popets-2022-0004_ref_047","doi-asserted-by":"crossref","unstructured":"[47] Mahnush Movahedi, Jared Saia, and Mahdi Zamani. Secure multi-party shuffling. In Christian Scheideler, editor, Structural Information and Communication Complexity, pages 459\u2013473, Cham, 2015. Springer International Publishing.10.1007\/978-3-319-25258-2_32","DOI":"10.1007\/978-3-319-25258-2_32"},{"key":"2022062314360580927_j_popets-2022-0004_ref_048","unstructured":"[48] Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review, page 21260, 2008."},{"key":"2022062314360580927_j_popets-2022-0004_ref_049","doi-asserted-by":"crossref","unstructured":"[49] Sarang Noether and Brandon Goodell. Triptych: Logarithmic-sized linkable ring signatures with applications. In Joaquin Garcia-Alfaro, Guillermo Navarro-Arribas, and Jordi Herrera-Joancomarti, editors, Data Privacy Management, Cryptocurrencies and Blockchain Technology, pages 337\u2013354, Cham, 2020. Springer International Publishing.10.1007\/978-3-030-66172-4_22","DOI":"10.1007\/978-3-030-66172-4_22"},{"key":"2022062314360580927_j_popets-2022-0004_ref_050","doi-asserted-by":"crossref","unstructured":"[50] Shen Noether, Adam Mackenzie, et al. Ring confidential transactions. Ledger, 1:1\u201318, 2016.10.5195\/ledger.2016.34","DOI":"10.5195\/ledger.2016.34"},{"key":"2022062314360580927_j_popets-2022-0004_ref_051","doi-asserted-by":"crossref","unstructured":"[51] Ronald L. Rivest, Adi Shamir, and Yael Tauman. How to leak a secret. In ASIACRYPT, 2001.10.1007\/3-540-45682-1_32","DOI":"10.1007\/3-540-45682-1_32"},{"key":"2022062314360580927_j_popets-2022-0004_ref_052","doi-asserted-by":"crossref","unstructured":"[52] Dorit Ron and Adi Shamir. Quantitative analysis of the full bitcoin transaction graph. In FC. Springer, 2013.10.1007\/978-3-642-39884-1_2","DOI":"10.1007\/978-3-642-39884-1_2"},{"key":"2022062314360580927_j_popets-2022-0004_ref_053","doi-asserted-by":"crossref","unstructured":"[53] Tim Ruffing, Pedro Moreno-Sanchez, and Aniket Kate. Coinshuffle: Practical decentralized coin mixing for bitcoin. In ESORICS, 2014.10.1007\/978-3-319-11212-1_20","DOI":"10.1007\/978-3-319-11212-1_20"},{"key":"2022062314360580927_j_popets-2022-0004_ref_054","doi-asserted-by":"crossref","unstructured":"[54] Tim Ruffing, Pedro Moreno-Sanchez, and Aniket Kate. P2P mixing and unlinkable bitcoin transactions. In NDSS, 2017.10.14722\/ndss.2017.23415","DOI":"10.14722\/ndss.2017.23415"},{"key":"2022062314360580927_j_popets-2022-0004_ref_055","doi-asserted-by":"crossref","unstructured":"[55] Amitabh Saxena, Janardan Misra, and Aritra Dhar. Increasing anonymity in bitcoin. In FC, pages 122\u2013139. Springer, 2014.10.1007\/978-3-662-44774-1_9","DOI":"10.1007\/978-3-662-44774-1_9"},{"key":"2022062314360580927_j_popets-2022-0004_ref_056","unstructured":"[56] Various sources (Coin Metrics). Average number of daily cryptocurrency transactions in 1st quarter of 2019, by type (in thousand transactions), 2019. Accessed 9\/23\/2020."},{"key":"2022062314360580927_j_popets-2022-0004_ref_057","doi-asserted-by":"crossref","unstructured":"[57] Nirvan Tyagi, Yossi Gilad, Derek Leung, Matei Zaharia, and Nickolai Zeldovich. Stadium: A distributed metadata-private messaging system. In SOSP, pages 423\u2013440, New York, NY, USA, 2017. ACM.10.1145\/3132747.3132783","DOI":"10.1145\/3132747.3132783"},{"key":"2022062314360580927_j_popets-2022-0004_ref_058","doi-asserted-by":"crossref","unstructured":"[58] Salil P. Vadhan. The complexity of differential privacy. In Yehuda Lindell, editor, Tutorials on the Foundations of Cryptography, pages 347\u2013450. Springer International Publishing, 2017.10.1007\/978-3-319-57048-8_7","DOI":"10.1007\/978-3-319-57048-8_7"},{"key":"2022062314360580927_j_popets-2022-0004_ref_059","doi-asserted-by":"crossref","unstructured":"[59] Istv\u00e1n Vajda. On the analysis of time-aware protocols in universal composability framework. Int. J. Inf. Sec., 15(4):403\u2013412, 2016.10.1007\/s10207-015-0300-2","DOI":"10.1007\/s10207-015-0300-2"},{"key":"2022062314360580927_j_popets-2022-0004_ref_060","doi-asserted-by":"crossref","unstructured":"[60] Jelle van den Hooff, David Lazar, Matei Zaharia, and Nickolai Zeldovich. Vuvuzela: Scalable private messaging resistant to traffic analysis. In SOSP, New York, NY, USA, 2015. ACM.10.1145\/2815400.2815417","DOI":"10.1145\/2815400.2815417"},{"key":"2022062314360580927_j_popets-2022-0004_ref_061","unstructured":"[61] Nicolas van Saberhagen. Cryptonote v 2.0. Whitepaper, 2013."},{"key":"2022062314360580927_j_popets-2022-0004_ref_062","doi-asserted-by":"crossref","unstructured":"[62] Sameer Wagh, Paul Cuff, and Prateek Mittal. Differentially private oblivious RAM. PoPETs, 2018(4):64\u201384, 2018.10.1515\/popets-2018-0032","DOI":"10.1515\/popets-2018-0032"},{"key":"2022062314360580927_j_popets-2022-0004_ref_063","doi-asserted-by":"crossref","unstructured":"[63] Tsz Hon Yuen, Shi-Feng Sun, Joseph K. Liu, Man Ho Au, Muhammed F. Esgin, Qingzhao Zhang, and Dawu Gu. Ringct 3.0 for blockchain confidential transaction: Shorter size and stronger security. In Joseph Bonneau and Nadia Heninger, editors, Financial Cryptography and Data Security, pages 464\u2013483, Cham, 2020. Springer International Publishing.10.1007\/978-3-030-51280-4_25","DOI":"10.1007\/978-3-030-51280-4_25"},{"key":"2022062314360580927_j_popets-2022-0004_ref_064","unstructured":"[64] Zcash, https:\/\/z.cash\/. Accessed 2\/25\/2021."},{"key":"2022062314360580927_j_popets-2022-0004_ref_065","unstructured":"[65] ZCash Foundation. GrantProposals-2018Q2. https:\/\/github.com\/ZcashFoundation\/GrantProposals-2018Q2, 2018."}],"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.sciendo.com\/pdf\/10.2478\/popets-2022-0004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T19:15:38Z","timestamp":1726168538000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2022\/popets-2022-0004.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,20]]},"references-count":65,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,11,20]]},"published-print":{"date-parts":[[2022,1,1]]}},"alternative-id":["10.2478\/popets-2022-0004"],"URL":"https:\/\/doi.org\/10.2478\/popets-2022-0004","relation":{},"ISSN":["2299-0984"],"issn-type":[{"type":"electronic","value":"2299-0984"}],"subject":[],"published":{"date-parts":[[2021,11,20]]}}}