{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:22Z","timestamp":1775774002772,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540784395","type":"print"},{"value":"9783540784401","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78440-1_10","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T05:53:32Z","timestamp":1204005212000},"page":"162-179","source":"Crossref","is-referenced-by-count":106,"title":["Lattice-Based Identification Schemes Secure Under Active Attacks"],"prefix":"10.1007","author":[{"given":"Vadim","family":"Lyubashevsky","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: STOC, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in \u21132 is NP-hard for randomized reductions. In: STOC, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-73420-8_8","volume-title":"Automata, Languages and Programming","author":"J. Bl\u00f6mer","year":"2007","unstructured":"Bl\u00f6mer, J., Naewe, S.: Sampling methods for shortest vectors, closest vectors and successive minima. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 65\u201377. Springer, Heidelberg (2007)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., Seifert, J.-P.: On the complexity of computing short linearly independent vectors and short bases in a lattice. In: STOC, pp. 711\u2013720 (1999)","DOI":"10.1145\/301250.301441"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptology\u00a01(2), 77\u201394 (1988)","journal-title":"J. Cryptology"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00145-006-0224-0","volume":"19","author":"M. Girault","year":"2006","unstructured":"Girault, M., Poupard, G., Stern, J.: On the fly authentication and signature schemes based on groups of unknown order. J. Cryptology\u00a019(4), 463\u2013487 (2006)","journal-title":"J. Cryptology"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/0-387-34799-2_16","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"L. Guillou","year":"1990","unstructured":"Guillou, L., Quisquater, J.J.: A \u201cparadoxical\u201d indentity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 216\u2013231. Springer, Heidelberg (1990)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: FOCS, pp. 248\u2013253 (1989)","DOI":"10.1109\/SFCS.1989.63486"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in lattices. In: FOCS, pp. 126\u2013135 (2004)","DOI":"10.1109\/FOCS.2004.31"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/S0895480100379981","volume":"16","author":"R. Kumar","year":"2003","unstructured":"Kumar, R., Sivakumar, D.: On polynomial-factor approximations to the shortest lattice vector length. SIAM J. Discrete Math.\u00a016(3), 422\u2013425 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V. Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 144\u2013155. Springer, Heidelberg (2006)"},{"key":"#cr-split#-10_CR16.1","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: A modest proposal for FFT hashing. In: Fast Software Encryption (FSE) (2008);","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"#cr-split#-10_CR16.2","unstructured":"Preliminary version appeared at the 2nd NIST Cryptographic Hash Function Workshop (to appear)"},{"key":"#cr-split#-10_CR17.1","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: Computational Complexity (2002);","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"#cr-split#-10_CR17.2","unstructured":"Preliminary version in FOCS 2002 (to appear)"},{"key":"10_CR18","unstructured":"Micciancio, D.: Efficient reductions among lattice problems. In: SODA (to appear, 2008)"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. on Computing\u00a037(1), 267\u2013302 (2007)","journal-title":"SIAM J. on Computing"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/978-3-540-45146-4_17","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"D. Micciancio","year":"2003","unstructured":"Micciancio, D., Vadhan, S.: Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 282\u2013298. Springer, Heidelberg (2003)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"T. Okamoto","year":"1993","unstructured":"Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 31\u201353. Springer, Heidelberg (1993)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","author":"C. Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, Springer, Heidelberg (2006)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Pointcheval, D.: The composite discrete logarithm and secure authentication. In: Public Key Cryptography, pp. 113\u2013128 (2000)","DOI":"10.1007\/978-3-540-46588-1_9"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Regev, O.: New lattice based cryptographic constructions. In: STOC, pp. 407\u2013416 (2003)","DOI":"10.1145\/780542.780603"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"3","key":"10_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"J. Cryptology"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/0-387-34805-0_54","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"A. Shamir","year":"1990","unstructured":"Shamir, A.: An efficient identification scheme based on permuted kernels (extended abstract). In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 606\u2013609. Springer, Heidelberg (1990)"},{"issue":"5","key":"10_CR28","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR29","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s001459900056","volume":"12","author":"V. Shoup","year":"1999","unstructured":"Shoup, V.: On the security of a practical identification scheme. J. Cryptology\u00a012(4), 247\u2013260 (1999)","journal-title":"J. Cryptology"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Stern, J.: A new paradigm for public key identification. IEEE Transactions on Information Theory\u00a042 (1996)","DOI":"10.1109\/18.556672"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78440-1_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:04Z","timestamp":1619507344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78440-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784395","9783540784401"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78440-1_10","relation":{},"subject":[]}}