IDEA-DAC: Integrity-Driven Editing for Accountable Decentralized Anonymous Credentials via ZK-JSON
Pages 1868 - 1879
Abstract
Decentralized Anonymous Credential (DAC) systems are increasingly relevant, especially when enhancing revocation mechanisms in the face of complex traceability challenges. This paper introduces IDEA-DAC a paradigm shift from the conventional revoke-and-reissue methods, promoting direct and Integrity-Driven Editing (IDE) for Accountable DACs, which results in better integrity accountability, traceability, and system simplicity. We further incorporate an Edit-bound Conformity Check that ensures tailored integrity standards during credential amendments using R1CS-based ZK-SNARKs. Delving deeper, we propose ZK-JSON, a unique R1CS circuit design tailored for IDE over generic JSON documents. This design imposes strictly O(N) rank-1 constraints for variable-length JSON documents of up to N bytes in length, encompassing serialization, encryption, and edit-bound conformity checks. Additionally, our circuits only necessitate a one-time compilation, setup, and smart contract deployment for homogeneous JSON documents up to a specified size. While preserving core DAC features such as selective disclosure, anonymity, and predicate provability, IDEA-DAC achieves precise data modification checks without revealing private content, ensuring only authorized edits are permitted. In summary, IDEA-DAC offers an enhanced methodology for large-scale JSON-formatted credential systems, setting a new standard in decentralized identity management efficiency and precision.
Supplemental Material
MP4 File
Supplemental video
- Download
- 48.09 MB
References
[1]
a16z crypto. 2023. ZkDocs: Zero-knowledge Information Sharing. https://a16zcrypto.com/posts/article/zkdocs-zero-knowledge-information-sharing/.
[2]
Martin Albrecht, Lorenzo Grassi, Christian Rechberger, Arnab Roy, and Tyge Tiessen. 2016. MiMC : Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In Advances in Cryptology textendash ASIACRYPT 2016 (Lecture Notes in Computer Science ), Jung Hee Cheon and Tsuyoshi Takagi (Eds.). Springer, Berlin, Heidelberg, 191--219. https://doi.org/10.1007/978--3--662--53887--6_7
[3]
Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P Ward. 2019. Aurora: Transparent succinct arguments for R1CS. In Advances in Cryptology--EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19--23, 2019, Proceedings, Part I 38. Springer, 103--128.
[4]
Clemens Brunner, Ulrich Gallersdörfer, Fabian Knirsch, Dominik Engel, and Florian Matthes. 2021. DID and VC:Untangling Decentralized Identifiers and Verifiable Credentials for the Web of Trust. In Proceedings of the 2020 3rd International Conference on Blockchain Technology and Applications (Xi'an, China) (ICBTA '20). Association for Computing Machinery, New York, NY, USA, 61-66. https://doi.org/10.1145/3446983.3446992
[5]
B. Bunz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society, Los Alamitos, CA, USA, 315--334. https://doi.org/10.1109/SP.2018.00020
[6]
David Chaum. 1985. Security without identification: Transaction systems to make big brother obsolete. Commun. ACM, Vol. 28, 10 (1985), 1030--1044.
[7]
Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas Ward. 2020. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In Advances in Cryptology textendash EUROCRYPT 2020 (Lecture Notes in Computer Science ), Anne Canteaut and Yuval Ishai (Eds.). Springer International Publishing, Cham, 738--768. https://doi.org/10.1007/978--3-030--45721--1_26
[8]
Circle. 2023. Verite. https://www.circle.com/en/verite.
[9]
Consensys. 2023. Gnark. https://docs.gnark.consensys.net/overview.
[10]
Veramo core development. 2023. Ethr-DID Library. https://github.com/uport-project/ethr-did.
[11]
Jens Ernstberger, Jan Lauinger, Fatima Elsheimy, Liyi Zhou, Sebastian Steinhorst, Ran Canetti, Andrew Miller, Arthur Gervais, and Dawn Song. 2023. SoK : Data Sovereignty. In 2023 IEEE 8th European Symposium on Security and Privacy (EuroS &P ). IEEE Computer Society, 122--143. https://doi.org/10.1109/EuroSP57164.2023.00017
[12]
Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Cryptology ePrint Archive, Paper 2019/953. https://eprint.iacr.org/2019/953
[13]
Christina Garman, Matthew Green, and Ian Miers. 2014. Decentralized Anonymous Credentials. In 21st Annual Network and Distributed System Security Symposium, NDSS 2014, San Diego, California, USA, February 23--26, 2014. The Internet Society. https://www.ndss-symposium.org/ndss2014/decentralized-anonymous-credentials
[14]
Sandro Rodriguez Garzon, Hakan Yildiz, and Axel Küpper. 2022. Decentralized Identifiers and Self-sovereign Identity in 6G. IEEE Network, Vol. 36, 4 (2022), 142--148.
[15]
Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. 2008. Delegating Computation: Interactive Proofs for Muggles. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC '08). Association for Computing Machinery, New York, NY, USA, 113--122. https://doi.org/10.1145/1374376.1374396
[16]
S Goldwasser, S Micali, and C Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing (STOC '85). Association for Computing Machinery, New York, NY, USA, 291--304. https://doi.org/10.1145/22145.22178
[17]
Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In Advances in Cryptology textendash EUROCRYPT 2016, Marc Fischlin and Jean-Sébastien Coron (Eds.). Vol. 9666. Springer Berlin Heidelberg, Berlin, Heidelberg, 305--326. https://doi.org/10.1007/978--3--662--49896--5_11
[18]
Abhiram Kothapalli and Srinath Setty. 2022. SuperNova: Proving universal machine executions without universal circuits. Cryptology ePrint Archive, Paper 2022/1758. https://eprint.iacr.org/2022/1758
[19]
Abhiram Kothapalli, Srinath Setty, and Ioanna Tzialla. 2022. Nova: Recursive zero-knowledge arguments from folding schemes. In Annual International Cryptology Conference. Springer, 359--388.
[20]
Shu Yun Lim, Omar Bin Musa, Bander Ali Saleh Al-Rimy, and Abdullah Almasri. 2022. Trust models for blockchain-based self-sovereign identity management: A survey and research directions. Advances in Blockchain Technology for Cyber Physical Systems (2022), 277--302.
[21]
Deepak Maram, Harjasleen Malvai, Fan Zhang, Nerla Jean-Louis, Alexander Frolov, Tyler Kell, Tyrone Lobban, Christine Moy, Ari Juels, and Andrew Miller. 2021. Candid: Can-do decentralized identity with legacy compatibility, sybil-resistance, and accountability. In 2021 IEEE Symposium on Security and Privacy (SP). IEEE, 1348--1366.
[22]
Assa Naveh and Eran Tromer. 2016. Photoproof: Cryptographic image authentication for any set of permissible transformations. In 2016 IEEE Symposium on Security and Privacy (SP). IEEE, 255--271.
[23]
Deevashwer Rathee, Guru Vamsi Policharla, Tiancheng Xie, Ryan Cottone, and Dawn Song. 2022. Zebra: Anonymous credentials with practical on-chain verification and applications to kyc in defi. Cryptology ePrint Archive (2022).
[24]
M. Rosenberg, J. White, C. Garman, and I. Miers. 2023. zk-creds: Flexible Anonymous Credentials from zkSNARKs and Existing Identity Infrastructure. In 2023 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society, Los Alamitos, CA, USA, 790--808. https://doi.org/10.1109/SP46215.2023.10179430
[25]
J. T. Schwartz. 1980. Fast Probabilistic Algorithms for Verification of Polynomial Identities. J. ACM, Vol. 27, 4 (Oct. 1980), 701--717. https://doi.org/10.1145/322217.322225
[26]
Mohammed Shuaib, Noor Hafizah Hassan, Sahnius Usman, Shadab Alam, Surbhi Bhatia, Parul Agarwal, and Sheikh Mohammad Idrees. 2022. Land registry framework based on self-sovereign identity (SSI) for environmental sustainability. Sustainability, Vol. 14, 9 (2022), 5400.
[27]
A. Sonnino, M. Al-Bassam, S. Bano, S. Meiklejohn, and G. Danezis. 2019. Coconut: threshold issuance selective disclosure credentials with applications to distributed ledgers. Proceedings 2019 Network and Distributed System Security Symposium (2019). https://doi.org/10.14722/ndss.2019.23272
[28]
SpruceID. 2023. SpruceID. https://spruceid.com/.
[29]
W3C. 2023 a. Decentralized Identifiers v1.0, Production and Consumption. https://www.w3.org/TR/did-core/#dfn-production.
[30]
W3C. 2023 b. Decentralized Identifiers v1.0, Terminology. https://www.w3.org/TR/did-core/#dfn-did-documents.
[31]
W3C. 2023 c. Verifiable Credentials Data Model v1.1. https://www.w3.org/TR/vc-data-model/#example-a-simple-example-of-a-verifiable-credential.
[32]
W3C. 2023 d. W3C DID. https://www.w3.org/TR/did-core/.
[33]
Tiacheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song. 2019. Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In Advances in Cryptology textendash CRYPTO 2019 (Lecture Notes in Computer Science ), Alexandra Boldyreva and Daniele Micciancio (Eds.). Springer International Publishing, Cham, 733--764. https://doi.org/10.1007/978--3-030--26954--8_24
[34]
Tiancheng Xie, Yupeng Zhang, and Dawn Song. 2022. Orion: Zero Knowledge Proof with Linear Prover Time. In Advances in Cryptology textendash CRYPTO 2022, Yevgeniy Dodis and Thomas Shrimpton (Eds.). Vol. 13510. Springer Nature Switzerland, Cham, 299--328. https://doi.org/10.1007/978--3-031--15985--5_11
[35]
Jiaheng Zhang, Tiancheng Xie, Yupeng Zhang, and Dawn Song. 2020. Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof. In 2020 IEEE Symposium on Security and Privacy (SP ). 859--876. https://doi.org/10.1109/SP40000.2020.00052
Index Terms
- IDEA-DAC: Integrity-Driven Editing for Accountable Decentralized Anonymous Credentials via ZK-JSON
Recommendations
Decentralized blacklistable anonymous credentials with reputation
AbstractBlacklistable anonymous credential systems provide service providers with a way to authenticate users according to their historical behaviors, while guaranteeing that all users can access services in an anonymous and unlinkable manner, ...
Anonymous k-show credentials
EuroPKI'07: Proceedings of the 4th European conference on Public Key Infrastructure: theory and practicePrivacy-preserving digital credentials are cryptographic tools that allow a user to prove a predicate about his/her identity or qualifications, without the verifying party learning additional information beyond the status of that predicate. The Identity ...
Delegatable Anonymous Credentials from Mercurial Signatures
Topics in Cryptology – CT-RSA 2019AbstractIn a delegatable anonymous credential system, participants may use their credentials anonymously as well as anonymously delegate them to other participants. Such systems are more usable than traditional anonymous credential systems because a ...
Comments
Information & Contributors
Information
Published In
May 2024
4826 pages
ISBN:9798400701719
DOI:10.1145/3589334
- General Chairs:
- Tat-Seng Chua,
- Chong-Wah Ngo,
- Proceedings Chair:
- Roy Ka-Wei Lee,
- Program Chairs:
- Ravi Kumar,
- Hady W. Lauw
Copyright © 2024 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 May 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
WWW '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,899 of 8,196 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 116Total Downloads
- Downloads (Last 12 months)116
- Downloads (Last 6 weeks)6
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in