Post-quantum Cryptography: Lattice Identification Schemes

dc.creatorSilva R.
dc.creatorCayrel P.-L.
dc.creatorBuchmann J.
dc.date2011
dc.date2015-06-30T20:25:06Z
dc.date2015-11-26T14:49:11Z
dc.date2015-06-30T20:25:06Z
dc.date2015-11-26T14:49:11Z
dc.date.accessioned2018-03-28T22:00:07Z
dc.date.available2018-03-28T22:00:07Z
dc.identifier
dc.identifierPublicationes Mathematicae. , v. 79, n. 03/04/15, p. 729 - 748, 2011.
dc.identifier333883
dc.identifier10.5486/PMD.2011.5311
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84867560479&partnerID=40&md5=1854c1b4de9c47171f321a30cf1a9350
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/107854
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/107854
dc.identifier2-s2.0-84867560479
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1253823
dc.descriptionThis survey presents an overview and a comparative analysis of the state of art in post-quantum identification schemes based on lattices. Furthermore, we propose an adaptation of the HB family of identification in a lattice context. The aspects taken into account in such comparison are performance, security, communication costs, underlying hard-problem, completeness, soundness, and key sizes.
dc.description79
dc.description03/04/15
dc.description729
dc.description748
dc.descriptionBlum, A., Kalai, A., Wasserman, H., Noise-tolerant learning, the parity problem, and the statistical query model (2003) J. ACM, 50 (4), pp. 506-519
dc.descriptionCayrel, P.-L., Lindner, R., Rückert, M., Silva, R., Improved zero-knowledge identification with lattices (2010) ProvSec 2010, pp. 1-17
dc.descriptionCayrel, P.-L., Lindner, R., Rückert, M., Silva, R., A lattice-based threshold ring signature scheme (2010) LatinCrypt 2010, pp. 255-272
dc.descriptionCayrel, P.-L., Véron, P., El Yousfi Alaoui, S.M., Improved code-based identification scheme (2010) SAC 2010, , http://arxiv.org/abs/1001.3017v1
dc.descriptionFiat, A., Shamir, A., How to prove yourself: Practical solutions to identification and signature problems (1986) CRYPTO, pp. 186-194. , volume 263 of Lecture Notes in Computer Science, (Andrew M. Odlyzko, ed.), Springer
dc.descriptionFossorier, M.P.C., Mihaljevic, M.J., Imai, H., Cui, Y., Matsuura, K., An algorithm for solving the LPN problem and its application to security evaluation of the HB protocols for RFID authentication (2006) INDOCRYPT, pp. 48-62. , volume 4329 of Lecture Notes in Computer Science, (Rana Barua and Tanja Lange, eds.), Springer
dc.descriptionHalevi, S., Micali, S., Practical and provably-secure commitment schemes from collision-free hashing (1996) CRYPTO, pp. 201-215. , volume 1109 of Lecture Notes in Computer Science, (Neal Koblitz, ed.), Springer
dc.descriptionHirschhorn, P., Hoffstein, J., Howgrave-Graham, N., Whyte, W., Choosing NT- RUEncrypt parameters in light of combined lattice reduction and MITM approaches (2009) Applied Cryptography and Network Security, pp. 437-455. , Springer
dc.descriptionHopper, N.J., Blum, M., Secure human identification protocols (2001) ASIACRYPT, pp. 52-66. , volume 2248 of Lecture Notes in Computer Science, (Colin Boyd, ed.), Springer
dc.descriptionJuels, A., Weis, S.A., Authenticating pervasive devices with human protocols (2005) CRYPTO, pp. 293-308. , volume 3621 of Lecture Notes in Computer Science, (Victor Shoup, ed.), Springer
dc.descriptionKatz, J., Shin, J.S., Parallel and concurrent security of the HB and HB+Protocols (2006) EUROCRYPT, pp. 73-87. , volume 4004 of Lecture Notes in Computer Science, (Serge Vaudenay, ed.), Springer
dc.descriptionKawachi, A., Tanaka, K., Xagawa, K., Concurrently secure identification schemes based on the worst-case hardness of lattice problems (2008) ASIACRYPT '08: Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, pp. 372-389. , Springer-Verlag, Berlin, Heidelberg
dc.descriptionLi, Z., Gong, G., Qin, Z., (2009) Secure and Efficient HB-CM Entity Authentication Protocol, , http://eprint.iacr.org/
dc.descriptionLindner, R., Peikert, C., Better key sizes (and attacks) for LWE-based encryption (2011) CT-RSA, pp. 319-339. , volume 6558 of Lecture Notes in Computer Science, (Aggelos Kiayias, ed.), Springer
dc.descriptionLyubashevsky, V., Lattice-based identification schemes secure under active attacks (2008) Public Key Cryptography, pp. 162-179. , volume 4939 of Lecture Notes in Computer Science, (Ronald Cramer, ed.), Springe
dc.descriptionLyubashevsky, V., Fiat-Shamir with aborts: Applications to lattice and factoring- based signatures (2009) ASIACRYPT, pp. 598-616. , volume 5912 of Lecture Notes in Computer Science, (Mitsuru Matsui, ed.), Springer
dc.descriptionOkamoto, T., Provably secure and practical identification schemes and corresponding signature schemes (1993) CRYPTO, pp. 31-53. , volume 740 of Lecture Notes in Computer Science, (Ernest F. Brickell, ed.), Springer
dc.descriptionOuafi, K., Overbeck, R., Vaudenay, S., On the security of HB# against a man-in-the-middle attack (2008) ASIACRYPT, pp. 108-124. , volume 5350 of Lecture Notes in Computer Science, (Josef Pieprzyk, ed.), Springer
dc.descriptionPeikert, C., Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract (2009) STOC, pp. 333-342. , (Michael Mitzenmacher, ed.), ACM
dc.descriptionRegev, O., On lattices, learning with errors, random linear codes, and cryptography (2009) J. ACM, 566
dc.descriptionRückert, M., Schneider, M., Estimating the security of lattice-based cryptosystems (2010) IACR Cryptology EPrint Archive, 137
dc.descriptionShor, P.W., Polynominal time algorithms for discrete logarithms and factoring on a quantum computer (1994) ANTS, p. 289. , volume 877 of Lecture Notes in Computer Science, (Leonard M. Adleman and Ming-Deh A. Huang, eds.), Springer
dc.descriptionSilva, R., Campello, A., Dahab, R., LWE-based identification schemes (2011) CoRR, , abs/1109.0631
dc.descriptionStern, J., A new identification scheme based on syndrome decoding (1993) CRYPTO, pp. 13-21. , volume 773 of Lecture Notes in Computer Science, (Douglas R. Stinson, ed.), Springer
dc.descriptionVéron, P., Improved identification schemes based on error-correcting codes (1996) Appl. Algebra Eng. Commun. Comput., 81, pp. 57-69
dc.descriptionXagawa, K., Tanaka, K., Zero-knowledge protocols for NTRU: Application to identification and proof of plaintext knowledge (2009) ProvSec, pp. 198-213. , volume 5848 of Lecture Notes in Computer Science, (Josef Pieprzyk and Fangguo Zhang, eds.), Springer
dc.languageen
dc.publisher
dc.relationPublicationes Mathematicae
dc.rightsfechado
dc.sourceScopus
dc.titlePost-quantum Cryptography: Lattice Identification Schemes
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución