{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T22:17:40Z","timestamp":1753741060409,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319941431"},{"type":"electronic","value":"9783319941448"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94144-8_24","type":"book-chapter","created":{"date-parts":[[2018,6,25]],"date-time":"2018-06-25T08:36:02Z","timestamp":1529915762000},"page":"401-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["XOR-Satisfiability Set Membership Filters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9883-4473","authenticated-orcid":false,"given":"Sean A.","family":"Weaver","sequence":"first","affiliation":[]},{"given":"Hannah J.","family":"Roberts","sequence":"additional","affiliation":[]},{"given":"Michael J.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,26]]},"reference":[{"key":"24_CR1","unstructured":"Achlioptas, D.: Random satisfiability. In: Biere et al. [5], pp. 245\u2013270"},{"key":"24_CR2","unstructured":"Albrecht, M., Bard, G.: The M4RI library (2018). https:\/\/m4ri.sagemath.org\/"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"013","DOI":"10.21468\/SciPostPhys.2.2.013","volume":"2","author":"M Azinovi\u0107","year":"2017","unstructured":"Azinovi\u0107, M., Herr, D., Heim, B., Brown, E., Troyer, M.: Assessment of quantum annealing for the construction of satisfiability filters. SciPost Phys. 2, 013 (2017). https:\/\/doi.org\/10.21468\/SciPostPhys.2.2.013","journal-title":"SciPost Phys."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-0-387-88757-9_9","volume-title":"Algebraic Cryptanalysis","author":"Gregory V. Bard","year":"2009","unstructured":"Bard, G.V.: The method of four Russians. In: Algebraic Cryptanalysis. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-88757-9_9"},{"key":"24_CR5","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Handbook of Satisfiability","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)"},{"issue":"7","key":"24_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"5","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1137\/S0097539795294165","volume":"28","author":"A Brodnik","year":"1999","unstructured":"Brodnik, A., Munro, J.I.: Membership in constant time and almost-minimum space. SIAM J. Comput. 28(5), 1627\u20131640 (1999)","journal-title":"SIAM J. Comput."},{"key":"24_CR8","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The Bloomier filter: an efficient data structure for static support lookup tables. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 30\u201339. Society for Industrial and Applied Mathematics (2004)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral Bloom filters. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 241\u2013252. ACM (2003)","DOI":"10.1145\/872757.872787"},{"key":"24_CR10","unstructured":"Collet, Y.: xxHash: extremely fast hash algorithm (2017)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-78773-0_2","volume-title":"LATIN 2008: Theoretical Informatics","author":"H Daud\u00e9","year":"2008","unstructured":"Daud\u00e9, H., Ravelomanana, V.: Random 2-XORSAT at the satisfiability threshold. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 12\u201323. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_2"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-14165-2_19","volume-title":"Automata, Languages and Programming","author":"M Dietzfelbinger","year":"2010","unstructured":"Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R., Rink, M.: Tight thresholds for cuckoo hashing via XORSAT. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 213\u2013225. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_19"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-70575-8_32","volume-title":"Automata, Languages and Programming","author":"M Dietzfelbinger","year":"2008","unstructured":"Dietzfelbinger, M., Pagh, R.: Succinct data structures for retrieval and approximate membership (Extended Abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 385\u2013396. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_32"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-24318-4_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"A Douglass","year":"2015","unstructured":"Douglass, A., King, A.D., Raymond, J.: Constructing SAT filters with a quantum annealer. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 104\u2013120. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_9"},{"key":"24_CR15","unstructured":"Erd\u0151s, P., Renyi, A.: On a classical problem of probability theory (1961)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than Bloom. In: Proceedings of the 10th ACM International Conference on emerging Networking Experiments and Technologies, pp. 75\u201388. ACM (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"24_CR17","unstructured":"Fang, C., Zhu, Z., Katzgraber, H.G.: NAE-SAT-based probabilistic membership filters. preprint arXiv:1801.06232 (2018)"},{"key":"24_CR18","unstructured":"Goh, E.J., et al.: Secure indexes. IACR Cryptology ePrint Archive 2004, 216 (2004)"},{"key":"24_CR19","first-page":"99","volume":"4","author":"MJ Heule","year":"2008","unstructured":"Heule, M.J., van Maaren, H.: Parallel SAT solving using bit-level operations. J. Satisf. Boolean Model. Comput. 4, 99\u2013116 (2008)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/1.9781611973099.62","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Morteza Ibrahimi","year":"2012","unstructured":"Ibrahimi, M., Kanoria, Y., Kraning, M., Montanari, A.: The set of solutions of random XORSAT formulae. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 760\u2013779. SIAM (2012)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Kader, A.A., Dorojevets, M.: Novel integration of Dimetheus and WalkSAT solvers for k-SAT filter construction. In: Systems, Applications and Technology Conference (LISAT 2017), pp. 1\u20135. IEEE (2017)","DOI":"10.1109\/LISAT.2017.8001989"},{"issue":"1","key":"24_CR22","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1080\/15427951.2011.560785","volume":"7","author":"E Krimer","year":"2011","unstructured":"Krimer, E., Erez, M.: The power of $$1 + \\alpha $$ for memory-efficient Bloom filters. Internet Math. 7(1), 28\u201344 (2011)","journal-title":"Internet Math."},{"key":"24_CR23","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: AAAI 1992, pp. 459\u2013465 (1992)"},{"issue":"5","key":"24_CR24","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TNET.2002.803864","volume":"10","author":"MD Mitzenmacher","year":"2002","unstructured":"Mitzenmacher, M.D.: Compressed Bloom filters. IEEE\/ACM Trans. Netw. (TON) 10(5), 604\u2013612 (2002)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"issue":"02","key":"24_CR25","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1017\/S0963548315000097","volume":"25","author":"B Pittel","year":"2016","unstructured":"Pittel, B., Sorkin, G.B.: The satisfiability threshold for k-XORSAT. Comb. Probab. Comput. 25(02), 236\u2013268 (2016)","journal-title":"Comb. Probab. Comput."},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-03351-3_25","volume-title":"Computer Science - Theory and Applications","author":"E Porat","year":"2009","unstructured":"Porat, E.: An optimal Bloom filter replacement based on matrix solving. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 263\u2013273. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03351-3_25"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Pouliot, D., Wright, C.V.: The shadow nemesis: inference attacks on efficiently deployable, efficiently searchable encryption. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1341\u20131352. ACM (2016)","DOI":"10.1145\/2976749.2978401"},{"key":"24_CR28","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1498698.1594230","volume":"14","author":"F Putze","year":"2009","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash-, and space-efficient Bloom filters. J. Exp. Algorithmics 14, 4 (2009)","journal-title":"J. Exp. Algorithmics"},{"issue":"3","key":"24_CR29","first-page":"487","volume":"194","author":"VL Arlazarov","year":"1970","unstructured":"Arlazarov, V.L., Dinitz, Y.A., Kronrod, M.A., Faradzev, I.A.: On economical construction of transitive closure of an oriented graph. Dokl. Akad. Nauk SSSR 194(3), 487 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"24_CR30","unstructured":"Walker, A.: Filters. Master\u2019s thesis, Haverford College (2007). http:\/\/math.uchicago.edu\/~akwalker\/filtersFinal.pdf"},{"key":"24_CR31","first-page":"129","volume":"8","author":"SA Weaver","year":"2014","unstructured":"Weaver, S.A., Ray, K.J., Marek, V.W., Mayer, A.J., Walker, A.K.: Satisfiability-based set membership filters. J. Satisf. Boolean Model. Comput. 8, 129\u2013148 (2014)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"24_CR32","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: USENIX Security Symposium, pp. 707\u2013720 (2016)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94144-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:14:39Z","timestamp":1710324879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94144-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319941431","9783319941448"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94144-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"26 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2018.azurewebsites.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"58","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":"20","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":"4","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":"34% - 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":"4","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":"7","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":"2 tool papers were accepted","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)"}}]}}