{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:44:09Z","timestamp":1743144249759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031229114"},{"type":"electronic","value":"9783031229121"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22912-1_11","type":"book-chapter","created":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T15:38:49Z","timestamp":1672501129000},"page":"249-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Protego: Efficient, Revocable and\u00a0Auditable Anonymous Credentials with\u00a0Applications to\u00a0Hyperledger Fabric"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7485-387X","authenticated-orcid":false,"given":"Aisling","family":"Connolly","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Deschamps","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4459-511X","authenticated-orcid":false,"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3377-9802","authenticated-orcid":false,"given":"Octavio","family":"Perez Kempner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"11_CR1","unstructured":"Implementation. https:\/\/github.com\/octaviopk9\/indocrypt_protego"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Androulaki, E., Camenisch, J., Caro, A.D., Dubovitskaya, M., Elkhiyaoui, K., Tackmann, B.: Privacy-preserving auditable token payments in a permissioned blockchain system. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies. AFT 2020, pp. 255\u2013267. Association for Computing Machinery, New York (2020)","DOI":"10.1145\/3419614.3423259"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Androulaki, E., De Caro, A., Neugschwandtner, M., Sorniotti, A.: Endorsement in hyperledger fabric. In: 2019 IEEE International Conference on Blockchain (Blockchain), pp. 510\u2013519 (2019)","DOI":"10.1109\/Blockchain.2019.00077"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order, pp. 319\u2013331 (2006). https:\/\/doi.org\/10.1007\/11693383_22","DOI":"10.1007\/11693383_22"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption, pp. 566\u2013582 (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_33","DOI":"10.1007\/3-540-45682-1_33"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-030-92548-2_9","volume-title":"Cryptology and Network Security","author":"J Bobolz","year":"2021","unstructured":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., Samelin, K.: Issuer-hiding attribute-based credentials. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 158\u2013178. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_9"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-92548-2_23","volume-title":"Cryptology and Network Security","author":"D Bogatov","year":"2021","unstructured":"Bogatov, D., De Caro, A., Elkhiyaoui, K., Tackmann, B.: Anonymous transactions with\u00a0revocation and\u00a0auditing in\u00a0hyperledger fabric. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 435\u2013459. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_23"},{"key":"11_CR8","unstructured":"Burkhart, M.: Mercurial signatures implementation. Github (2020). https:\/\/github.com\/burkh4rt\/Mercurial-Signatures"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Drijvers, M., Dubovitskaya, M.: Practical UC-secure delegatable credentials with attributes and their application to blockchain, pp. 683\u2013699 (2017). https:\/\/doi.org\/10.1145\/3133956.3134025","DOI":"10.1145\/3133956.3134025"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps, pp. 56\u201372 (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_4","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system, pp. 21\u201330 (2002). https:\/\/doi.org\/10.1145\/586110.586114","DOI":"10.1145\/586110.586114"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-030-97121-2_15","volume-title":"Public-Key Cryptography - PKC 2022","author":"A Connolly","year":"2022","unstructured":"Connolly, A., Lafourcade, P., Perez Kempner, O.: Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022. LNCS, vol. 13177, pp. 409\u2013438. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_15"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Lysyanskaya, A.: Delegatable anonymous credentials from mercurial signatures, pp. 535\u2013555 (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_27","DOI":"10.1007\/978-3-030-12612-4_27"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Derler, D., Hanser, C., Slamanig, D.: A new approach to efficient revocable attribute-based anonymous credentials, pp. 57\u201374 (2015). https:\/\/doi.org\/10.1007\/978-3-319-27239-9_4","DOI":"10.1007\/978-3-319-27239-9_4"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s00145-018-9281-4","volume":"32","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. J. Cryptol. 32(2), 498\u2013546 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9281-4","journal-title":"J. Cryptol."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Kang, H., Dai, T., Jean-Louis, N., Tao, S., Gu, X.: Fabzk: supporting privacy-preserving, auditable smart contracts in hyperledger fabric. In: 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 543\u2013555 (2019)","DOI":"10.1109\/DSN.2019.00061"},{"key":"11_CR17","unstructured":"Mazumdar, S., Ruj, S.: Design of anonymous endorsement system in hyperledger fabric. IEEE Trans. Emerg. Top. Comput. 1 (2019)"},{"key":"11_CR18","unstructured":"Narula, N., Vasquez, W., Virza, M.: Zkledger: privacy-preserving auditing for distributed ledgers. In: Proceedings of the 15th USENIX Conference on Networked Systems Design and Implementation. NSDI 2018, pp. 65\u201380. USENIX Association, USA (2018)"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards, pp. 239\u2013252 (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22","DOI":"10.1007\/0-387-34805-0_22"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems, pp. 256\u2013266 (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18","DOI":"10.1007\/3-540-69053-0_18"},{"key":"11_CR21","unstructured":"Zurich, I.R.: Specification of the identity mixer cryptographic library v2.3.0 (2013)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22912-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T15:40:53Z","timestamp":1672501253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22912-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229114","9783031229121"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22912-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.tcgcrest.org\/indocrypt-2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.22","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.59","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}