{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:00:26Z","timestamp":1761969626045,"version":"build-2065373602"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,7,28]],"date-time":"2012-07-28T00:00:00Z","timestamp":1343433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10623-012-9732-0","type":"journal-article","created":{"date-parts":[[2012,7,27]],"date-time":"2012-07-27T23:02:25Z","timestamp":1343430145000},"page":"293-313","source":"Crossref","is-referenced-by-count":5,"title":["Lattice-based completely non-malleable public-key encryption in the standard model"],"prefix":"10.1007","volume":"71","author":[{"given":"Reza","family":"Sepahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,28]]},"reference":[{"key":"9732_CR1","unstructured":"Agrawal S., Boneh D., Boyen X.: Efficient lattice (H)IBE in the standard model. In: Proceedings of Eurocrypt\u201910, vol. 6110 of LNCS, pp. 553\u2013572. Springer, London (2010)."},{"key":"9732_CR2","unstructured":"Ajtai M.: Generating hard instances of the short basis problem. In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming, ICALP \u201999, pp. 1\u20139. Springer, London (1999)."},{"key":"9732_CR3","unstructured":"Alwen J., Peikert C.: Generating shorter bases for hard random lattices. In: Susanne A., Jean-Yves M. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), vol. 3 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 75\u201386. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2009)."},{"key":"9732_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai L.: On Lov\u00e1sz lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"9732_CR5","unstructured":"Boneh D., Boyen X.: Secure identity based encryption without random oracles. In: Matt F. (ed.) Advances in Cryptology\u2014CRYPTO 2004, vol. 3152 of Lecture Notes in Computer Science, pp. 197\u2013206. Springer, Berlin\/Heidelberg (2004)."},{"key":"9732_CR6","unstructured":"Bellare M., Desai A., Pointcheval D., Rogaway P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk H. (ed.) Advances in Cryptology\u2014CRYPTO 98, pp. 26\u201346. Springer, New York (1998)."},{"key":"9732_CR7","unstructured":"Barbosa M., Farshim P.: Relations among notions of complete non-malleability: Indistinguishability and efficient construction without random oracles. In: ACISP, pp. 145\u2013163. Springer, Heidelberg (2010)."},{"key":"9732_CR8","doi-asserted-by":"crossref","unstructured":"Bellare M., Sahai A.: Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization (2006). doi: 10.1109\/FOCS.2006.25 .","DOI":"10.1109\/FOCS.2006.25"},{"key":"9732_CR9","unstructured":"Blake-Wilson S., Menezes A.: Unknown key-share attacks on the station-to-station (sts) protocol. In: Public Key Cryptography, vol. 1560 of Lecture Notes in Computer Science, pp. 634\u2013634. Springer, Berlin\/Heidelberg (1999)."},{"key":"9732_CR10","unstructured":"Canetti R., Halevi S., Katz J.: Chosen-ciphertext security from identity-based encryption. In: Christian C., Jan C. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004, Volume 3027 of Lecture Notes in Computer Science, pp. 207\u2013222. Springer, Berlin\/Heidelberg (2004)."},{"key":"9732_CR11","unstructured":"Cash D., Hofheinz D., Kiltz E., Peikert C.: Bonsai trees, or how to delegate a lattice basis. In: Henri G. (ed.) Advances in Cryptology\u2014EUROCRYPT 2010, Volume 6110 of Lecture Notes in Computer Science, pp. 523\u2013552. Springer, Berlin\/Heidelberg (2010)."},{"key":"9732_CR12","unstructured":"Cramer R., Shoup V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, pp. 13\u201325. Springer, London (1998)."},{"key":"9732_CR13","unstructured":"Dolev D., Dwork C., Naor M.: Non-malleable cryptography. In: Proceedings of the 23rd STOC, pp. 542\u2013552. ACM Press, New York (1991)."},{"issue":"2","key":"9732_CR14","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev D., Dwork C., Naor M.: Non-malleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"9732_CR15","unstructured":"Dent A., Libert B., Paterson K.: Certificateless encryption schemes strongly secure in the standard model. In: Cramer R. (ed.) Public Key Cryptography\u2014PKC 2008, Volume 4939 of Lecture Notes in Computer Science, pp. 344\u2013359. Springer, Berlin\/Heidelberg (2008)."},{"key":"9732_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y. Dodis","year":"2008","unstructured":"Dodis Y., Ostrovsky R., Reyzin L., Smith A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38, 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"9732_CR17","doi-asserted-by":"crossref","unstructured":"Dolev D., Andrew C.Y: On the security of public key protocols. Technical report, Stanford (1981).","DOI":"10.1109\/SFCS.1981.32"},{"key":"9732_CR18","unstructured":"Fischlin M.: Completely non-malleable schemes. In: Caires L. et\u00a0al. (eds.) Proceedings of ICALP, pp. 779\u2013790. Springer, New York (2005)."},{"key":"9732_CR19","unstructured":"Fujisaki E., Okamoto T., Pointcheval D., Stern J.: RSA\u2013OAEP is secure under the rsa assumption. In: CRYPTO, pp. 260\u2013274. Springer, New York (2001)."},{"key":"9732_CR20","first-page":"42","volume":"3","author":"O. Goldreich","year":"1996","unstructured":"Goldreich O., Goldwasser S., Halevi S.: Collision-free hashing from lattice problems. Electron. Colloquium Comput. Complex. (ECCC). 3, 42 (1996)","journal-title":"Electron. Colloquium Comput. Complex. (ECCC)."},{"key":"9732_CR21","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC \u201908, pp. 197\u2013206. ACM, New York (2008)."},{"key":"9732_CR22","unstructured":"Hofheinz D., Kiltz E.: Programmable hash functions and their applications. In: David W. (ed.) Advances in Cryptology\u2014CRYPTO 2008, Volume 5157 of Lecture Notes in Computer Science, pp. 21\u201338. Springer, Berlin\/Heidelberg (2008)."},{"key":"9732_CR23","unstructured":"Kaliski B.: On hash function firewalls in signature schemes. In: Preneel B. (ed.) Topics in Cryptology, CT-RSA 2002, Volume 2271 of Lecture Notes in Computer Science, pp. 89\u2013109. Springer, Berlin\/Heidelberg (2002)."},{"key":"9732_CR24","doi-asserted-by":"crossref","unstructured":"Katz J., Lindell Y.: Introduction to Modern Cryptography. Cryptography and Network Security. Chapman and Hall\/CRC, Boca Raton (2008).","DOI":"10.1201\/9781420010756"},{"key":"9732_CR25","unstructured":"Lyubashevsky V., Micciancio D.: Asymptotically efficient lattice-based digital signatures. In: Proceedings of TCC 2008, Volume 4948 of LNCS, pp. 37\u201354. Springer, New York (2008)."},{"key":"9732_CR26","unstructured":"Libert B., Yung M.: Efficient completely non-malleable public key encryption. In: Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming, ICALP\u201910, pp. 127\u2013139. Springer, Berlin, Heidelberg (2010)."},{"key":"9732_CR27","doi-asserted-by":"crossref","unstructured":"Micciancio D., Goldwasser S.: Complexity of Lattice Problems: A Cryptographic Perspective, Volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston (2002).","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"9732_CR28","unstructured":"Micciancio D., Peikert C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Advances in Cryptology\u2014EUROCRYPT 2012. Springer, Berlin\/Heidelberg (2012)."},{"key":"9732_CR29","unstructured":"Peikert C.: An efficient and parallel gaussian sampler for lattices. In: Proceedings of the 30th Annual Conference on Advances in Cryptology, CRYPTO\u201910, pp. 80\u201397. Springer, Berlin, Heidelberg (2010)."},{"key":"9732_CR30","unstructured":"Peikert C., Waters B.: Lossy trapdoor functions and their applications. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC \u201908, pp. 187\u2013196. ACM, New York (2008)."},{"key":"9732_CR31","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, STOC \u201905, pp. 84\u201393. ACM, New York (2005)."},{"key":"9732_CR32","unstructured":"Regev O.: Lecture notes of lattices in computer science. Computer Science Tel Aviv University. http:\/\/www.cs.tau.il\/~odedr . Accessed 28 Feb 2008."},{"key":"9732_CR33","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814549","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V. Shoup","year":"2008","unstructured":"Shoup V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2008)"},{"key":"9732_CR34","unstructured":"Sepahi R., Steinfeld R., Pieprzyk J.: Lattice-based completely non-malleable PKE in the standard model (poster). In: Udaya P., Philip H. (eds.) Information Security and Privacy, Volume 6812 of Lecture Notes in Computer Science, pp. 407\u2013411. Springer, Berlin\/Heidelberg (2011)."},{"key":"9732_CR35","unstructured":"Ventre C., Visconti I.: Completely non-malleable encryption revisited. In: Cramer R. (ed.) Public Key Cryptography\u2014PKC 2008, pp. 65\u201384. Springer, New York (2008)."},{"key":"9732_CR36","unstructured":"Waters B.: Efficient identity-based encryption without random oracles. In: Cramer R. (ed.) Advances in Cryptology\u2014EUROCRYPT 2005, Volume 3494 of Lecture Notes in Computer Science, pp. 557\u2013557. Springer, Berlin\/Heidelberg (2005)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9732-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9732-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9732-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,23]],"date-time":"2022-01-23T05:50:26Z","timestamp":1642917026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9732-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,28]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9732"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9732-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2012,7,28]]}}}