{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T10:03:43Z","timestamp":1784541823662,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["2143287"],"award-info":[{"award-number":["2143287"]}]},{"name":"NSF","award":["CNS-1652259"],"award-info":[{"award-number":["CNS-1652259"]}]},{"name":"NSF","award":["171767"],"award-info":[{"award-number":["171767"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560676","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"2719-2733","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear Accumulators"],"prefix":"10.1145","author":[{"given":"Shravan","family":"Srinivasan","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ioanna","family":"Karantaidou","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Foteini","family":"Baldimtsi","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Hyperledger Indy website. https:\/\/www.hyperledger.org\/ [Online","year":"2022","unstructured":"2015. Hyperledger Indy website. https:\/\/www.hyperledger.org\/ [Online ; accessed 1- May - 2022 ]. 2015. Hyperledger Indy website. https:\/\/www.hyperledger.org\/ [Online; accessed 1-May-2022]."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19379-8_26"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_22"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00862-7_20"},{"key":"e_1_3_2_1_5_1","volume-title":"2017 IEEE European Symposium on Security and Privacy (EuroS P). 301--315","author":"Baldimtsi F.","year":"2017","unstructured":"F. Baldimtsi , J. Camenisch , M. Dubovitskaya , A. Lysyanskaya , L. Reyzin , K. Samelin , and S. Yakoubov . 2017. Accumulators with Applications to AnonymityPreserving Revocation . In 2017 IEEE European Symposium on Security and Privacy (EuroS P). 301--315 . https:\/\/doi.org\/10.1109\/EuroSP. 2017 .13 https: \/\/eprint.iacr.org\/2017\/043. 10.1109\/EuroSP.2017.13 F. Baldimtsi, J. Camenisch, M. Dubovitskaya, A. Lysyanskaya, L. Reyzin, K. Samelin, and S. Yakoubov. 2017. Accumulators with Applications to AnonymityPreserving Revocation. In 2017 IEEE European Symposium on Security and Privacy (EuroS P). 301--315. https:\/\/doi.org\/10.1109\/EuroSP.2017.13 https: \/\/eprint.iacr.org\/2017\/043."},{"key":"e_1_3_2_1_6_1","volume-title":"Advances in Cryptology - EUROCRYPT '97","author":"Birgit Pfitzmann Niko","unstructured":"Niko Bari? and Birgit Pfitzmann . 1997. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees . In Advances in Cryptology - EUROCRYPT '97 , Walter Fumy (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 480--494. Niko Bari? and Birgit Pfitzmann. 1997. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. In Advances in Cryptology - EUROCRYPT '97, Walter Fumy (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 480--494."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_5"},{"key":"e_1_3_2_1_8_1","volume-title":"Advances in Cryptology - EUROCRYPT '93","author":"Benaloh Josh","unstructured":"Josh Benaloh and Michael de Mare . 1993. One-Way Accumulators: A Decentralized Alternative to Digital Signatures . In Advances in Cryptology - EUROCRYPT '93 , Tor Helleseth (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 274--285. https:\/\/www.microsoft.com\/en-us\/research\/publication\/one-wayaccumulators-a-decentralized-alternative-to-digital-signatures\/ Josh Benaloh and Michael de Mare. 1993. One-Way Accumulators: A Decentralized Alternative to Digital Signatures. In Advances in Cryptology - EUROCRYPT '93, Tor Helleseth (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 274--285. https:\/\/www.microsoft.com\/en-us\/research\/publication\/one-wayaccumulators-a-decentralized-alternative-to-digital-signatures\/"},{"key":"e_1_3_2_1_9_1","volume-title":"Succinct, Modular. In Financial Cryptography and Data Security","author":"Benarroch Daniel","unstructured":"Daniel Benarroch , Matteo Campanelli , Dario Fiore , Kobi Gurkan , and Dimitris Kolonelos . 2021. Zero-Knowledge Proofs for Set Membership: Efficient , Succinct, Modular. In Financial Cryptography and Data Security . Springer Berlin Heidelberg , 393--414. https:\/\/doi.org\/10.1007\/978--3--662--64322--8_19 10.1007\/978--3--662--64322--8_19 Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, and Dimitris Kolonelos. 2021. Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. In Financial Cryptography and Data Security. Springer Berlin Heidelberg, 393--414. https:\/\/doi.org\/10.1007\/978--3--662--64322--8_19"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"e_1_3_2_1_11_1","unstructured":"Sean Bowe. 2017. Fast amortized Kate proofs. https:\/\/electriccoin.co\/blog\/newsnark-curve\/.  Sean Bowe. 2017. Fast amortized Kate proofs. https:\/\/electriccoin.co\/blog\/newsnark-curve\/."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Johannes Buchmann and Safuat Hamdy. 2011. A survey on IQ cryptography. In Public-Key Cryptography and Computational Number Theory. 1--15.  Johannes Buchmann and Safuat Hamdy. 2011. A survey on IQ cryptography. In Public-Key Cryptography and Computational Number Theory. 1--15.","DOI":"10.1515\/9783110881035.1"},{"key":"e_1_3_2_1_14_1","unstructured":"Vitalik Buterin. 2020. Using polynomial commitments to replace state roots. https: \/\/ethresear.ch\/t\/using-polynomial-commitments-to-replace-state-roots\/7095.  Vitalik Buterin. 2020. Using polynomial commitments to replace state roots. https: \/\/ethresear.ch\/t\/using-polynomial-commitments-to-replace-state-roots\/7095."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_27"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_1"},{"key":"e_1_3_2_1_18_1","unstructured":"Matteo Campanelli Dario Fiore Semin Han Jihye Kim Dimitris Kolonelos and Hyunok Oh. 2021. Succinct Zero-Knowledge Batch Proofs for Set Accumulators. Cryptology ePrint Archive Paper 2021\/1672. https:\/\/eprint.iacr.org\/2021\/1672 https:\/\/eprint.iacr.org\/archive\/2021\/1672\/20220503:104027.  Matteo Campanelli Dario Fiore Semin Han Jihye Kim Dimitris Kolonelos and Hyunok Oh. 2021. Succinct Zero-Knowledge Batch Proofs for Set Accumulators. Cryptology ePrint Archive Paper 2021\/1672. https:\/\/eprint.iacr.org\/2021\/1672 https:\/\/eprint.iacr.org\/archive\/2021\/1672\/20220503:104027."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_7"},{"key":"e_1_3_2_1_20_1","volume-title":"Vector Commitments and Their Applications. In International Workshop on Public Key Cryptography, Kaoru Kurosawa and Goichiro Hanaoka (Eds.). Springer, Springer Berlin Heidelberg","author":"Catalano Dario","year":"2013","unstructured":"Dario Catalano and Dario Fiore . 2013 . Vector Commitments and Their Applications. In International Workshop on Public Key Cryptography, Kaoru Kurosawa and Goichiro Hanaoka (Eds.). Springer, Springer Berlin Heidelberg , Berlin, Heidelberg, 55--72. https:\/\/eprint.iacr.org\/ 2011\/495. Dario Catalano and Dario Fiore. 2013. Vector Commitments and Their Applications. In International Workshop on Public Key Cryptography, Kaoru Kurosawa and Goichiro Hanaoka (Eds.). Springer, Springer Berlin Heidelberg, Berlin, Heidelberg, 55--72. https:\/\/eprint.iacr.org\/2011\/495."},{"key":"e_1_3_2_1_21_1","volume-title":"Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968. https:\/\/ia.cr\/2018\/968.","author":"Chepurnoy Alexander","year":"2018","unstructured":"Alexander Chepurnoy , Charalampos Papamanthou , Shravan Srinivasan , and Yupeng Zhang . 2018 . Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968. https:\/\/ia.cr\/2018\/968. Alexander Chepurnoy, Charalampos Papamanthou, Shravan Srinivasan, and Yupeng Zhang. 2018. Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968. https:\/\/ia.cr\/2018\/968."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-97121-2_15"},{"key":"e_1_3_2_1_25_1","unstructured":"Dankrad Feist and Dmitry Khovratovich. 2020. Fast amortized Kate proofs. https:\/\/github.com\/khovratovich\/Kate.  Dankrad Feist and Dmitry Khovratovich. 2020. Fast amortized Kate proofs. https:\/\/github.com\/khovratovich\/Kate."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417244"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_30_1","volume-title":"Sovrin: digital identities in the blockchain era. Github Commit by jasonalaw October 17","author":"Khovratovich Dmitry","year":"2017","unstructured":"Dmitry Khovratovich and Jason Law . 2017. Sovrin: digital identities in the blockchain era. Github Commit by jasonalaw October 17 ( 2017 ), 38--99. Dmitry Khovratovich and Jason Law. 2017. Sovrin: digital identities in the blockchain era. Github Commit by jasonalaw October 17 (2017), 38--99."},{"key":"e_1_3_2_1_31_1","volume-title":"Lai and Giulio Malavolta","author":"Russell","year":"2019","unstructured":"Russell W.F. Lai and Giulio Malavolta . 2019 . Subvector Commitments with Application to Succinct Arguments. In Advances in Cryptology -- CRYPTO 2019, Alexandra Boldyreva and Daniele Micciancio (Eds.). Springer, Springer International Publishing , Cham, 530--560. https:\/\/eprint.iacr.org\/2018\/705. Russell W.F. Lai and Giulio Malavolta. 2019. Subvector Commitments with Application to Succinct Arguments. In Advances in Cryptology -- CRYPTO 2019, Alexandra Boldyreva and Daniele Micciancio (Eds.). Springer, Springer International Publishing, Cham, 530--560. https:\/\/eprint.iacr.org\/2018\/705."},{"key":"e_1_3_2_1_32_1","volume-title":"Universal Accumulators with Efficient Nonmembership Proofs","author":"Li Jiangtao","unstructured":"Jiangtao Li , Ninghui Li , and Rui Xue . 2007. Universal Accumulators with Efficient Nonmembership Proofs . In Applied Cryptography and Network Security, Jonathan Katz and Moti Yung (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 253--269. https:\/\/www.cs.purdue.edu\/homes\/ninghui\/papers\/ accumulator_acns07.pdf. Jiangtao Li, Ninghui Li, and Rui Xue. 2007. Universal Accumulators with Efficient Nonmembership Proofs. In Applied Cryptography and Network Security, Jonathan Katz and Moti Yung (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 253--269. https:\/\/www.cs.purdue.edu\/homes\/ninghui\/papers\/ accumulator_acns07.pdf."},{"key":"e_1_3_2_1_33_1","volume-title":"ACNS 2012, Singapore, June 26--29, 2012. Proceedings, Feng Bao, Pierangela Samarati, and Jianying Zhou (Eds.)","volume":"7341","author":"Lipmaa Helger","year":"2012","unstructured":"Helger Lipmaa . 2012 . Secure Accumulators from Euclidean Rings without Trusted Setup. In Applied Cryptography and Network Security - 10th International Conference , ACNS 2012, Singapore, June 26--29, 2012. Proceedings, Feng Bao, Pierangela Samarati, and Jianying Zhou (Eds.) , Vol. 7341 . Springer, 224--240. Helger Lipmaa. 2012. Secure Accumulators from Euclidean Rings without Trusted Setup. In Applied Cryptography and Network Security - 10th International Conference, ACNS 2012, Singapore, June 26--29, 2012. Proceedings, Feng Bao, Pierangela Samarati, and Jianying Zhou (Eds.), Vol. 7341. Springer, 224--240."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48184-2_32"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.34"},{"key":"e_1_3_2_1_36_1","unstructured":"Mitsunari Shigeo. 2020. mcl: a portable and fast pairing-based cryptography library. https:\/\/github.com\/herumi\/mcl\/ Accessed: 2020--10--14.  Mitsunari Shigeo. 2020. mcl: a portable and fast pairing-based cryptography library. https:\/\/github.com\/herumi\/mcl\/ Accessed: 2020--10--14."},{"key":"e_1_3_2_1_37_1","volume-title":"Improved Extension Protocols for Byzantine Broadcast and Agreement. In 34th International Symposium on Distributed Computing (DISC 2020) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"17","author":"Nayak Kartik","year":"2020","unstructured":"Kartik Nayak , Ling Ren , Elaine Shi , Nitin H. Vaidya , and Zhuolun Xiang . 2020 . Improved Extension Protocols for Byzantine Broadcast and Agreement. In 34th International Symposium on Distributed Computing (DISC 2020) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 28:1--28: 17 . Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, and Zhuolun Xiang. 2020. Improved Extension Protocols for Byzantine Broadcast and Agreement. In 34th International Symposium on Distributed Computing (DISC 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 28:1--28:17."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_1_39_1","volume-title":"Scaling Verifiable Computation Using Efficient Set Accumulators. In 29th USENIX Security Symposium (USENIX Security 20)","author":"Ozdemir Alex","year":"2020","unstructured":"Alex Ozdemir , Riad Wahby , Barry Whitehat , and Dan Boneh . 2020 . Scaling Verifiable Computation Using Efficient Set Accumulators. In 29th USENIX Security Symposium (USENIX Security 20) . USENIX Association , 2075--2092. https:\/\/ www.usenix.org\/conference\/usenixsecurity20\/presentation\/ozdemir Alex Ozdemir, Riad Wahby, Barry Whitehat, and Dan Boneh. 2020. Scaling Verifiable Computation Using Efficient Set Accumulators. In 29th USENIX Security Symposium (USENIX Security 20). USENIX Association, 2075--2092. https:\/\/ www.usenix.org\/conference\/usenixsecurity20\/presentation\/ozdemir"},{"key":"e_1_3_2_1_40_1","volume-title":"Cryptography for Efficiency: New Directions in Authenticated Data Structures. Ph. D. Dissertation","author":"Papamanthou Charalampos","unstructured":"Charalampos Papamanthou . 2011. Cryptography for Efficiency: New Directions in Authenticated Data Structures. Ph. D. Dissertation . Brown University, Providence, Rhode Island . https:\/\/doi.org\/10.7301\/Z0Z60M99. 10.7301\/Z0Z60M99 Charalampos Papamanthou. 2011. Cryptography for Efficiency: New Directions in Authenticated Data Structures. Ph. D. Dissertation. Brown University, Providence, Rhode Island. https:\/\/doi.org\/10.7301\/Z0Z60M99."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_6"},{"key":"e_1_3_2_1_42_1","volume-title":"Annual international cryptology conference","author":"Pedersen Torben Pryds","unstructured":"Torben Pryds Pedersen . 1991. Non-interactive and information-theoretic secure verifiable secret sharing . In Annual international cryptology conference . Springer , 129--140. Torben Pryds Pedersen. 1991. Non-interactive and information-theoretic secure verifiable secret sharing. In Annual international cryptology conference. Springer, 129--140."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66399-9_25"},{"key":"e_1_3_2_1_45_1","volume-title":"OpenSSL: The Open Source toolkit for SSL\/TLS. (April","author":"Project The","year":"2003","unstructured":"The OpenSSL Project . 2003. OpenSSL: The Open Source toolkit for SSL\/TLS. (April 2003 ). www.openssl.org. The OpenSSL Project. 2003. OpenSSL: The Open Source toolkit for SSL\/TLS. (April 2003). www.openssl.org."},{"key":"e_1_3_2_1_46_1","volume-title":"go-mcl. https:\/\/github.com\/alinush\/go-mcl. https: \/\/github.com\/alinush\/go-mcl [Online","author":"Tomescu Alin","year":"2022","unstructured":"Alin Tomescu . 2022. go-mcl. https:\/\/github.com\/alinush\/go-mcl. https: \/\/github.com\/alinush\/go-mcl [Online ; accessed 1- May - 2022 ]. Alin Tomescu. 2022. go-mcl. https:\/\/github.com\/alinush\/go-mcl. https: \/\/github.com\/alinush\/go-mcl [Online; accessed 1-May-2022]."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3345652"},{"key":"e_1_3_2_1_50_1","volume-title":"AZTEC CRS: The Biggest MPC Setup in History has Successfully Finished. https:\/\/medium.com\/aztec-protocol\/aztec-crs-thebiggest-mpc-setup-in-history-has-successfully-finished-74c6909cd0c4.","author":"Walton-Pocock Thomas","year":"2020","unstructured":"Thomas Walton-Pocock . 2020 . AZTEC CRS: The Biggest MPC Setup in History has Successfully Finished. https:\/\/medium.com\/aztec-protocol\/aztec-crs-thebiggest-mpc-setup-in-history-has-successfully-finished-74c6909cd0c4. Thomas Walton-Pocock. 2020. AZTEC CRS: The Biggest MPC Setup in History has Successfully Finished. https:\/\/medium.com\/aztec-protocol\/aztec-crs-thebiggest-mpc-setup-in-history-has-successfully-finished-74c6909cd0c4."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_13"},{"key":"e_1_3_2_1_52_1","volume-title":"The Free Encyclopedia. https:\/\/gmplib.org\/manual\/Extended-GCD","author":"Wikipedia","unstructured":"Wikipedia contributors. 2020. The GNU Multiple Precision Arithmetic Library - Wikipedia , The Free Encyclopedia. https:\/\/gmplib.org\/manual\/Extended-GCD Wikipedia contributors. 2020. The GNU Multiple Precision Arithmetic Library - Wikipedia, The Free Encyclopedia. https:\/\/gmplib.org\/manual\/Extended-GCD"},{"key":"e_1_3_2_1_53_1","volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Partial_fraction_decomposition&oldid=931350868 [Online","author":"Wikipedia","year":"2020","unstructured":"Wikipedia contributors. 2020. Partial fraction decomposition - Wikipedia , The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Partial_fraction_decomposition&oldid=931350868 [Online ; accessed 11- April 2020 ]. Wikipedia contributors. 2020. Partial fraction decomposition - Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Partial_fraction_decomposition&oldid=931350868 [Online; accessed 11-April2020]."},{"key":"e_1_3_2_1_54_1","volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Polynomial_greatest_common_divisor&oldid=993818674#B%C3% A9zout's_identity_and_extended_GCD_algorithm [Online","author":"Wikipedia","year":"2020","unstructured":"Wikipedia contributors. 2020. Polynomial greatest common divisor - Wikipedia , The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Polynomial_greatest_common_divisor&oldid=993818674#B%C3% A9zout's_identity_and_extended_GCD_algorithm [Online ; accessed 12- December- 2020 ]. Wikipedia contributors. 2020. Polynomial greatest common divisor - Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Polynomial_greatest_common_divisor&oldid=993818674#B%C3% A9zout's_identity_and_extended_GCD_algorithm [Online; accessed 12- December-2020]."},{"key":"e_1_3_2_1_55_1","volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Product_rule&oldid=992085655 [Online","author":"Wikipedia","year":"2020","unstructured":"Wikipedia contributors. 2020. Polynomial remainder theorem - Wikipedia , The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Product_rule&oldid=992085655 [Online ; accessed 03- December - 2020 ]. Wikipedia contributors. 2020. Polynomial remainder theorem - Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title= Product_rule&oldid=992085655 [Online; accessed 03-December-2020]."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e91-d.5.1489"},{"key":"e_1_3_2_1_57_1","volume-title":"An Expressive (Zero-Knowledge) Set Accumulator. In 2017 IEEE European Symposium on Security and Privacy (EuroS P). 158--173","author":"Zhang Y.","year":"2017","unstructured":"Y. Zhang , J. Katz , and C. Papamanthou . 2017 . An Expressive (Zero-Knowledge) Set Accumulator. In 2017 IEEE European Symposium on Security and Privacy (EuroS P). 158--173 . https:\/\/doi.org\/10.1109\/EuroSP. 2017 .35 10.1109\/EuroSP.2017.35 Y. Zhang, J. Katz, and C. Papamanthou. 2017. An Expressive (Zero-Knowledge) Set Accumulator. In 2017 IEEE European Symposium on Security and Privacy (EuroS P). 158--173. https:\/\/doi.org\/10.1109\/EuroSP.2017.35"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560676","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560676","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:59Z","timestamp":1750182539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":53,"alternative-id":["10.1145\/3548606.3560676","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560676","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}