{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T14:40:55Z","timestamp":1683902455415},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T00:00:00Z","timestamp":1577232000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T00:00:00Z","timestamp":1577232000000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s11432-018-9789-y","type":"journal-article","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T14:02:54Z","timestamp":1577973774000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial AND homomorphic cryptosystem and applications"],"prefix":"10.1007","volume":"63","author":[{"given":"Shundong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sufang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Dou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenli","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,25]]},"reference":[{"key":"9789_CR1","first-page":"169","volume":"4","author":"R L Rivest","year":"1978","unstructured":"Rivest R L, Adleman L, Dertouzos M L. On data banks and privacy homomorphisms. Found Secure Comput, 1978, 4: 169\u2013180","journal-title":"Found Secure Comput"},{"key":"9789_CR2","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt A, Tromer E, Vaikuntanathan V. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the 44th ACM Symposium on Theory of Computing, 2012. 1219\u20131234","DOI":"10.1145\/2213977.2214086"},{"key":"9789_CR3","first-page":"546","volume":"2","author":"A A Atayero","year":"2011","unstructured":"Atayero A A, Feyisetan O. Security issues in cloud computing: the potentials of homomorphic encryption. J Emerg Trends Comput Inf Sci, 2011, 2: 546\u2013552","journal-title":"J Emerg Trends Comput Inf Sci"},{"key":"9789_CR4","doi-asserted-by":"publisher","first-page":"122104","DOI":"10.1007\/s11432-016-0038-6","volume":"60","author":"R Zhang","year":"2017","unstructured":"Zhang R, Ma H, Lu Y, et al. Provably secure cloud storage for mobile networks with less computation and smaller overhead. Sci China Inf Sci, 2017, 60: 122104","journal-title":"Sci China Inf Sci"},{"key":"9789_CR5","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TCC.2015.2511769","volume":"6","author":"L W Kuang","year":"2018","unstructured":"Kuang L W, Yang L T, Feng J, et al. Secure tensor decomposition using fully homomorphic encryption scheme. IEEE Trans Cloud Comput, 2018, 6: 868\u2013878","journal-title":"IEEE Trans Cloud Comput"},{"key":"9789_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3390\/cryptography1030025","volume":"1","author":"K Anunay","year":"2017","unstructured":"Anunay K, Akshay R, Matthew D, et al. Cryptographically secure multiparty computation and distributed auctions using homomorphic encryption. Cryptography, 2017, 1: 25","journal-title":"Cryptography"},{"key":"9789_CR7","doi-asserted-by":"crossref","unstructured":"Lin H Y, Tzeng W G. An efficient solution to the millionaires\u2019 problem based on homomorphic encryption. In: Proceedings of the 3rd International Conference Applied Cryptography and Network Security, 2005. 456\u2013466","DOI":"10.1007\/11496137_31"},{"key":"9789_CR8","doi-asserted-by":"publisher","first-page":"058103","DOI":"10.1007\/s11432-017-9205-0","volume":"61","author":"B B Jiang","year":"2018","unstructured":"Jiang B B, Zhang Y. Securely min and k-th min computations with fully homomorphic encryption. Sci China Inf Sci, 2018, 61: 058103","journal-title":"Sci China Inf Sci"},{"key":"9789_CR9","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TC.2013.154","volume":"64","author":"W Wang","year":"2015","unstructured":"Wang W, Hu Y, Chen L, et al. Exploring the feasibility of fully homomorphic encryption. IEEE Trans Comput, 2015, 64: 698\u2013706","journal-title":"IEEE Trans Comput"},{"key":"9789_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation","author":"R Cramer","year":"2015","unstructured":"Cramer R, Damgard I B, Nielsen J B. Secure Multiparty Computation. Cambridge: Cambridge University Press, 2015"},{"key":"9789_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R L Rivest","year":"1978","unstructured":"Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM, 1978, 21: 120\u2013126","journal-title":"Commun ACM"},{"key":"9789_CR12","doi-asserted-by":"crossref","unstructured":"ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. In: Proceedings of Annual International Cryptology Conference, Santa Barbara, 1984. 10\u201318","DOI":"10.1007\/3-540-39568-7_2"},{"key":"9789_CR13","unstructured":"Rabin M O. Digitalized Signatures and Public-key Functions as Intractable as Factorization. Massachusetts INST of Tech Cambridge Lab For Computer Science, Technical Report, No. ADA078415. 1979"},{"key":"9789_CR14","doi-asserted-by":"crossref","unstructured":"Okamoto T, Uchiyama S. A new public-key cryptosystem as secure as factoring. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Espoo, 1998. 308\u2013318","DOI":"10.1007\/BFb0054135"},{"key":"9789_CR15","doi-asserted-by":"crossref","unstructured":"Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Prague, 1999. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9789_CR16","doi-asserted-by":"crossref","unstructured":"Miller V. Use of elliptic curves in cryptography. In: Proceedings of Annual International Cryptology Conference, Santa Barbara, 1985. 417\u2013426","DOI":"10.1007\/3-540-39799-X_31"},{"key":"9789_CR17","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman J H. NTRU: a ring-based public key cryptosystem. In: Proceedings of the 3rd International Symposium on Algorithmic Number Theory, Portland, 1998. 267\u2013288","DOI":"10.1007\/BFb0054868"},{"key":"9789_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich O, Goldwasser S, Halevi S. Public-key cryptosystems from lattice reduction problems. In: Proceedings of Annual International Cryptology Conference, Santa Barbara, 1997. 112\u2013131","DOI":"10.1007\/BFb0052231"},{"key":"9789_CR19","doi-asserted-by":"crossref","unstructured":"Hu Y P, Jia H W. Cryptanalysis of GGH map. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, 2016. 537\u2013565","DOI":"10.1007\/978-3-662-49890-3_21"},{"key":"9789_CR20","unstructured":"Benaloh J. Dense probabilistic encryption. In: Proceedings of the Workshop on Selected Areas of Cryptography, Kingston, 1994. 120\u2013128"},{"key":"9789_CR21","doi-asserted-by":"crossref","unstructured":"Naccache D, Stern J. A new public key cryptosystem based on higher residues. In: Proceedings of the 5th ACM conference on Computer and Communications Security, San Francisco, 1998. 59\u201366","DOI":"10.1145\/288090.288106"},{"key":"9789_CR22","doi-asserted-by":"crossref","unstructured":"Damgard I, Jurik M. A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Proceedings of Public Key Cryptosystem, 2001. 119\u2013136","DOI":"10.1007\/3-540-44586-2_9"},{"key":"9789_CR23","doi-asserted-by":"crossref","unstructured":"Ishai Y, Paskin A. Evaluating branching programs on encrypted data. In: Proceedings of International Theory of Cryptography Conference, Amsterdam, 2007. 575\u2013594","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"9789_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser S, Micali S. Probabilistic encryption. J Comput Syst Sci, 1984, 28: 270\u2013299","journal-title":"J Comput Syst Sci"},{"key":"9789_CR25","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh E J, Nissim K. Evaluating 2-DNF formulas on ciphertexts. In: Proceedings of International Theory of Cryptography Conference, Cambridge, 2005. 325\u2013341","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"9789_CR26","doi-asserted-by":"crossref","unstructured":"Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, 2009. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"9789_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theor, 2014, 6: 1\u201336","journal-title":"ACM Trans Comput Theor"},{"key":"9789_CR28","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. SIAM J Comput, 2014, 43: 831\u2013871","journal-title":"SIAM J Comput"},{"key":"9789_CR29","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of Innovations in Theoretical Computer Science, Cambridge, 2012. 309\u2013325","DOI":"10.1145\/2090236.2090262"},{"key":"9789_CR30","unstructured":"Fan J F, Vercauteren F. Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144. http:\/\/eprint.iacr.org\/"},{"key":"9789_CR31","doi-asserted-by":"crossref","unstructured":"Cheon J H, Kim A, Kim M, et al. Homomorphic encryption for arithmetic of approximate numbers. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, 2017. 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"9789_CR32","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, et al. Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, 2016. 3\u201333","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"9789_CR33","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, et al. Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, 2017. 377\u2013408","DOI":"10.1007\/978-3-319-70694-8_14"},{"key":"9789_CR34","first-page":"421","volume":"2018","author":"I Chillotti","year":"2018","unstructured":"Chillotti I, Gama N, Georgieva M, et al. TFHE: fast fully homomorphic encryption over the torus. IACR Cryptol ePrint Arch, 2018, 2018: 421","journal-title":"IACR Cryptol ePrint Arch"},{"key":"9789_CR35","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, et al. Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, 2016. 3\u201333","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"9789_CR36","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, et al. TFHE: fast fully homomorphic encryption over the torus. https:\/\/eprint.iacr.org\/2018\/421","DOI":"10.1007\/s00145-019-09319-x"},{"key":"9789_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich O. Foundations of Cryptography: Basic Applications. Cambridge: Cambridge University Press, 2004"},{"key":"9789_CR38","doi-asserted-by":"crossref","unstructured":"Nielsen J B, Nordholt P S, Orlandi C, et al. A new approach to practical active-secure two-party computation. In: Proceedings of Annual International Cryptology Conference, Santa Barbara, 2012. 681\u2013700","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9789_CR39","doi-asserted-by":"crossref","unstructured":"Naehrig M, Lauter K, Vaikuntanathan V. Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Cloud Computing Security Workshop, Chicago, 2011. 113\u2013124","DOI":"10.1145\/2046660.2046682"},{"key":"9789_CR40","unstructured":"Sander T, Young A, Yung M. Non-interactive crypto-computing for NC1. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999. 554\u2013566"},{"key":"9789_CR41","doi-asserted-by":"crossref","unstructured":"Fischlin M. A cost-effective pay-per-multiplication comparison method for millionaires. In: Proceedings of the Cryptographer\u2019s Track at the RSA Conference, San Jose, 2001. 457\u2013471","DOI":"10.1007\/3-540-45353-9_33"},{"key":"9789_CR42","doi-asserted-by":"crossref","unstructured":"Barbulescu R, Gaudry P, Joux A, et al. A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic: improvements over FFS in small to medium characteristic. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, 2014. 1\u201316","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"9789_CR43","doi-asserted-by":"crossref","unstructured":"Menezes A, Sarkar P, Singh S. Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography. In: Proceedings of International Conference on Cryptology in Malaysia, Kuala Lumpur, 2016. 83\u2013108","DOI":"10.1007\/978-3-319-61273-7_5"},{"key":"9789_CR44","volume-title":"Abstract Algebra Theory and Applications","author":"W J Thomas","year":"2014","unstructured":"Thomas W J, Stephen F. Abstract Algebra Theory and Applications. Nacogdoches: Austin State University Press, 2014"},{"key":"9789_CR45","doi-asserted-by":"crossref","unstructured":"Meadows C. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: Proceedings of 1986 IEEE Symposium on Security and Privacy, Oakland, 1986. 134","DOI":"10.1109\/SP.1986.10022"},{"key":"9789_CR46","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00145-014-9190-0","volume":"29","author":"M J Freedman","year":"2016","unstructured":"Freedman M J, Hazay C, Nissim K, et al. Efficient set intersection with simulation-based security. J Cryptol, 2016, 29: 115\u2013155","journal-title":"J Cryptol"},{"key":"9789_CR47","doi-asserted-by":"crossref","unstructured":"Kissner L, Song D. Privacy-preserving set operations. In: Proceedings of Annual International Cryptology Conference, Santa Barbara, 2005. 241\u2013257","DOI":"10.1007\/11535218_15"},{"key":"9789_CR48","unstructured":"Pinkas B, Schneider T, Segev G, et al. Phasing: private set intersection using permutation-based hashing. In: Proceedings of the 24th USENIX Security Symposium, Washington, 2015. 515\u2013530"},{"key":"9789_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154794","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas B, Schneider T, Zohner M. Scalable private set intersection based on OT extension. ACM Trans Priv Secur, 2018, 21: 1\u201335","journal-title":"ACM Trans Priv Secur"},{"key":"9789_CR50","doi-asserted-by":"crossref","unstructured":"Orr\u00fa M, Orsini E, Scholl P. Actively secure 1-out-of-n OT extension with application to private set intersection. In: Proceedings of Cryptographers\u2019 Track at the RSA Conference, San Francisco, 2017. 381\u2013396","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"9789_CR51","doi-asserted-by":"crossref","unstructured":"Chen H, Laine K, Rindal P. Fast private set intersection from homomorphic encryption. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, Dallas, 2017. 1243\u20131255","DOI":"10.1145\/3133956.3134061"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9789-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-018-9789-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9789-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T14:06:19Z","timestamp":1683900379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-018-9789-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,25]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["9789"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9789-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,25]]},"assertion":[{"value":"17 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"112105"}}