{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:38:28Z","timestamp":1743111508276,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030755386"},{"type":"electronic","value":"9783030755393"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75539-3_12","type":"book-chapter","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T23:36:24Z","timestamp":1620689784000},"page":"276-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Cryptanalysis of a Dynamic Universal Accumulator over Bilinear Groups"],"prefix":"10.1007","author":[{"given":"Alex","family":"Biryukov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksei","family":"Udovenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Vitto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Au, M.H., Tsang, P.P., Susilo, W., Mu, Y.: Dynamic universal accumulators for ddh groups and their application to attribute-based anonymous credential systems. In: CT-RSA, Springer LNCS, vol. 5473, pp. 295\u2013308 (2009)","DOI":"10.1007\/978-3-642-00862-7_20"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: EUROCRYPT, pp. 480\u2013494 (1997)","DOI":"10.1007\/3-540-69053-0_33"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: EUROCRYPT, pp. 274\u2013285 (1993)","DOI":"10.1007\/3-540-48285-7_24"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008)","DOI":"10.1007\/s00145-007-9005-7"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Corrigan-Gibbs, H.: Bivariate polynomials modulo composites and their applications. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 42\u201362 (2014)","DOI":"10.1007\/978-3-662-45611-8_3"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. Cryptology ePrint Archive, Report 2018\/1188 (2018)","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Buldas, A., Laud, P., Lipmaa, H.: Accountable certificate management using undeniable attestations. In: ACM CCS, vol. 9\u201317 (2000)","DOI":"10.1145\/352600.352604"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Buldas, A., Laud, P., Lipmaa, H.: Eliminating counterevidence with applications to accountable certificate management. J. Comput. Secur. 10, 2002 (2002)","DOI":"10.3233\/JCS-2002-10304"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Camacho, P., Hevia, A., Kiwi, M.A., Opazo, R.: Strong accumulators from collision-resistant hashing. In: ISC, Springer LNCS, vol. 4222, pp. 471\u2013486 (2008)","DOI":"10.1007\/978-3-540-85886-7_32"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: CRYPTO, pp. 61\u201376 (2002)","DOI":"10.1007\/3-540-45708-9_5"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: PKC 2009, Springer LNCS, vol. 5443, pp. 481\u2013500 (2009)","DOI":"10.1007\/978-3-642-00468-1_27"},{"key":"12_CR12","unstructured":"Damg\u00e5rd, I., Triandopoulos, N.: Supporting non-membership proofs with bilinear-map accumulators. IACR Cryptology ePrint Archive, vol. 538 (2008)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Derler, D., Hanser, C., Slamanig, D.: Revisiting cryptographic accumulators, additional properties and relations to other primitives. In: CT-RSA 2015, pp. 127\u2013144 (2015)","DOI":"10.1007\/978-3-319-16715-2_7"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Li, J., Li, N., Xue, R.: Universal accumulators with efficient nonmembership proofs. In: ACNS, Springer LNCS, vol. 4521, pp. 253\u2013269 (2007)","DOI":"10.1007\/978-3-540-72738-5_17"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: Secure Accumulators from euclidean rings without trusted setup. In: ACNS, Springer LNCS, vol. 7341, pp. 224\u2013240 (2012)","DOI":"10.1007\/978-3-642-31284-7_14"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: A certified digital signature. In: Advances in Cryptology - CRYPTO 1989, pp. 218\u2013238 (1989)","DOI":"10.1007\/0-387-34805-0_21"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge(2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: CT-RSA, Springer LNCS, vol. 3376, pp. 275\u2013292 (2005)","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Sander, T.: Efficient accumulators without trapdoor. In: ICICS, pp. 252\u2013262 (1999)","DOI":"10.1007\/978-3-540-47942-0_21"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Vitto, G., Biryukov, A.: Dynamic universal accumulator with batch update over bilinear groups. In: IACR Cryptology ePrint Archive, vol. 777 (2020)","DOI":"10.1007\/978-3-030-75539-3_12"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75539-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T15:56:27Z","timestamp":1725033387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75539-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030755386","9783030755393"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75539-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/ctrsa2021\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","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":"27","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":"27% - 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.25","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":"8","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)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}