{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:22:54Z","timestamp":1743092574625,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031230196"},{"type":"electronic","value":"9783031230202"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-23020-2_38","type":"book-chapter","created":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T07:03:04Z","timestamp":1670310184000},"page":"667-683","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Combination Reduction Algorithm and Its Application"],"prefix":"10.1007","author":[{"given":"Wei","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","unstructured":"Simmons, G.J.: The prisoners\u2019 problem and the subliminal channel. In: Chaum, D. (ed.) Advances in Cryptology 1983, pp. 51\u201367. Springer, MA (1984). https:\/\/doi.org\/10.1007\/978-1-4684-4730-9_5","DOI":"10.1007\/978-1-4684-4730-9_5"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-68697-5_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 1996","author":"A Young","year":"1996","unstructured":"Young, A., Yung, M.: The dark side of Black-Box cryptography or: should we trust capstone? In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 89\u2013103. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_8"},{"key":"38_CR3","first-page":"1","volume":"6","author":"J Ball","year":"2013","unstructured":"Ball, J., Borger, J., Greenwald, G., et al.: Revealed: how US and UK spy agencies defeat internet privacy and security. Know Your Neighborhood 6, 1\u201310 (2013)","journal-title":"Know Your Neighborhood"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44371-2_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"M Bellare","year":"2014","unstructured":"Bellare, M., Paterson, K.G., Rogaway, P.: Security of symmetric encryption against mass surveillance. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 1\u201319. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_1"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-662-46803-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"I Mironov","year":"2015","unstructured":"Mironov, I., Stephens-Davidowitz, N.: Cryptographic reverse firewalls. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 657\u2013686. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_22"},{"key":"38_CR6","doi-asserted-by":"publisher","unstructured":"Ateniese, G., Magri, B., Venturi, D.: Subversion-resilient signature schemes. In: Ray, I., Li, N., Kruegel, C. (eds.) CCS 2015, pp. 364\u2013375. New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2810103.2813635","DOI":"10.1145\/2810103.2813635"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-93638-3_22","volume-title":"Information Security and Privacy","author":"C Liu","year":"2018","unstructured":"Liu, C., Chen, R., Wang, Y., Wang, Y.: Asymmetric Subversion Attacks on Signature Schemes. In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 376\u2013395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93638-3_22"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Regev, Oded.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM. 56(6), 1\u201340 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-69053-0_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"A Young","year":"1997","unstructured":"Young, A., Yung, M.: Kleptography: using cryptography against cryptography. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 62\u201374. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_6"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Young, A., Yung, M.: Malicious cryptography: Exposing Cryptovirology. Wiley, J., and Sons, Indiana (2004)","DOI":"10.1016\/S0267-3649(04)00079-2"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-72565-9_17","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"R Kwant","year":"2018","unstructured":"Kwant, R., Lange, T., Thissen, K.: Lattice klepto. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 336\u2013354. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_17"},{"issue":"8","key":"38_CR15","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1093\/comjnl\/bxy060","volume":"61","author":"D Xiao","year":"2018","unstructured":"Xiao, D., Yu, Y.: Klepto for ring-LWE encryption. Comput. J. 61(8), 1228\u20131239 (2018)","journal-title":"Comput. J."},{"issue":"4","key":"38_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1093\/comjnl\/bxz084","volume":"63","author":"Z Yang","year":"2020","unstructured":"Yang, Z., Chen, R., Li, C., et al.: On the security of LWE cryptosystem against subversion attacks. Comput. J. 63(4), 495\u2013507 (2020)","journal-title":"Comput. J."},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra, H.W.,Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen. 261, 515\u2013534 (1982)","DOI":"10.1007\/BF01457454"},{"issue":"1","key":"38_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"CP Schnorr","year":"1988","unstructured":"Schnorr, C.P.: A more efficient algorithm for lattice basis reduction. J. Algor. 9(1), 47\u201362 (1988)","journal-title":"J. Algor."},{"issue":"1","key":"38_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-44670-2_7","volume-title":"Cryptography and Lattices","author":"H Koy","year":"2001","unstructured":"Koy, H., Schnorr, C.P.: Segment LLL-reduction of lattice bases. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 67\u201380. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44670-2_7"},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"38_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-662-49890-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Aono","year":"2016","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 789\u2013819. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30"},{"issue":"8","key":"38_CR23","first-page":"1118","volume":"41","author":"L Lu","year":"2016","unstructured":"Lu, L., Liu, W., Li, J.: An effective LLL reduction algorithm. J. Wuhan Univ. Natl. Sci. Ed. 41(8), 1118\u20131124 (2016)","journal-title":"J. Wuhan Univ. Natl. Sci. Ed."},{"key":"38_CR24","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. In: Proceedings of the 45th Symposium on Foundations of Computer Science. (eds.) FOCS 2004, pp. 372\u2013381. IEEE (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"38_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-30574-3_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"N Howgrave-Graham","year":"2005","unstructured":"Howgrave-Graham, N., Silverman, J.H., Whyte, W.: Choosing parameter sets for NTRUEncrypt with NAEP and SVES-3. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 118\u2013135. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_10"},{"key":"38_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-45146-4_14","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"N Howgrave-Graham","year":"2003","unstructured":"Howgrave-Graham, N., et al.: The impact of decryption failures on the security of NTRU encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 226\u2013246. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_14"},{"key":"38_CR27","unstructured":"Chen, C., Hoffstein, J., Whyte, W., et al.: NIST PQ Submission: NTRUEncrypt A lattice based encryption algorithm. https:\/\/csrc.nist.gov\/Projects\/PostQuantum-Cryptography\/Round-1-Submissions. Accessed 23Jan 2018"},{"key":"38_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4"},{"key":"38_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-662-54365-8_17","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"Y Yu","year":"2017","unstructured":"Yu, Y., Xu, G., Wang, X.: Provably secure NTRU instances over prime cyclotomic rings. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 409\u2013434. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_17"},{"key":"38_CR30","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R., Chair, P. (eds.) STOC 2008, pp. 197\u2013206. New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"issue":"11","key":"38_CR31","first-page":"147","volume":"39","author":"J Bai","year":"2013","unstructured":"Bai, J., Liu, N., Li, Z.: New lattice reduction algorithm based on Gauss and LLL reduction. J. Comput. Eng. 39(11), 147\u2013149 (2013)","journal-title":"J. Comput. Eng."},{"issue":"3","key":"38_CR32","first-page":"225","volume":"1","author":"L Peng","year":"2014","unstructured":"Peng, L., Hu, L., Huang, Z., et al.: Actual complexity of modular knapsack vector problem and practical security of a lattice based public key cryptosystem. J. Cryptol. Res. 1(3), 225\u2013234 (2014)","journal-title":"J. Cryptol. Res."},{"key":"38_CR33","doi-asserted-by":"crossref","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin (1993)","DOI":"10.1007\/978-3-662-02945-9"},{"key":"38_CR34","unstructured":"Shoup, V.: N.T.L A library for doing number theory. http:\/\/www.shoup.net\/ntl\/26-8-2018. Accessed 23 Jun 2021"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23020-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T07:19:27Z","timestamp":1670311167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23020-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031230196","9783031230202"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23020-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Network and System Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denarau Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fiji","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":"9 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/nss2022\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","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":"23","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":"18","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":"28% - 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)"}}]}}