{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T20:48:54Z","timestamp":1770497334361,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2312241, 2154170, 2247305"],"award-info":[{"award-number":["2312241, 2154170, 2247305"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690199","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"4271-4285","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["RSA-Based Dynamic Accumulator without Hashing into Primes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1887-6396","authenticated-orcid":false,"given":"Victor Youdom","family":"Kemmoe","sequence":"first","affiliation":[{"name":"Brown University, Providence, Rhode Island, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3567-3550","authenticated-orcid":false,"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[{"name":"Brown University, Providence, Rhode Island, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00862-7_20"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-40186-3_27"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2017.13"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--57722--2_4"},{"key":"e_1_3_2_1_5_1","volume-title":"Advances in Cryptology -- EUROCRYPT '97","author":"Bari\u00e7 Niko","unstructured":"Niko Bari\u00e7 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_6_1","doi-asserted-by":"publisher","unstructured":"Elaine Barker. 2020. Recommendation for key management:: part 1 - general. https:\/\/doi.org\/10.6028\/nist.sp.800--57pt1r5","DOI":"10.6028\/nist.sp.800--57pt1r5"},{"key":"e_1_3_2_1_7_1","volume-title":"Advances in Cryptology -- EUROCRYPT '93","author":"Benaloh Josh","unstructured":"Josh Benaloh and Michael de Mare. 1994. 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."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.62056\/av7tudhdj"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2002-10304"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14712-8_11"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0169--2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_27"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/647086.715698"},{"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\/3-540-36413-7_20"},{"key":"e_1_3_2_1_18_1","volume-title":"Wallach","author":"Crosby Scott A.","year":"2009","unstructured":"Scott A. Crosby and Dan S. Wallach. 2009. Efficient data structures for tamper-evident logging (SSYM'09). USENIX Association, USA, 317--334."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16715-2_7"},{"key":"e_1_3_2_1_20_1","volume-title":"Advances in Cryptology -- CRYPTO' 86, Andrew M","author":"Fiat Amos","unstructured":"Amos Fiat and Adi Shamir. 1987. How To Prove Yourself: Practical Solutions to Identification and Signature Problems. In Advances in Cryptology -- CRYPTO' 86, Andrew M. Odlyzko (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 186--194."},{"key":"e_1_3_2_1_21_1","volume-title":"Advances in Cryptology -- EUROCRYPT '99","author":"Gennaro Rosario","unstructured":"Rosario Gennaro, Shai Halevi, and Tal Rabin. 1999. Secure Hash-and-Sign Signatures Without the Random Oracle. In Advances in Cryptology -- EUROCRYPT '99, Jacques Stern (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 123--139."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_3"},{"key":"e_1_3_2_1_23_1","unstructured":"Victor Youdom Kemmoe and Anna Lysyanskaya. 2024. RSA-Based Dynamic Accumulator without Hashing into Primes. Cryptology ePrint Archive Paper 2024\/505. https:\/\/eprint.iacr.org\/2024\/505"},{"key":"e_1_3_2_1_24_1","volume-title":"CRLite: A Scalable System For Pushing All TLS Revocations To Browsers. In IEEE Symposium on Security and Privacy","author":"Larisch James","year":"2017","unstructured":"James Larisch, David Choffnes, Dave Levin, Bruce M. Maggs, Alan Mislove, and Christo Wilson. 2017. CRLite: A Scalable System For Pushing All TLS Revocations To Browsers. In IEEE Symposium on Security and Privacy. San Jose, California, USA."},{"key":"e_1_3_2_1_25_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."},{"key":"e_1_3_2_1_26_1","volume-title":"Secure Accumulators from Euclidean Rings without Trusted Setup","author":"Lipmaa Helger","unstructured":"Helger Lipmaa. 2012. Secure Accumulators from Euclidean Rings without Trusted Setup. In Applied Cryptography and Network Security, Feng Bao, Pierangela Samarati, and Jianying Zhou (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 224--240."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815675.2815685"},{"key":"e_1_3_2_1_28_1","volume-title":"Signature schemes and applications to cryptographic protocol design. Ph.,D. Dissertation","author":"Lysyanskaya Anna","unstructured":"Anna Lysyanskaya. 2002. Signature schemes and applications to cryptographic protocol design. Ph.,D. Dissertation. Massachusetts Institute of Technology, Cambridge, Massachusetts."},{"key":"e_1_3_2_1_29_1","first-page":"269","article-title":"A fully dynamic universal accumulator","volume":"14","author":"Mashatan Atefeh","year":"2013","unstructured":"Atefeh Mashatan and Serge Vaudenay. 2013. A fully dynamic universal accumulator. Proceedings Of The Romanian Academy Series A-Mathematics Physics Technical Sciences Information Science, Vol. 14 (2013), 269--285.","journal-title":"Proceedings Of The Romanian Academy Series A-Mathematics Physics Technical Sciences Information Science"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_1_31_1","volume-title":"2010 International Conference on Security and Cryptography (SECRYPT)","author":"Peng Kun","year":"2010","unstructured":"Kun Peng and Feng Bao. 2010. Vulnerability of a non-membership proof scheme. 2010 International Conference on Security and Cryptography (SECRYPT) (2010), 1--4. https:\/\/api.semanticscholar.org\/CorpusID:9867111"},{"key":"e_1_3_2_1_32_1","volume-title":"Security and Cryptography for Networks","author":"Reyzin Leonid","unstructured":"Leonid Reyzin and Sophia Yakoubov. 2016. Efficient Asynchronous Accumulators for Distributed PKI. In Security and Cryptography for Networks, Vassilis Zikas and Roberto De Prisco (Eds.). Springer International Publishing, Cham, 292--309."},{"key":"e_1_3_2_1_33_1","volume-title":"On the generation of cryptographically strong pseudo-random sequences","author":"Shamir Adi","unstructured":"Adi Shamir. 1981. On the generation of cryptographically strong pseudo-random sequences. In Automata, Languages and Programming, Shimon Even and Oded Kariv (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 544--550."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-020-09364-x"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690199","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:54:26Z","timestamp":1755842066000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":34,"alternative-id":["10.1145\/3658644.3690199","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690199","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}