{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:50:18Z","timestamp":1743108618105,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255151"},{"type":"electronic","value":"9783642255168"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25516-8_9","type":"book-chapter","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T20:16:07Z","timestamp":1323202567000},"page":"132-151","source":"Crossref","is-referenced-by-count":2,"title":["Self-correctors for Cryptographic Modules"],"prefix":"10.1007","author":[{"given":"Go","family":"Yamamoto","sequence":"first","affiliation":[]},{"given":"Tetsutaro","family":"Kobayashi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1992","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof Verification and Intractability of Approximation Problems. Journal of the ACM\u00a045, 501\u2013555 (1992); Preliminary version in FOCS 1992","journal-title":"Journal of the ACM"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1992","unstructured":"Arora, S., Safra, S.: Probabilistic Checkable Proofs: A New Characterization of NP. Journal of the ACM\u00a045, 70\u2013122 (1992); Preliminary version in FOCS 1992","journal-title":"Journal of the ACM"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Sudan, M.: Improved low degree testing and its applications. In: STOC 1997, pp. 485\u2013495 (1997)","DOI":"10.1145\/258533.258642"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: STOC 1988, pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-Testing\/Correcting with Applications to Numerical Problems. In: STOC 1990, pp. 73\u201383 (1990)","DOI":"10.1145\/100216.100225"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Dent, A.W., Galbraith, S.D.: Hidden Pairings and Trapdoor DDH Groups. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., St\u00fctzle, T. (eds.) ANTS 2006. LNCS, vol.\u00a04150, pp. 436\u2013451. Springer, Heidelberg (2006)","DOI":"10.1007\/11792086_31"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/s000370050009","volume":"7","author":"J. Feigenbaum","year":"1998","unstructured":"Feigenbaum, J., Fortnow, L., Laplante, S., Naik, A.V.: On Coherence, Random-self-reducibility, and Self-correction. Computational Complexity\u00a07(2), 174\u2013191 (1998)","journal-title":"Computational Complexity"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gemmell, P., Lipton, R., Rubinfeld, R., Sudan, M., Wigderson, A.: Self-testing\/correcting for polynomials and for approximate functions. In: STOC 1991, pp. 32\u201342 (1991)","DOI":"10.1145\/103418.103429"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-642-13190-5_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"C. Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: A Simple BGN-Type Cryptosystem from LWE. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 506\u2013522. Springer, Heidelberg (2010)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A Hard-Core Predicate for all One-Way Functions. In: STOC 1989, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-30576-7_15","volume-title":"Theory of Cryptography","author":"S. Hohenberger","year":"2005","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to Securely Outsource Cryptographic Computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 264\u2013282. Springer, Heidelberg (2005)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.W.: Factroing Integers with Elliptic Curves. Ann. Math.\u00a0126, 649\u2013673 (1987)","journal-title":"Ann. Math."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539796302749","volume":"28","author":"U.M. Maurer","year":"1999","unstructured":"Maurer, U.M., Wolf, S.: The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms. SIAM Journal of Computing\u00a028, 1689\u20131721 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A subconstant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP. In: STOC 1997, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1992","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal of Computing\u00a025(2), 252\u2013271 (1992); Preliminary version in SODA 1992","journal-title":"SIAM Journal of Computing"},{"key":"9_CR17","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)"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25516-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T08:40:20Z","timestamp":1561020020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25516-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255151","9783642255168"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25516-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}