{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:36:12Z","timestamp":1764570972108,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030900182"},{"type":"electronic","value":"9783030900199"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90019-9_17","type":"book-chapter","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T18:47:48Z","timestamp":1635878868000},"page":"332-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cryptonomial: A Framework for Private Time-Series Polynomial Calculations"],"prefix":"10.1007","author":[{"given":"Ryan","family":"Karl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Takeshita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alamin","family":"Mohammed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Striegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taeho","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,3]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TSG.2016.2553647","volume":"9","author":"A Abdallah","year":"2016","unstructured":"Abdallah, A., Shen, X.S.: A lightweight lattice-based homomorphic privacy-preserving data aggregation scheme for smart grid. IEEE Trans. Smart Grid 9(1), 396\u2013405 (2016)","journal-title":"IEEE Trans. Smart Grid"},{"doi-asserted-by":"crossref","unstructured":"Becker, D., Guajardo, J., Zimmermann, K.H.: Revisiting private stream aggregation: lattice-based PSA. In: NDSS (2018)","key":"17_CR2","DOI":"10.14722\/ndss.2018.23120"},{"doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Lindell, Y., Omri, E.: Optimizing semi-honest secure multiparty computation for the internet. In: CCS, pp. 578\u2013590. ACM (2016)","key":"17_CR3","DOI":"10.1145\/2976749.2978347"},{"doi-asserted-by":"crossref","unstructured":"Blanton, M.: Achieving full security in privacy-preserving data mining. In: SocialCom, pp. 925\u2013934. IEEE (2011)","key":"17_CR4","DOI":"10.1109\/PASSAT\/SocialCom.2011.12"},{"doi-asserted-by":"crossref","unstructured":"Bonneau, J.: The science of guessing: analyzing an anonymized corpus of 70 million passwords. In: IEEE Symposium on Security and Privacy, pp. 538\u2013552. IEEE (2012)","key":"17_CR5","DOI":"10.1109\/SP.2012.49"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45682-1_22","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"Y-C Chang","year":"2001","unstructured":"Chang, Y.-C., Lu, C.-J.: Oblivious polynomial evaluation and oblivious neural learning. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 369\u2013384. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_22"},{"unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.S.: Floating-point homomorphic encryption. IACR Cryptology ePrint Archive 2016\/421 (2016)","key":"17_CR7"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"132665","DOI":"10.1109\/ACCESS.2020.3010287","volume":"8","author":"ME Chowdhury","year":"2020","unstructured":"Chowdhury, M.E., et al.: Can AI help in screening viral and COVID-19 pneumonia? IEEE Access 8, 132665\u2013132676 (2020)","journal-title":"IEEE Access"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-030-20074-9_7","volume-title":"Information Security Theory and Practice","author":"L Cianciullo","year":"2019","unstructured":"Cianciullo, L., Ghodosi, H.: Efficient information theoretic multi-party computation from oblivious linear evaluation. In: Blazy, O., Yeun, C.Y. (eds.) WISTP 2018. LNCS, vol. 11469, pp. 78\u201390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20074-9_7"},{"unstructured":"Costan, V., Devadas, S.: Intel SGX explained. IACR Cryptology ePrint Archive 2016(086), 1\u2013118 (2016)","key":"17_CR10"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-21554-4_8","volume-title":"Applied Cryptography and Network Security","author":"D Dachman-Soled","year":"2011","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Secure efficient multiparty computing of multivariate polynomials and applications. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 130\u2013146. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21554-4_8"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-13708-2_15","volume-title":"Applied Cryptography and Network Security","author":"M Franklin","year":"2010","unstructured":"Franklin, M., Mohassel, P.: Efficient and secure evaluation of multivariate polynomials and applications. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol. 6123, pp. 236\u2013254. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13708-2_15"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00145-017-9263-y","volume":"31","author":"C Hazay","year":"2018","unstructured":"Hazay, C.: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. J. Cryptol. 31(2), 537\u2013586 (2018)","journal-title":"J. Cryptol."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-642-15031-9_26","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"K J\u00e4rvinen","year":"2010","unstructured":"J\u00e4rvinen, K., Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Garbled circuits for leakage-resilience: hardware implementation and evaluation of one-time programs. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 383\u2013397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15031-9_26"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-39884-1_10","volume-title":"Financial Cryptography and Data Security","author":"M Joye","year":"2013","unstructured":"Joye, M., Libert, B.: A scalable scheme for privacy-preserving aggregation of time-series data. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 111\u2013125. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39884-1_10"},{"doi-asserted-by":"crossref","unstructured":"Jung, T., Mao, X., Li, X., Tang, S., Gong, W., Zhang, L.: Privacy-preserving data aggregation without secure channel: multivariate polynomial evaluation. In: IEEE INFOCOM (2013)","key":"17_CR16","DOI":"10.1109\/INFCOM.2013.6567071"},{"issue":"2","key":"17_CR17","first-page":"260","volume":"15","author":"T Jung","year":"2018","unstructured":"Jung, T., Han, J., Li, X.Y.: PDA: semantically secure time-series data analytics with dynamic user groups. TDSC 15(2), 260\u2013274 (2018)","journal-title":"TDSC"},{"key":"17_CR18","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-37231-6_25","volume-title":"Security and Privacy in Communication Networks","author":"R Karl","year":"2019","unstructured":"Karl, R., Burchfield, T., Takeshita, J., Jung, T.: Non-interactive MPC with trusted hardware secure against residual function attacks. In: Chen, S., Choo, K.-K.R., Fu, X., Lou, W., Mohaisen, A. (eds.) SecureComm 2019. LNICST, vol. 305, pp. 425\u2013439. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-37231-6_25"},{"unstructured":"Karl, R., Takeshita, J., Jung, T.: Cryptonite: a framework for flexible time-series secure aggregation with online fault tolerance. IACR Cryptology ePrint Archive 2020\/1561 (2020)","key":"17_CR19"},{"unstructured":"Karl, R., Takeshita, J., Mohammed, A., Striegel, A., Jung, T.: Cryptonomial: a framework for private time-series polynomial calculations. Cryptology ePrint Archive, Report 2021\/473 (2021). https:\/\/eprint.iacr.org\/2021\/473","key":"17_CR20"},{"doi-asserted-by":"crossref","unstructured":"Lu, W., Kawasaki, S., Sakuma, J.: Using fully homomorphic encryption for statistical analysis of categorical, ordinal and numerical data. IACR Cryptology ePrint Archive 2016\/1163 (2016)","key":"17_CR21","DOI":"10.14722\/ndss.2017.23119"},{"issue":"6","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM (JACM) 60(6), 1\u201335 (2013)","journal-title":"J. ACM (JACM)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"issue":"1","key":"17_CR24","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cmpb.2009.01.003","volume":"95","author":"I Maglogiannis","year":"2009","unstructured":"Maglogiannis, I., Loukis, E., Zafiropoulos, E., Stasis, A.: Support vectors machine-based identification of heart valve diseases using heart sounds. Comput. Methods Programs Biomed. 95(1), 47\u201361 (2009)","journal-title":"Comput. Methods Programs Biomed."},{"issue":"5","key":"17_CR25","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput. 35(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"\u00d6zarar, M., \u00d6zgit, A.: Secure multiparty computation via oblivious polynomial evaluation. In: Theory and Practice of Cryptography Solutions for Secure Information Systems, pp. 253\u2013278. IGI Global (2013)","key":"17_CR26","DOI":"10.4018\/978-1-4666-4030-6.ch011"},{"doi-asserted-by":"crossref","unstructured":"Rastogi, V., Nath, S.: Differentially private aggregation of distributed time-series with transformation and encryption. In: ACM SIGMOD ICM, pp. 735\u2013746 (2010)","key":"17_CR27","DOI":"10.1145\/1807167.1807247"},{"key":"17_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4470-7","volume-title":"Regression Analysis: Theory, Methods, and Applications","author":"A Sen","year":"2012","unstructured":"Sen, A., Srivastava, M.: Regression Analysis: Theory, Methods, and Applications. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4612-4470-7"},{"doi-asserted-by":"crossref","unstructured":"Sethy, P.K., Behera, S.K., Ratha, P.K., Biswas, P.: Detection of coronavirus disease (COVID-19) based on deep features and support vector machine. arXiv Preprint (2020)","key":"17_CR29","DOI":"10.20944\/preprints202003.0300.v1"},{"unstructured":"Shi, E., Chan, T.H., Rieffel, E., Chow, R., Song, D.: Privacy-preserving aggregation of time-series data. In: Proceedings of NDSS, vol. 2, pp. 1\u201317. Citeseer (2011)","key":"17_CR30"},{"unstructured":"Takeshita, J., Karl, R., Gong, T., Jung, T.: Slap: simple lattice-based private stream aggregation protocol. arXiv Preprint (2020)","key":"17_CR31"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-81652-0_3","volume-title":"Selected Areas in Cryptography","author":"J Takeshita","year":"2021","unstructured":"Takeshita, J., Reis, D., Gong, T., Niemier, M., Hu, X.S., Jung, T.: Algorithmic acceleration of B\/FV-like somewhat homomorphic encryption for compute-enabled RAM. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 66\u201389. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_3"},{"issue":"2","key":"17_CR33","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1111\/j.1469-8986.2008.00770.x","volume":"46","author":"RC Thurston","year":"2009","unstructured":"Thurston, R.C., Matthews, K.A., Hernandez, J., De La Torre, F.: Improving the performance of physiologic hot flash measures with support vector machines. Psychophysiology 46(2), 285\u2013292 (2009)","journal-title":"Psychophysiology"},{"doi-asserted-by":"crossref","unstructured":"Tonicelli, R., et al.: Information-theoretically secure oblivious polynomial evaluation in the commodity-based model. IJIS 14(1), 73\u201384 (2015)","key":"17_CR34","DOI":"10.1007\/s10207-014-0247-8"},{"unstructured":"Tramer, F., Boneh, D.: Slalom: fast, verifiable and private execution of neural networks in trusted hardware. ICLR (2018)","key":"17_CR35"},{"key":"17_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-76620-1_8","volume-title":"Number-Theoretic Methods in Cryptology","author":"F Valovich","year":"2018","unstructured":"Valovich, F., Ald\u00e0, F.: Computational differential privacy from lattice-based cryptography. In: Kaczorowski, J., Pieprzyk, J., Pomyka\u0142a, J. (eds.) NuTMiC 2017. LNCS, vol. 10737, pp. 121\u2013141. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76620-1_8"},{"doi-asserted-by":"crossref","unstructured":"Weichbrodt, N., Kurmus, A., Pietzuch, P., Kapitza, R.: Asyncshock: exploiting synchronisation bugs in intel SGX enclaves (2016)","key":"17_CR37","DOI":"10.1007\/978-3-319-45744-4_22"},{"issue":"1","key":"17_CR38","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/1472-6947-10-16","volume":"10","author":"W Yu","year":"2010","unstructured":"Yu, W., Liu, T., Valdez, R., Gwinn, M., Khoury, M.J.: Application of support vector machine modeling for prediction of common diseases: the case of diabetes and pre-diabetes. BMC Med. Inform. Decis. Mak. 10(1), 16 (2010)","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"17_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11555827_13","volume-title":"Computer Security \u2013 ESORICS 2005","author":"H Zhu","year":"2005","unstructured":"Zhu, H., Bao, F.: Augmented oblivious polynomial evaluation protocol and its applications. In: di Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 222\u2013230. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_13"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90019-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T18:57:32Z","timestamp":1635879452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90019-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030900182","9783030900199"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90019-9_17","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"3 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","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":"56","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":"0","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":"39% - 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":"3","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":"3","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)"}}]}}