{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T19:10:11Z","timestamp":1755976211000,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["HR001120C0156"],"award-info":[{"award-number":["HR001120C0156"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,11,19]]},"DOI":"10.1145\/3689938.3694777","type":"proceedings-article","created":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T18:21:37Z","timestamp":1732040497000},"page":"29-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Single-Server Delegation of NTT with Application to Crystals-Kyber"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5138-1144","authenticated-orcid":false,"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[{"name":"Peraton Labs, Basking Ridge, New Jersey, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2205-6294","authenticated-orcid":false,"given":"Matluba","family":"Khodjaeva","sequence":"additional","affiliation":[{"name":"CUNY John Jay College of Criminal Justice, New York, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0827-0932","authenticated-orcid":false,"given":"Dilan D.","family":"Morales Caro","sequence":"additional","affiliation":[{"name":"CUNY John Jay College of Criminal Justice, New York, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5467-7832","authenticated-orcid":false,"given":"Delaram","family":"Kahrobaei","sequence":"additional","affiliation":[{"name":"Queens College, City University of New York, Queens, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"21","volume-title":"On Hiding Information from an Oracle In: J. of Computer and System Sciences, vol 39(1)","author":"Abadi M.","year":"1989","unstructured":"M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle In: J. of Computer and System Sciences, vol 39(1), pp. 21--50 (1989)"},{"key":"e_1_3_2_1_2_1","first-page":"284","volume-title":"Proc. of ACM STOC","author":"Ajtai M.","year":"1997","unstructured":"M. Ajtai and C. Dwork, A Public-Key Cryptosystem with Worst-Case\/AverageCase Equivalence, in Proc. of ACM STOC 1997, pp. 284--293"},{"key":"e_1_3_2_1_3_1","volume-title":"NIST PQC","author":"Avanzi R.","year":"2021","unstructured":"R. Avanzi, J. Bos, L. Ducas, E. Kiltz, T. Lepont, V. Lyubashevsky, J. M. Schanck, P. Schwabe, G. Seiler, and D. Stehle. Crystals-Kyber: Algorithm Specifications and supporting documentation, version 3.02, NIST PQC, 2021"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1975.9791"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-6148-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-014-0236-y"},{"key":"e_1_3_2_1_7_1","volume-title":"Supporting documentation: Crystals-kyber: Algorithm specifications and supporting documentation (version 3.0)","author":"Avanzi R.","year":"2020","unstructured":"R. Avanzi, J. W. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J. M. Schanck, P. Schwabe, G. Seiler, and D. Stehl\u00e9. Supporting documentation: Crystals-kyber: Algorithm specifications and supporting documentation (version 3.0). In: NIST PQC, 2020."},{"key":"e_1_3_2_1_8_1","first-page":"469","volume-title":"A Flexible Shared Hardware Accelerator for NIST-Recommended Algorithms CRYSTALS-Kyber and CRYSTALS-Dilithium with SCA Protection. in Proc. of CT-RSA","author":"Beckwith L.","year":"2023","unstructured":"L. Beckwith, A. Abdulgadir, and R. Azarderakhsh. A Flexible Shared Hardware Accelerator for NIST-Recommended Algorithms CRYSTALS-Kyber and CRYSTALS-Dilithium with SCA Protection. in Proc. of CT-RSA 2023, pp. 469- 490"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"e_1_3_2_1_10_1","first-page":"575","volume-title":"Proc. of ACM STOC","author":"Brakerski Z.","year":"2013","unstructured":"Z. Brakerski, A. Langlois, C. Peikert, O. Regev, D. Stehl\u00e9, Classical hardness of learning with errors, in Proc. of ACM STOC 2013, pp. 575--584"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"volume-title":"Proc, of RFIDSec 2015: 156--173, LNCS","author":"Cavallo B.","key":"e_1_3_2_1_12_1","unstructured":"B. Cavallo, G. Di Crescenzo, D. Kahrobaei, and V. Shpilrain. Efficient and Secure Delegation of Group Exponentiation to a Single Server, in Proc, of RFIDSec 2015: 156--173, LNCS, Springer."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1969-0249212-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.09.038"},{"key":"e_1_3_2_1_15_1","volume-title":"Inside the FFT black box: serial and parallel fast Fourier transform algorithms","author":"Chu E.","year":"1999","unstructured":"E. Chu and A. George. Inside the FFT black box: serial and parallel fast Fourier transform algorithms. In: CRC press, 1999."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2017.8228702"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-05578-2_3"},{"key":"e_1_3_2_1_19_1","volume-title":"On Single-Server Delegation of RSA. In: Proc. of Innovative Security Solutions for Information Technology and Communications. SecITC","author":"Crescenzo G. Di","year":"2022","unstructured":"G. Di Crescenzo, M. Khodjaeva, T. Chen, R. Krishnan, D. Shur, D. Kahrobaei, and V. Shpilrain. On Single-Server Delegation of RSA. In: Proc. of Innovative Security Solutions for Information Technology and Communications. SecITC 2022. LNCS, vol 13809. Springer, Cham."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-54129-2_14"},{"volume-title":"Proc. of CRYPTO 1985:  477--488","author":"Feigenbaum J.","key":"e_1_3_2_1_21_1","unstructured":"J. Feigenbaum. Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?, in Proc. of CRYPTO 1985: 477--488"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900021"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9114-1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1464291.1464352"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_15"},{"key":"e_1_3_2_1_27_1","volume-title":"An Efficient Small Modulus Test and Its Applications to Delegated Computation without Preprocessing","author":"Khodjaeva M.","year":"2023","unstructured":"M. Khodjaeva and G. Di Crescenzo. An Efficient Small Modulus Test and Its Applications to Delegated Computation without Preprocessing. In: Innovative Security Solutions for Information Technology and Communications. SecITC 2023. LNCS, vol 14534. Springer, Cham."},{"volume-title":"On Single-Server Delegation Without Precomputation. In: Proc. of 20th Int. Conf. on Security and Cryptography. SECRYPT 2023. ScitePress.","author":"Khodjaeva M.","key":"e_1_3_2_1_28_1","unstructured":"M. Khodjaeva and G. Di Crescenzo. On Single-Server Delegation Without Precomputation. In: Proc. of 20th Int. Conf. on Security and Cryptography. SECRYPT 2023. ScitePress."},{"key":"e_1_3_2_1_29_1","volume-title":"Seminumerical algorithms. In: Addison-Wesley Professional","author":"Knuth D. E","year":"2014","unstructured":"D. E Knuth. Art of computer programming, volume 2: Seminumerical algorithms. In: Addison-Wesley Professional, 2014."},{"key":"e_1_3_2_1_30_1","unstructured":"A. A. Karatsuba and Y. Ofman. Multiplication of many-digital numbers by automatic computers. In: Doklady Akademii Nauk 145(2):293--294."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"e_1_3_2_1_32_1","first-page":"1519","volume-title":"Proc. of 28th USENIX Security Symposium","author":"Kumar S.","year":"2019","unstructured":"S. Kumar, Y. Hu, M. P. Andersen, R. A. Popa, and D. E. Culler. JEDI: Manyto-Many End-to-End Encryption and Key Delegation for IoT, in Proc. of 28th USENIX Security Symposium, pp. 1519--1536, 2019."},{"key":"e_1_3_2_1_33_1","volume-title":"Number theoretic transform and its applications in latticebased cryptosystems: A survey. In: arXiv preprint arXiv:2211.13546","author":"Liang Z.","year":"2022","unstructured":"Z. Liang and Y. Zhao. Number theoretic transform and its applications in latticebased cryptosystems: A survey. In: arXiv preprint arXiv:2211.13546, 2022."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535925"},{"key":"e_1_3_2_1_36_1","first-page":"497","volume-title":"Proc. of CRYPTO","author":"Matsumoto T.","year":"1988","unstructured":"T. Matsumoto, K. Kato, and H. Imai. An improved algorithm for secure outsourcing of modular exponentiations. In: Proc. of CRYPTO 1988, pp. 497--506, LNCS, Springer."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39799-X_31"},{"key":"e_1_3_2_1_38_1","volume-title":"round 1 submissions. https:\/\/csrc.nist.gov\/ Projects\/Post-Quantum-Cryptography\/round-1-submissions","author":"NIST.","year":"2016","unstructured":"NIST. Post-quantum cryptography, round 1 submissions. https:\/\/csrc.nist.gov\/ Projects\/Post-Quantum-Cryptography\/round-1-submissions, 2016."},{"key":"e_1_3_2_1_39_1","volume-title":"round 2 submissions. https:\/\/csrc.nist.gov\/ Projects\/Post-Quantum-Cryptography\/round-2-submissions","author":"NIST.","year":"2019","unstructured":"NIST. Post-quantum cryptography, round 2 submissions. https:\/\/csrc.nist.gov\/ Projects\/Post-Quantum-Cryptography\/round-2-submissions, 2019."},{"key":"e_1_3_2_1_40_1","volume-title":"round 3 submissions. https:\/\/csrc.nist.gov\/ Projects\/Post-Quantum-Cryptography\/round-3-submissions","author":"NIST.","year":"2020","unstructured":"NIST. Post-quantum cryptography, round 3 submissions. https:\/\/csrc.nist.gov\/ Projects\/Post-Quantum-Cryptography\/round-3-submissions, 2020."},{"key":"e_1_3_2_1_41_1","volume-title":"Announcing four candidates to be standardized, plus fourth round candidates. https:\/\/csrc.nist.gov\/News\/2022\/pqccandidates-to-be-standardized-and-round-4","author":"NIST.","year":"2022","unstructured":"NIST. Pqc standardization process: Announcing four candidates to be standardized, plus fourth round candidates. https:\/\/csrc.nist.gov\/News\/2022\/pqccandidates-to-be-standardized-and-round-4, 2022."},{"key":"e_1_3_2_1_42_1","volume-title":"Aug","author":"NIST. FIPS","year":"2024","unstructured":"NIST. FIPS 203. Module-Lattice-Based Key-Encapsulation Mechanism Standard. https:\/\/csrc.nist.gov\/pubs\/fips\/203\/final, Aug 2024."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536461"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1971-0301966-0"},{"key":"e_1_3_2_1_45_1","unstructured":"G. Pope (n.d.). kyber-py: A pure Python implementation of the Kyber postquantum cryptography algorithm. GitHub repository. Retrieved from https: \/\/github.com\/GiacomoPope\/kyber-py"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158363"},{"key":"e_1_3_2_1_49_1","first-page":"124","volume-title":"Algorithms for Quantum Computation: Discrete Logarithms and Factoring. in Proc. of the 35th Annual Symposium on Foundations of Computer Science","author":"Shor P. W.","year":"1984","unstructured":"P. W. Shor. Algorithms for Quantum Computation: Discrete Logarithms and Factoring. in Proc. of the 35th Annual Symposium on Foundations of Computer Science, pp. 124--134, 1984"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC51071.2022.9771654"},{"key":"e_1_3_2_1_51_1","volume-title":"Energy-Efficient Hardening of the SEDIMENT Methodology for Scalable IoT Network Security. in Proc. of IEEE Int. Conf. on Cyber-Security and Resilience","author":"Shur D.","year":"2024","unstructured":"D. Shur, G. Di Crescenzo, T. Chen, Z. Patni, Y.J. Lin, S. Alexander, B. Flin, and R. Levonas. Energy-Efficient Hardening of the SEDIMENT Methodology for Scalable IoT Network Security. in Proc. of IEEE Int. Conf. on Cyber-Security and Resilience, 2024"},{"key":"e_1_3_2_1_52_1","volume-title":"Fast Number Theoretic Transform","author":"Sun Q.","year":"1980","unstructured":"Q. Sun, D. Zheng, and Z. Shen. Fast Number Theoretic Transform. In: China Science Press, 1980."},{"key":"e_1_3_2_1_53_1","volume-title":"Soviet Mathematics Doklady, 3(4):714--716","author":"Toom L.","year":"1963","unstructured":"L. Toom. The complexity of a scheme of functional elements realizing the multiplication of integers. In: Soviet Mathematics Doklady, 3(4):714--716, 1963."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75651-4_6"},{"key":"e_1_3_2_1_55_1","volume-title":"IACR Cryptol. ePrint Arch.","author":"Weimerskirch A.","year":"2006","unstructured":"A. Weimerskirch, and C. Paar. Generalizations of the karatsuba algorithm for efficient implementations. In: IACR Cryptol. ePrint Arch., 2006:224, 2006."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6571-3"},{"key":"e_1_3_2_1_57_1","unstructured":"J. Zhang X. Cheng L. Yang J. Hu X. Liu K. Chen SoK: Fully Homomorphic Encryption Accelerators. In: CoRR abs\/2212.01713 (2022)"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Salt Lake City UT USA","acronym":"CCS '24"},"container-title":["Proceedings of the 2024 on Cloud Computing Security Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689938.3694777","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689938.3694777","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689938.3694777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T18:43:50Z","timestamp":1755974630000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689938.3694777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,19]]},"references-count":57,"alternative-id":["10.1145\/3689938.3694777","10.1145\/3689938"],"URL":"https:\/\/doi.org\/10.1145\/3689938.3694777","relation":{},"subject":[],"published":{"date-parts":[[2024,11,19]]},"assertion":[{"value":"2024-11-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}