{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:17:39Z","timestamp":1766441859150,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765572","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:33:16Z","timestamp":1763854396000},"page":"4869-4871","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Turning Uncertainty into Efficiency: Toward Practical, Quantum-Resistant Verifiable Privacy Tools"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4701-2768","authenticated-orcid":false,"given":"Jie","family":"Xu","sequence":"first","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58751-1_16"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_10"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-0894-2_7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--57990--6_18"},{"key":"e_1_3_2_1_5_1","volume-title":"Simple amortized proofs of shortness for linear relations over polynomial rings. Cryptology ePrint Archive","author":"Baum Carsten","year":"2017","unstructured":"Carsten Baum and Vadim Lyubashevsky. 2017. Simple amortized proofs of shortness for linear relations over polynomial rings. Cryptology ePrint Archive (2017)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-64331-0_29"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38554-4_16"},{"key":"e_1_3_2_1_9_1","unstructured":"Muhammed F. Esgin Ron Steinfeld Erkan Tairi and Jie Xu. 2024. LeOPaRd: Towards Practical Post-Quantum Oblivious PRFs via Interactive Lattice Problems. Cryptology ePrint Archive Paper 2024\/1615. https:\/\/eprint.iacr.org\/2024\/1615"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Dnnis Faut Julia Hesse Lisa Kohl and Andy Rupp. 2025. Scalable and Fine-Tuned Privacy Pass from Group Verifiable Random Functions. Cryptology ePrint Archive Paper 2025\/659. https:\/\/eprint.iacr.org\/2025\/659","DOI":"10.1109\/EuroSP63326.2025.00012"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"e_1_3_2_1_12_1","unstructured":"Nethermind. 2024. Latticefold and lattice-based operations performance report. https:\/\/nethermind.notion.site\/Latticefold-and-lattice-based-operationsperformance-report-153360fc38d080ac930cdeeffed69559."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:15:29Z","timestamp":1766441729000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":12,"alternative-id":["10.1145\/3719027.3765572","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765572","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}