{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:43:25Z","timestamp":1780069405609,"version":"3.54.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159817","type":"print"},{"value":"9783031159824","type":"electronic"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15982-4_16","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T04:40:54Z","timestamp":1665463254000},"page":"473-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Nearly Optimal Property Preserving Hashing"],"prefix":"10.1007","author":[{"given":"Justin","family":"Holmgren","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minghao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"LaKyah","family":"Tyner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press (1996)","DOI":"10.1145\/237814.237838"},{"key":"16_CR2","unstructured":"Apple csam detection. https:\/\/www.apple.com\/child-safety\/pdf\/CSAM_Detection_Technical_Summary.pdf. Accessed 13 Feb 2022"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Kimmel, P.G.: Randomized simultaneous messages: solution of a problem of yao in communication complexity. In: Twelfth Annual IEEE Conference on Proceedings of Computational Complexity, pp. 239\u2013246 (1997)","DOI":"10.1109\/CCC.1997.612319"},{"key":"16_CR4","unstructured":"Boyle, E., LaVigne, R., Vaikuntanathan, V.: Adversarially robust property-preserving hash functions. In: Blum, A., (ed.) ITCS 2019, vol. 124, pp. 16:1\u201316:20. LIPIcs (2019)"},{"key":"16_CR5","unstructured":"Blokh, E.L., Zyablov, V.: Linear concatenated codes. Nauka (1982)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, S.P., Naor, M.: Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols. Cryptol. ePrint Arch. Paper 2022\/312, 2022. https:\/\/eprint.iacr.org\/2022\/312","DOI":"10.1007\/978-3-031-15982-4_9"},{"key":"16_CR7","unstructured":"Apple\u2019s csam detection tech is under fire - again. https:\/\/techcrunch.com\/2021\/08\/18\/apples-csam-detection-tech-is-under-fire-again\/. Accessed 13 Feb 2022"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Fleischhacker, N., Larsen, K.G., Simkin, M.: Property-preserving hash functions from standard assumptions. EUROCRYPT (2022)","DOI":"10.1007\/978-3-031-07085-3_26"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-77883-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"N Fleischhacker","year":"2021","unstructured":"Fleischhacker, N., Simkin, M.: Robust property-preserving hash functions for hamming distance and more. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 311\u2013337. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_11"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Hastad, J., Kopparty, S.: On the list-decodability of random linear codes. In: Schulman, L.J. (ed.) Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5\u20138 June 2010, pp. 409\u2013416. ACM (2010)","DOI":"10.1145\/1806689.1806747"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TIT.2008.2008124","volume":"55","author":"V Guruswami","year":"2009","unstructured":"Guruswami, V., Rudra, A.: Better binary list decodable codes via multilevel concatenation. IEEE Trans. Inf. Theory 55(1), 19\u201326 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Vitter, J.S., (ed.) Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23\u201326, 1998, pp. 604\u2013613. ACM (1998)","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539798347177","volume":"30","author":"E Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2), 457\u2013474 (2000)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1137\/050646858","volume":"21","author":"R Motwani","year":"2007","unstructured":"Motwani, R., Naor, A., Panigrahy, R.: Lower bounds on locality sensitive hashing. SIAM J. Discret. Math. 21(4), 930\u2013935 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Mironov, I., Naor, M., Segev, G.: Sketching in adversarial environments. In: Ladner, R.E., Dwork, C., (eds.) 40th ACM STOC, pp. 651\u2013660. ACM Press, May 2008","DOI":"10.1145\/1374376.1374471"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Newman, I., Szegedym M.: Public versus private coin flips in one round communication games (extended abstract). In: 28th ACM STOC, pp. 561\u2013570. ACM Press, May 1996","DOI":"10.1145\/237814.238004"},{"key":"16_CR18","unstructured":"Apple wants to protect children. but it\u2019s creating serious privacy risks. https:\/\/www.nytimes.com\/2021\/08\/11\/opinion\/apple-iphones-privacy.html. Accessed 13 Feb 2022"},{"key":"16_CR19","unstructured":"O\u2019Donnell, R., Wu, Y., Zhou, Y.: Optimal lower bounds for locality sensitive hashing (except when q is tiny). In: Chazelle, B. (ed.) Innovations in Computer Science - ICS 2011. Tsinghua University, Beijing, China, January 7\u20139, 2011. Proceedings, pp. 275\u2013283. Tsinghua University Press (2011)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TIT.1960.1057586","volume":"6","author":"W Peterson","year":"1960","unstructured":"Peterson, W.: Encoding and error-correction procedures for the Bose-Chaudhuri codes. IRE Trans. Inf. Theory 6(4), 459\u2013470 (1960)","journal-title":"IRE Trans. Inf. Theory"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. SIAM J. Comput. 50(3) (2021)","DOI":"10.1137\/16M1096773"},{"key":"16_CR23","unstructured":"Apple adds a backdoor to imessage and icloud storage. https:\/\/www.schneier.com\/blog\/archives\/2021\/08\/apple-adds-a-backdoor-to-imesssage-and-icloud-storage.html. Accessed 13 Feb 2022"},{"key":"16_CR24","unstructured":"Apple\u2019s neuralhash algorithm has been reverse-engineered. https:\/\/www.schneier.com\/blog\/archives\/2021\/08\/apples-neuralhash-algorithm-has-been-reverse-engineered.html. Accessed 13 Feb 2022"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15982-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:06:10Z","timestamp":1760133970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15982-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159817","9783031159824"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15982-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, 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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}