{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T11:11:49Z","timestamp":1743160309397},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2015,5,9]],"date-time":"2015-05-09T00:00:00Z","timestamp":1431129600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NSF EAGER DMS","award":["1349908"],"award-info":[{"award-number":["1349908"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10623-015-0089-z","type":"journal-article","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T10:13:21Z","timestamp":1431080001000},"page":"541-552","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["PASS-Encrypt: a public key cryptosystem based on partial evaluation of polynomials"],"prefix":"10.1007","volume":"77","author":[{"given":"Jeffrey","family":"Hoffstein","sequence":"first","affiliation":[]},{"given":"Joseph H.","family":"Silverman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,9]]},"reference":[{"key":"89_CR1","unstructured":"Ajtai M., Dwork C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC \u201997 (El Paso, TX), pp. 284\u2013293 (electronic). ACM, New York (1999)."},{"key":"89_CR2","doi-asserted-by":"crossref","unstructured":"Ducas L., Nguyen P.Q.: Faster Gaussian lattice sampling using lazy floating-point arithmetic. In: Advances in Cryptology\u2013ASIACRYPT 2012. Lecture Notes in Computer Science, vol. 7658, pp. 415\u2013432. Springer, Heidelberg (2012).","DOI":"10.1007\/978-3-642-34961-4_26"},{"key":"89_CR3","doi-asserted-by":"crossref","unstructured":"Garg S., Gentry C., Halevi S.: Candidate multilinear maps from ideal lattices. In: Advances in Cryptology\u2013EUROCRYPT 2013. Lecture Notes in Computer Science, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"89_CR4","doi-asserted-by":"crossref","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: STOC\u201909\u2014Proceedings of the 2009 ACM International Symposium on Theory of Computing, pp. 169\u2013178. ACM, New York (2009).","DOI":"10.1145\/1536414.1536440"},{"key":"89_CR5","doi-asserted-by":"crossref","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for hard lattices and new cryptographic constructions [extended abstract]. In: STOC\u201908, pp. 197\u2013206. ACM, New York (2008).","DOI":"10.1145\/1374376.1374407"},{"key":"89_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich O., Goldwasser S., Halevi S.: Public-key cryptosystems from lattice reduction problems. In: Advances in Cryptology\u2013CRYPTO \u201997 (Santa Barbara, CA, 1997). Lecture Notes in Computer Science, vol. 1294, pp. 112\u2013131. Springer, Berlin (1997).","DOI":"10.1007\/BFb0052231"},{"key":"89_CR7","unstructured":"Hoffstein J., Silverman J.H.: Polynomial rings and efficient public key authentication. II. In: Cryptography and Computational Number Theory (Singapore, 1999). Programe on Computer Science Applications Logic, vol. 20, pp. 269\u2013286. Birkh\u00e4user, Basel (2001)."},{"key":"89_CR8","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NTRU: a ring-based public key cryptosystem. In: Algorithmic Number Theory (Portland, OR, 1998). Lecture Notes in Computer Science, vol. 1423, pp. 267\u2013288. Springer, Berlin (1998).","DOI":"10.1007\/BFb0054868"},{"key":"89_CR9","unstructured":"Hoffstein J., Lieman D., Silverman J.H.: Polynomial rings and efficient public key authentication. In: Cryptographic Techniques and e-Commerce (CryTEC\u201999). City University of Hong Kong Press, Hong Kong (1999)."},{"key":"89_CR10","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: An Introduction to Mathematical Cryptography. Undergraduate Texts in Mathematics. Springer, New York (2008).","DOI":"10.1007\/978-0-387-77993-5_6"},{"key":"89_CR11","unstructured":"Hoffstein J., Kaliski B., Lieman D., Robshaw M., Yin Y.: Secure user identification based on constrained polynomials. United States Patent 6,076,163. Filed October 20, 1997, Issued June 13 (2000)."},{"key":"89_CR12","unstructured":"Hoffstein J., Pipher J., Schanck J., Silverman J.H., Whyte W.: Practical signatures from the partial Fourier recovery problem. Cryptology ePrint Archive, Report 2013\/757 (2013). http:\/\/eprint.iacr.org\/ . Proceedings of ACNS 2014 (to appear)."},{"key":"89_CR13","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Schanck J., Silverman J.H., Whyte W.: Transcript secure signatures based on modular lattices. In: PQCrypto 2014. Lecture Notes in Computer Science, vol. 8772, pp. 142\u2013159. Springer, Switzerland (2014). To appear http:\/\/eprint.iacr.org\/2014\/457 .","DOI":"10.1007\/978-3-319-11659-4_9"},{"key":"89_CR14","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham N., Silverman J H., Whyte W.: Choosing parameter sets for NTRUEncrypt with NAEP and SVES-3. In: Topics in Cryptology\u2013CT-RSA 2005. Lecture Notes in Computer Science, vol. 3376, pp. 118\u2013135. Springer, Berlin (2005).","DOI":"10.1007\/978-3-540-30574-3_10"},{"key":"89_CR15","unstructured":"May A.: Auf polynomgleichungen basierende public-key-kryptosysteme, June 4, (1999). Johann Wolfgange Goethe-Universitat, Frankfurt am Main, Fachbereich Informatik. (Masters Thesis in Computer Science)."},{"key":"89_CR16","doi-asserted-by":"crossref","unstructured":"May A., Silverman J.H.: Dimension reduction methods for convolution modular lattices. In: Cryptography and Lattices (Providence, RI, 2001). Lecture Notes in Computer Science, vol. 2146, pp. 110\u2013125. Springer, Berlin (2001).","DOI":"10.1007\/3-540-44670-2_10"},{"key":"89_CR17","doi-asserted-by":"crossref","unstructured":"Melchor C.A., Boyen X., Deneuville J.-C., Gaborit P.: Sealing the leak on classical ntru signatures. In: PQCrypto 2014. Lecture Notes in Computer Science, vol. 8772, pp. 1\u201321. Springer, Switzerland (2014). To appear http:\/\/eprint.iacr.org\/2014\/484 .","DOI":"10.1007\/978-3-319-11659-4_1"},{"key":"89_CR18","unstructured":"Stehl D., Steinfeld R.: Making ntruencrypt and ntrusign as secure as standard worst-case problems over ideal lattices. Cryptology ePrint Archive, Report 2013\/004 (2013) http:\/\/eprint.iacr.org\/ ."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0089-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0089-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0089-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T06:43:48Z","timestamp":1691649828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0089-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,9]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0089-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,9]]}}}