MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol
Abstract
We introduce MatRiCT, an efficient RingCT protocol for blockchain confidential transactions, whose security is based on "post-quantum'' (module) lattice assumptions. The proof length of the protocol is around two orders of magnitude shorter than the existing post-quantum proposal, and scales efficiently to large anonymity sets, unlike the existing proposal. Further, we provide the first full implementation of a post-quantum RingCT, demonstrating the practicality of our scheme. In particular, a typical transaction can be generated in a fraction of a second and verified in about 23 ms on a standard PC. Moreover, we show how our scheme can be extended to provide auditability, where a user can select a particular authority from a set of authorities to reveal her identity. The user also has the ability to select no auditing and all these auditing options may co-exist in the same environment. The key ingredients, introduced in this work, of MatRiCT are 1) the shortest to date scalable ring signature from standard lattice assumptions with no Gaussian sampling required, 2) a novel balance zero-knowledge proof and 3) a novel extractable commitment scheme from (module) lattices. We believe these ingredients to be of independent interest for other privacy-preserving applications such as secure e-voting. Despite allowing 64-bit precision for transaction amounts, our new balance proof, and thus our protocol, does not require a range proof on a wide range (such as 32- or 64-bit ranges), which has been a major obstacle against efficient lattice-based solutions. Further, we provide new formal definitions for RingCT-like protocols, where the real-world blockchain setting is captured more closely. The definitions are applicable in a generic setting, and thus are believed to contribute to the development of future confidential transaction protocols in general (not only in the lattice setting).
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
MatRiCT is a lattice-based quantum resistant protocol built on RingCT, the protocol used by Monero to hide transaction amounts.
“A group of scientists developed the MatRiCT lattice-based quantum resistant protocol built on ring confidential transactions (RingCT) which is the protocol used by Monero cryptocurrency to hide transaction amounts92.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [92]
Cites
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374407 · Cited by 2,501 · see citing works
Rivest, R. L., Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_32 · Cited by 1,619 · see citing works
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Micciancio, D., & Peikert, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_41 · Cited by 1,229 · see citing works
On the concrete hardness of Learning with Errors
Albrecht, M. R., Player, R., & Scott, S. (2015) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2015-0016 · Cited by 888 · see citing works
SHA-3 standard: permutation-based hash and extendable-output functions
National Institute of Standards and Technology (US) (2015) · doi:10.6028/nist.fips.202 · Cited by 783 · see citing works
Bellare, M., Micciancio, D., & Warinschi, B. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_38 · Cited by 736 · see citing works
Worst-case to average-case reductions for module lattices
Roux-Langlois, A., & Stehlé, D. (2014) · Designs Codes and Cryptography · doi:10.1007/s10623-014-9938-4 · Cited by 651 · see citing works
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10366-7_35 · Cited by 583 · see citing works
Sun, S.-F., Au, M. H., Liu, J. K., & Yuen, T. H. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66399-9_25 · Cited by 269 · see citing works
Self-citationImproved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Katz, J. I., Kolesnikov, V., & Wang, X. S. (2018) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3243734.3243805 · Cited by 232 · see citing works
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
Groth, J., & Kohlweiss, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46803-6_9 · Cited by 205 · see citing works
(2015) · IACR Cryptology ePrint Archive · Cited by 160 · see citing works
More Efficient Commitments from Structured Lattice Assumptions
Baum, C., Damgård, I., Lyubashevsky, V., Oechsner, S., & Peikert, C. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98113-0_20 · Cited by 143 · see citing works
Short Accountable Ring Signatures Based on DDH
Bootle, J., Cerulli, A., Chaidos, P., Ghadafi, E., Groth, J., & Petit, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24174-6_13 · Cited by 127 · see citing works
RingCT 3.0 for Blockchain Confidential Transaction: Shorter Size and Stronger Security
Yuen, T. H., Sun, S.-F., Liu, J. K., Au, M. H., Esgin, M. F., Zhang, Q., & Gu, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51280-4_25 · Cited by 104 · see citing works
Self-citationLinkable Spontaneous Anonymous Group Signature for Ad Hoc Groups (Extended Abstract)
Liu, J. K., Wei, V. K., & Wong, D. S. (2004) · Australasian Conference on Information Security and Privacy · Cited by 102 · see citing works
Self-citationEsgin, M. F., Steinfeld, R., Liu, J. K., & Liu, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26948-7_5 · Cited by 98 · see citing works
Self-citationLattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability
del Pino, R., Lyubashevsky, V., & Seiler, G. (2018) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3243734.3243852 · Cited by 92 · see citing works
Intel’s New AES Instructions for Enhanced Performance and Security
Gueron, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03317-9_4 · Cited by 87 · see citing works
Lyubashevsky, V., & Seiler, G. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78381-9_8 · Cited by 79 · see citing works
Short Lattice-Based One-out-of-Many Proofs and Applications to Ring Signatures
Esgin, M. F., Steinfeld, R., Sakzad, A., Liu, J. K., & Liu, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21568-2_4 · Cited by 72 · see citing works
Self-citationEfficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
Benhamouda, F., Krenn, S., Lyubashevsky, V., & Pietrzak, K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24174-6_16 · Cited by 69 · see citing works
One-Shot Verifiable Encryption from Lattices
Lyubashevsky, V., & Neven, G. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_11 · Cited by 60 · see citing works
Adiantum: length-preserving encryption for entry-level processors
Crowley, P., & Biggers, E. (2018) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2018.i4.39-61 · Cited by 51 · see citing works
Adiantum: length-preserving encryption for entry-level processors
Crowley, P., & Biggers, E. (2018) · DOAJ (DOAJ: Directory of Open Access Journals) · doi:10.13154/tosc.v2018.i4.39-61 · Cited by 37 · see citing works
A Note on the Implementation of the Number Theoretic Transform
Scott, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-71045-7_13 · Cited by 22 · see citing works
Lattice RingCT V2.0 with Multiple Input and Multiple Output Wallets
Torres, W. A. A., Kuchta, V., Steinfeld, R., Sakzad, A., Liu, J. K., & Cheng, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21548-4_9 · Cited by 21 · see citing works
Self-citationImproving Speed of Dilithium’s Signing Procedure
Ravi, P., Gupta, S. S., Chattopadhyay, A., & Bhasin, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-42068-0_4 · Cited by 20 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Post-Quantum Blockchain Security for the Internet of Things: Survey and Research Directions
Gharavi, H., Granjal, J., & Monteiro, E. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3355222 · Cited by 155 · see citing works
Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices
Beullens, W., Katsumata, S., & Pintore, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_16 · Cited by 135 · see citing works
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General
Lyubashevsky, V., Nguyen, N. K., & Plançon, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15979-4_3 · Cited by 129 · see citing works
A Survey and Comparison of Post-Quantum and Quantum Blockchains
Yang, Z., Alfauri, H., Farkiani, B., Jain, R. K., Pietro, R. D., & Erbad, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3325761 · Cited by 135 · see citing works
Liang, W., Liu, Y., Yang, C., Xie, S., Li, K., & Susilo, W. (2024) · ACM Computing Surveys · doi:10.1145/3676164 · Cited by 127 · see citing works
Quantum-resistance in blockchain networks
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-32701-6 · Cited by 109 · see citing works
RingCT 3.0 for Blockchain Confidential Transaction: Shorter Size and Stronger Security
Yuen, T. H., Sun, S.-F., Liu, J. K., Au, M. H., Esgin, M. F., Zhang, Q., & Gu, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51280-4_25 · Cited by 104 · see citing works
Self-citationDualRing: Generic Construction of Ring Signatures with Efficient Instantiations
Yuen, T. H., Esgin, M. F., Liu, J. K., Au, M. H., & Ding, Z. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84242-0_10 · Cited by 88 · see citing works
Self-citationPractical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings
Esgin, M. F., Nguyen, N. K., & Seiler, G. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_9 · Cited by 82 · see citing works
Self-citationPractical Product Proofs for Lattice Commitments
Attema, T., Lyubashevsky, V., & Seiler, G. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_17 · Cited by 63 · see citing works
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments
Lyubashevsky, V., Nguyen, N. K., & Seiler, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75245-3_9 · Cited by 60 · see citing works
Group Signatures and More from Isogenies and Lattices: Generic, Simple, and Efficient
Beullens, W., Dobson, S., Katsumata, S., Lai, Y.-F., & Pintore, F. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3_4 · Cited by 58 · see citing works
MatRiCT + : More Efficient Post-Quantum Private Blockchain Payments
Esgin, M. F., Steinfeld, R., & Zhao, R. K. (2022) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46214.2022.9833655 · Cited by 50 · see citing works
Self-citationLyubashevsky, V., Nguyen, N. K., & Seiler, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84245-1_21 · Cited by 49 · see citing works
Blockchain for Diamond Industry: Opportunities and Challenges
Thakker, U., Patel, R., Tanwar, S., Kumar, N., & Song, H. H. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3047550 · Cited by 46 · see citing works
Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
Lyubashevsky, V., Nguyen, N. K., Plançon, M., & Seiler, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92068-5_8 · Cited by 44 · see citing works
A Review of Cryptographic Electronic Voting
Kho, Y.-X., Heng, S., & Chin, J. (2022) · Symmetry · doi:10.3390/sym14050858 · Cited by 48 · see citing works
Post-quantum distributed ledger technology: a systematic survey
Parida, N. K., Jatoth, C., Reddy, V. D., Hussain, M. M., & Faizi, J. (2023) · Scientific Reports · doi:10.1038/s41598-023-47331-1 · Cited by 49 · see citing works
Post-quantum Asynchronous Deniable Key Exchange and the Signal Handshake
Brendel, J., Fiedler, R., Günther, F., Janson, C., & Stebila, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97131-1_1 · Cited by 41 · see citing works
Post-Quantum Adaptor Signatures and Payment Channel Networks
Esgin, M. F., Ersoy, O., & Erkin, Z. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-59013-0_19 · Cited by 38 · see citing works
Self-citationDeterministic Wallets in a Quantum World
Alkadri, N. A., Das, P., Erwig, A., Faust, S., Krämer, J., Riahi, S., & Struck, P. (2020) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3372297.3423361 · Cited by 37 · see citing works
A Framework for Practical Anonymous Credentials from Lattices
Bootle, J., Lyubashevsky, V., Nguyen, N. K., & Sorniotti, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38545-2_13 · Cited by 36 · see citing works
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks
Holcomb, A., Pereira, G. C. C. F., Das, B., & Mosca, M. (2021) · IEEE International Conference on Blockchain and Cryptocurrency (ICBC) · doi:10.1109/icbc51069.2021.9461070 · Cited by 36 · see citing works
Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand
Esgin, M. F., Kuchta, V., Sakzad, A., Steinfeld, R., Zhang, Z., Sun, S.-F., & Chu, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-662-64331-0_29 · Cited by 35 · see citing works
Self-citationQuantum-resistant blockchain and performance analysis
Wu, F., Zhou, B., Song, J., & Xie, L. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07018-y · Cited by 37 · see citing works
SoK: Money Laundering in Cryptocurrencies
Kolachala, K., Simsek, E., Ababneh, M., & Vishwanathan, R. (2021) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3465481.3465774 · Cited by 30 · see citing works
Navigating the quantum computing threat landscape for blockchains: A comprehensive survey
Khodaiemehr, H., Bagheri, K., & Feng, C. (2025) · Computer Science Review · doi:10.1016/j.cosrev.2025.100846 · Cited by 41 · see citing works
Many-out-of-Many Proofs and Applications to Anonymous Zether
Diamond, B. E. (2021) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40001.2021.00026 · Cited by 27 · see citing works
Hashimoto, K., Katsumata, S., Kwiatkowski, K., & Prest, T. (2022) · Journal of Cryptology · doi:10.1007/s00145-022-09427-1 · Cited by 28 · see citing works
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications
Lyubashevsky, V., & Nguyen, N. K. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22972-5_4 · Cited by 26 · see citing works
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures
Lyubashevsky, V., Nguyen, N. K., & Plançon, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97131-1_17 · Cited by 24 · see citing works
Compact Ring Signatures from Learning with Errors
Chatterjee, R., Garg, S., Hajiabadi, M., Khurana, D., Liang, X. R., Malavolta, G., Pandey, O., & Shiehian, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84242-0_11 · Cited by 23 · see citing works
Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs
Esgin, M. F., Steinfeld, R., Liu, D., & Ruj, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38554-4_16 · Cited by 20 · see citing works
Self-citationA blockchain-based quantum-secure reporting protocol
Far, S. B., & Asaar, M. R. (2021) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-021-01152-z · Cited by 18 · see citing works
Group signatures and more from isogenies and lattices: generic, simple, and efficient
Beullens, W., Dobson, S., Katsumata, S., Lai, Y.-F., & Pintore, F. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01192-x · Cited by 17 · see citing works
A New Privacy-Preserving Payment Protocol for Blockchain Transactions
Jia, Y., Sun, S.-F., Zhang, Y., Zhang, Q., Ding, N., Liu, Z., Liu, J. K., & Gu, D. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.2998682 · Cited by 16 · see citing works
Self-citationMR-DSS – Smaller MinRank-Based (Ring-)Signatures
Bellini, E., Esser, A., Sanna, C., & Verbel, J. A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17234-2_8 · Cited by 15 · see citing works
Leaking Arbitrarily Many Secrets: Any-out-of-Many Proofs and Applications to RingCT Protocols
Zheng, T., Gao, S. H., Song, Y., & Xiao, B. (2023) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46215.2023.10179292 · Cited by 14 · see citing works
Lattice-Based Group Signatures With Time-Bound Keys via Redactable Signatures
Tang, Y., Li, Y., Ye, Q., & He, D. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3268574 · Cited by 14 · see citing works
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
Fenzi, G., Moghaddas, H., & Nguyen, N. K. (2024) · Journal of Cryptology · doi:10.1007/s00145-024-09511-8 · Cited by 14 · see citing works
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE
Bootle, J., Lyubashevsky, V., Nguyen, N. K., & Seiler, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-88428-4_30 · Cited by 14 · see citing works
Feneuil, T., & Rivain, M. (2025) · Journal of Cryptology · doi:10.1007/s00145-025-09543-8 · Cited by 12 · see citing works
A Note on the Post-quantum Security of (Ring) Signatures
Chatterjee, R., Chung, K.-M., Liang, X. R., & Malavolta, G. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97131-1_14 · Cited by 9 · see citing works
An auditable confidentiality protocol for blockchain transactions
Li, A., D’Angelo, G., Tang, S.-K., Fang, F., & Gong, B. (2025) · Blockchain Research and Applications · doi:10.1016/j.bcra.2025.100380 · Cited by 10 · see citing works
Practical Sublinear Proofs for R1CS from Lattices
Nguyen, N. K., & Seiler, G. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15979-4_5 · Cited by 9 · see citing works
Libert, B., Nguyen, K., Peters, T., & Yung, M. M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3_17 · Cited by 8 · see citing works
Secure Smart Grids: Based on Post-Quantum Blockchain
Khan, B., Haq, I. U., Rana, S., & Rasheed, H. U. (2022) · International Bhurban Conference on Applied Sciences and Technology (IBCAST) · doi:10.1109/ibcast54850.2022.9990096 · Cited by 8 · see citing works
Aggregable Confidential Transactions for Efficient Quantum-Safe Cryptocurrencies
Alupotha, J., Boyen, X., & McKague, M. (2022) · IEEE Access · doi:10.1109/access.2022.3149605 · Cited by 8 · see citing works
Post-quantum ID-Based Ring Signatures from Symmetric-Key Primitives
Buser, M., Liu, J. K., Steinfeld, R., & Sakzad, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-09234-3_44 · Cited by 7 · see citing works
Self-citationPost Quantum Fuzzy Stealth Signatures and Applications
Pu, S., Thyagarajan, S. A. K., Döttling, N., & Hanzlik, L. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3623148 · Cited by 6 · see citing works
Analysis of Crystals-Dilithium for BlockChain Security
Sharma, L., & Mishra, A. (2021) · International Conference on Secure Cyber Computing and Communications (ICSCCC) · doi:10.1109/icsccc51823.2021.9478087 · Cited by 7 · see citing works
Lattice-Based E-Cash, Revisited
Deo, A., Libert, B., Nguyen, K., & Sanders, O. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_11 · Cited by 6 · see citing works
On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures
Bläser, M., Chen, Z., Duong, D. H., Joux, A., Nguyen, T., Plantard, T., Qiao, Y., Susilo, W., & Tang, G. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-62743-9_8 · Cited by 5 · see citing works
Efficient Post-Quantum Secure Deterministic Threshold Wallets from Isogenies
Das, P., Erwig, A., Meyer, M., & Struck, P. (2024) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3634737.3657008 · Cited by 5 · see citing works
Post-Quantum Threshold Ring Signature Applications from VOLE-in-the-Head
Chiang, J. H.-Y., Damgård, I., Duro, W. R., Engan, S., Kolby, S., & Schöll, P. (2025) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3719027.3744854 · Cited by 5 · see citing works
Ring/Module Learning with Errors Under Linear Leakage – Hardness and Applications
Wang, Z., Lai, Q., & Liu, F.-H. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-57722-2_9 · Cited by 4 · see citing works
Nimbe, P., Weyori, B. A., Mensah, J., Amponsah, A. A., Adekoya, A. F., & Domfeh, E. A. (2022) · Advances in data mining and database management book series · doi:10.4018/978-1-6684-5072-7.ch001 · Cited by 4 · see citing works
Design of an Exchange Protocol for the Quantum Blockchain
Tudorache, A.-G. (2022) · Mathematics · doi:10.3390/math10213986 · Cited by 4 · see citing works
A Holistic Security Analysis of Monero Transactions
Cremers, C. J. F., Loss, J., & Wagner, B. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58734-4_5 · Cited by 4 · see citing works
GPV Preimage Sampling with Weak Smoothness and Its Applications to Lattice Signatures
Zhang, S., Jia, H., Ran, D., Yu, Y., Yu, Y., & Wang, X. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5099-9_8 · Cited by 3 · see citing works
An Decentralized Anonymous Payment Confidential Transactions with Efficient Proofs and Scalability
Miao, J., & Han, Z. Y. (2022) · IEEE International Conference on Electrical Engineering, Big Data and Algorithms (EEBDA) · doi:10.1109/eebda53927.2022.9744784 · Cited by 3 · see citing works
LACT+: Practical Post-Quantum Scalable Confidential Transactions
Alupotha, J., Boyen, X., & McKague, M. (2023) · Cryptography · doi:10.3390/cryptography7020024 · Cited by 3 · see citing works
Transitioning RingCT Accounts: From Classical to Post-Quantum Security
Duan, J., Wang, W., Wang, L., & Gu, L. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3466905 · Cited by 3 · see citing works
Updatable Privacy-Preserving Blueprints
David, B., Engelmann, F., Frederiksen, T. K., Kohlweiss, M., Pagnin, E., & Volkhov, M. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0875-1_4 · Cited by 3 · see citing works
Lattice-based zero-knowledge arguments for additive and multiplicative relations
Kuchta, V., Sakzad, A., Steinfeld, R., & Liu, J. K. (2021) · Designs Codes and Cryptography · doi:10.1007/s10623-021-00851-1 · Cited by 3 · see citing works
Self-citationA lattice-based privacy-preserving decentralized multi-party payment scheme
Dong, J., Shen, Q., Liang, J., Li, C., Feng, X., & Fang, Y. (2025) · Computer Networks · doi:10.1016/j.comnet.2025.111129 · Cited by 2 · see citing works
Zhang, R., Luo, P., & Huang, Q. (2025) · Computer Standards & Interfaces · doi:10.1016/j.csi.2025.104084 · Cited by 2 · see citing works
Logarithmic-Size (Linkable) Ring Signatures from Lattice Isomorphism Problems
Khuc, X. T., Ta, A. T., Susilo, W., Duong, D. H., Guo, F., Fukushima, K., & Kiyomoto, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-51583-5_13 · Cited by 2 · see citing works
DID:RING: Ring Signatures Using Decentralised Identifiers For Privacy-Aware Identity Proof
Kasimatis, D., Grierson, S., Buchanan, W. J., Eckl, C., Papadopoulos, P., Pitropakis, N., Chrysoulas, C., Thomson, C. J., & Ghaleb, B. (2024) · IEEE International Conference on Cyber Security and Resilience (CSR) · doi:10.1109/csr61664.2024.10679351 · Cited by 2 · see citing works
Lattice-Based Zero-Knowledge Proofs for Blockchain Confidential Transactions
Gao, S. H., Zheng, T., Guo, Y., Peng, Z., & Xiao, B. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91832-2_5 · Cited by 2 · see citing works
AQQUA: Augmenting Quisquis with Auditability
Papadoulis, G., Balla, D., Grontas, P., & Pagourtzis, A. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-95764-2_12 · Cited by 2 · see citing works
Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions
Bootle, J., Lehmann, A., Lyubashevsky, V., & Seiler, G. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-44223-1_13 · Cited by 2 · see citing works
Alupotha, J., Boyen, X., & McKague, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17140-6_4 · Cited by 2 · see citing works
SoK: Privacy-Preserving Signatures
Chator, A., Green, M., & Tiwari, P. R. (2025) · IACR Communications in Cryptology · doi:10.62056/a3wa3z10k · Cited by 2 · see citing works
Covert Authentication from Lattices
Kumar, R., & Nguyen, K. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-09234-3_24 · Cited by 2 · see citing works
The Advance of Ring Confidential Transactions
Jin, R. (2023) · Highlights in Science Engineering and Technology · doi:10.54097/hset.v39i.6715 · Cited by 1 · see citing works
Traceable Ring Signatures from Group Actions: Logarithmic, Flexible, and Quantum Resistant
Wei, W., Luo, M., Bao, Z., Peng, C., & He, D. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-53368-6_9 · Cited by 1 · see citing works
Compressed Sigma Protocols: New Model and Aggregation Techniques
Xue, Y., Zheng, T., Gao, S. H., Xiao, B., & Au, M. H. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-9095-4_9 · Cited by 1 · see citing works
A Lightweight Privacy Protection Blockchain Framework Against Quantum Attacks
Zhang, J., Tang, M., Zhang, D., Yu, H., Zhou, S., Chen, X., & Niu, S. (2026) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2026.3690615 · Cited by 1 · see citing works
Supersingular Isogeny-based Ring Signature
Garjan, M. S., KILIÇ, N. G. O., & Cenk, M. (2023) · International Journal of Information Security Science · doi:10.55859/ijiss.1187756 · Cited by 1 · see citing works
Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
Esgin, M. F., Steinfeld, R., & Zhao, R. K. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97121-2_12 · Cited by 1 · see citing works
Self-citationA Universally Composable Non-interactive Aggregate Cash System
Jia, Y., Shi-Feng, S., Zhou, H.-S., & Gu, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22963-3_25 · Cited by 1 · see citing works
Succinct Hash-Based Arbitrary-Range Proofs
Li, W., Zhang, Z., Guo, Y., Chow, S. S. M., & Wan, Z. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3497806 · Cited by 1 · see citing works
Lelantus Spark: Secure and Flexible Private Transactions
Jivanyan, A., & Feickert, A. J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-32415-4_28
CTA: Confidential Transactions Protocol with State Accumulator
Si, S., Wei, P., Lin, X., & Li, L. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-7563-1_19
The Future Ring Confidential Transaction Protocols for Privacy-Preserving Blockchain
Esgin, M. F., Liu, J. K., Sun, S.-F., & Wijaya, D. A. (2023) · Advances in information security · doi:10.1007/978-3-031-32146-7_5
Self-citationShorter lattice-based verifiable encryption using bimodal Gaussian
Fang, D., Huang, G., Chang, S., Yang, H., Hu, L., & Ye, D. (2025) · Cybersecurity · doi:10.1186/s42400-024-00351-4
Securing Blockchain with Quantum-Inspired Protocols
Batta, P., Wasson, V., & Sardar, S. (2025) · Blockchain technologies · doi:10.1007/978-981-96-9148-7_1 · Cited by 1 · see citing works
Quantum-safe DualRing with shorter signature and public key
Liao, G., Li, Z., Feng, G., Lv, H., & Wang, M. (2026) · International Journal of Information Security · doi:10.1007/s10207-026-01273-7
Amortized Σ-Protocol for MLWE Problem
Li, Q., & Yang, S. (2026) · Cryptography · doi:10.3390/cryptography10040054
Taherdoost, H. (2026) · Cryptography · doi:10.3390/cryptography10040053
Traceable Blockchain Privacy Payment Protocol with Multi-Party Controlled Trapdoor
Meng, Y., Duan, J., Wang, L., Zhu, L., & Liu, L. (2026) · Communications in computer and information science · doi:10.1007/978-981-92-2973-4_9
LeOPaRd: Towards Practical Post-quantum Oblivious PRFs via 2HashDH Paradigm
Esgin, M. F., Steinfeld, R., Tairi, E., & Xu, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35377-1_2
Self-citationOuadrassi, N. L., Boukhryss, M. S., Azmani, A., & Hassani, K. J. (2026) · IEEE Access · doi:10.1109/access.2026.3735938
Ring Adaptor Signatures for Atomic Swaps: Formalization and Efficient Construction
Kajita, K., & Takayasu, A. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-5737-9_13
SoK: Ring Signatures from Symmetric-Key Primitives: A Systematisation and Research Agenda
Li, Z., Liu, J. K., Yuen, T. H., & Zhang, X. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-6831-3_22
Self-citation
- Authors
- Esgin, M. F., Zhao, R. K., Steinfeld, R., Liu, J. K., & Liu, D.
- Affiliations
- Commonwealth Scientific and Industrial Research Organisation (AU)
- Monash University (AU)
- Venue
- Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2019-11-06
- Pages
- 567-584
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2986657889
- Cited by
- 96
- References
- 27
- Citations by year
- 2026: 9 · 2025: 14 · 2024: 13 · 2023: 15 · 2022: 22 · 2021: 13 · 2020: 10
- FWCI
- 4.30
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGSAC Conference on Computer and Communications Security (CCS) (publishedVersion)
- Funders
- Australian Research Council (DP180102199)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Keywords
- confidential transactions, blockchain privacy, post-quantum cryptography, module lattices, ring signatures, zero-knowledge proofs, auditability, anonymity set
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
