{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:37Z","timestamp":1760202517675,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327318"},{"type":"electronic","value":"9783540327325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_9","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T07:41:35Z","timestamp":1141112495000},"page":"167-183","source":"Crossref","is-referenced-by-count":6,"title":["On Error Correction in the Exponent"],"prefix":"10.1007","author":[{"given":"Chris","family":"Peikert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"633","volume":"4","author":"E. Berlekamp","year":"1986","unstructured":"Berlekamp, E., Welch, L.: Error correction of algebraic block codes. US Patent Number\u00a04, 633, 470 (1986)","journal-title":"US Patent Number"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-48405-1_22","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Franklin, M.K.: An efficient public key traitor tracing scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 338\u2013353. Springer, Heidelberg (1999)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-48329-2_26","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"S. Brands","year":"1994","unstructured":"Brands, S.: Untraceable off-line cash in wallet with observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 302\u2013318. Springer, Heidelberg (1994)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-48910-X_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Canetti","year":"1999","unstructured":"Canetti, R., Goldwasser, S.: An efficient threshold public key cryptosystem secure against chosen ciphertext attack. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 90\u2013106. Springer, Heidelberg (1999)"},{"key":"9_CR5","first-page":"335","volume-title":"Proc. FOCS 2004","author":"Q. Cheng","year":"2004","unstructured":"Cheng, Q., Wan, D.: On the list and bounded distance decodability of the Reed- Solomon codes. In: Proc. FOCS 2004, pp. 335\u2013341. IEEE Computer Society, Los Alamitos (2004)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24638-1_13","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2004","unstructured":"Cramer, R., Damg\u00e5rd, I.: Secret-key zero-knowlegde and non-interactive verifiable exponentiation. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 223\u2013237. Springer, Heidelberg (2004)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 13. Springer, Heidelberg (1998)"},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Public Key Cryptography - PKC 2003","author":"Y. Dodis","year":"2002","unstructured":"Dodis, Y.: Efficient construction of (Distributed) verifiable random functions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 1\u201317. Springer, Heidelberg (2002)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T.E. Gamal","year":"1985","unstructured":"Gamal, T.E.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"R. Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 354\u2013371. Springer, Heidelberg (1996)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of reed-solomon and algebraicgeometric codes. In: IEEE Symposium on Foundations of Computer Science, pp. 28\u201339 (1998)","DOI":"10.1109\/SFCS.1998.743426"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Vardy, A.: Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. In: SODA (2005)","DOI":"10.1145\/1060590.1060679"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00145-003-0052-4","volume":"16","author":"A. Joux","year":"2003","unstructured":"Joux, A., Nguyen, K.: Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups. J. Cryptology\u00a016(4), 239\u2013247 (2003)","journal-title":"J. Cryptology"},{"issue":"9","key":"9_CR15","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R.J. McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Comm. ACM\u00a024(9), 583\u2013584 (1981)","journal-title":"Comm. ACM"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-48910-X_23","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 327\u2013346. Springer, Heidelberg (1999)"},{"issue":"1","key":"9_CR17","first-page":"86","volume":"E79-A","author":"C. Park","year":"1996","unstructured":"Park, C., Kurosawa, K.: New ElGamal type threshold digital signature scheme. IEICE Trans. Fundamentals\u00a0E79-A(1), 86\u201393 (January 1996)","journal-title":"IEICE Trans. Fundamentals"},{"key":"9_CR18","unstructured":"Raimondo, M.D., Gennaro, R.: Secure multiplication of shared secrets in the exponent. Cryptology ePrint Archive, Report 2003\/057 (2003)"},{"issue":"2","key":"9_CR19","first-page":"300","volume":"8","author":"I.S. Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. SIAM\u00a08(2), 300\u2013304 (June 1960)","journal-title":"J. SIAM"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM\u00a027(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"issue":"11","key":"9_CR21","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Comm. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"Sudan, M.: Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity\u00a013(1), 180\u2013193 (1997)","journal-title":"Journal of Complexity"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:55:01Z","timestamp":1736286901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11681878_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}