{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:42Z","timestamp":1764996822180,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416586"},{"type":"electronic","value":"9783540445869"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44586-2_28","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T02:53:49Z","timestamp":1191725629000},"page":"383-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Secure Server-Aided Signature Generation"],"prefix":"10.1007","author":[{"given":"Markus","family":"Jakobsson","sequence":"first","affiliation":[]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,5]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, J. Feigenbaum and J. Kilian, \u201cOn Hiding Information from an Oracle\u201d, Journal of Computer and System Sciences, Vol. 39, no. 1, Aug 1989, pp. 21\u201350.","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, J. Feigenbaum and V. Shoup, \u201cHiding Instances in Zero-Knowledge Proof Systems,\u201d CRYPTO\u2019 90, pp. 326\u2013338.","DOI":"10.1007\/3-540-38424-3_24"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, J.A. Garay and T. Rabin, \u201cFast Batch Verification for Modular Exponentiation and Digital Signatures,\u201d EUROCRYPT\u2019 98, 1998, pp. 236\u2013250.","DOI":"10.1007\/BFb0054130"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser and A. Wigderson, \u201cCompleteness Theorems for Noncryptographic Fault-Tolerant Distributed Computations\u201d, STOC\u2019 88, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"28_CR5","unstructured":"D. Bleichenbacher, \u201cAddition Chains for Large Sets\u201d, preprint, 1999."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"J. Bos and M. Coster, \u201cAddition Chain Heuristics,\u201d CRYPTO\u2019 89, pp. 400\u2013407.","DOI":"10.1007\/0-387-34805-0_37"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"V. Boyko, M. Peinado and R. Venkatesan, \u201cSpeeding up discrete log and factoring based schemes via precomputations\u201d. EUROCRYPT\u2019 98, pp. 221\u2013235.","DOI":"10.1007\/BFb0054129"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"S. Brands, \u201cUntraceable O.-line Cash in Wallet with Observers,\u201d CRYPTO\u2019 93, pp. 302\u2013318.","DOI":"10.1007\/3-540-48329-2_26"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/12.262121","volume":"43","author":"J. Burns","year":"1994","unstructured":"J. Burns and C.J. Mitchell, \u201cParameter Selection for Server-Aided RSA Computation Schemes\u201d IEEE Transactions on Computers, Vol. 43, No. 2, 1994, pp. 163\u2013174.","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau and I. Damg\u00e5rd, \u201cMultiparty Unconditionally Secure Protocols\u201d, STOC\u2019 98, pp. 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich and M. Naor, \u201cAdaptively Secure Multi-Party Computation\u201d, STOC\u2019 96, pp. 639\u2013648.","DOI":"10.1145\/237814.238015"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"J.H. Conway and N.J.A. Sloane, \u201cSphere Packings, Lattices and Groups\u201d, Springer, 1993.","DOI":"10.1007\/978-1-4757-2249-9"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M.J. Coster","year":"1992","unstructured":"M.J. Coster, B.A. LaMacchia, A.M. Odlyzko, C.P. Schnorr and J. Stern, \u201cImproved Low-Density Subset Sum Algorithms\u201d, Journal of Computational Complexity, Vol. 2, 1992, pp. 111\u2013128.","journal-title":"Journal of Computational Complexity"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"A. De Santis, Y. Desmedt, Y. Frankel and M. Yung, \u201cHow to Share a Function Securely\u201d, STOC\u2019 94, pp. 522\u2013533.","DOI":"10.1145\/195058.195405"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Y. Desmedt and K. Kurosawa, \u201cHow to Break a Practical MIX and Design a New One,\u201d EUROCRYPT\u2019 00, pp. 557\u2013772.","DOI":"10.1007\/3-540-45539-6_39"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum and R. Ostrovsky, \u201cA Note on One-Prover Instance-Hiding, Zero-Knowledge Proof Systems\u201d, ASIACRYPT\u2019 91, pp. 352\u2013359.","DOI":"10.1007\/3-540-57332-1_30"},{"key":"28_CR17","unstructured":"M.R. Garey and D.S. Johnson, \u201cComputers and Intractability: A Guide to the Theory of NP-Completeness,\u201d W.H. Freeman and Company, 1979."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. Rabin and T. Rabin, \u201cSimplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography\u201d, PODC\u2019 98, pp. 101\u2013111.","DOI":"10.1145\/277697.277716"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson, \u201cHow to Play Any Mental Game\u201d, STOC\u2019 87, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"M. Jakobsson, \u201cA Practical Mix\u201d, EUROCRYPT\u2019 98, pp. 448\u2013461.","DOI":"10.1007\/BFb0054145"},{"issue":"5","key":"28_CR21","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/49.223880","volume":"11","author":"S. Kawamura","year":"1993","unstructured":"S. Kawamura and A. Shimbo, \u201cFast Server-Aided Secret Computation Protocols for Modular Exponentiation\u201d, IEEE Journal on Selected Areas in Communications, Vol. 11, No. 5, 1993, pp. 778\u2013784.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"C.H. Lim and P.J. Lee, \u201cSecurity and Performance of Server-Aided RSA Computation Protocols,\u201d CRYPTO\u2019 95, pp. 70\u201383.","DOI":"10.1007\/3-540-44750-4_6"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"C.H. Lim and P.J. Lee, \u201cMore Flexible Exponentiation With Precomputation\u201d, CRYPTO\u2019 94, pp. 95\u2013107.","DOI":"10.1007\/3-540-48658-5_11"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"T. Matsumoto, H. Imai, C.S. Laih and S.M. Yen, \u201cOn Verifiable Implicit Asking Protocols for RSA Computation\u201d, AUSCRYPT\u2019 92, pp. 296\u2013307.","DOI":"10.1007\/3-540-57220-1_70"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"T. Matsumoto, K. Kato and H. Imai, \u201cSpeeding Up Secret Computations with Insecure Auxiliary Devices\u201d, CRYPTO\u2019 88, pp. 497\u2013506.","DOI":"10.1007\/0-387-34799-2_35"},{"key":"28_CR26","unstructured":"National Institute of Standards and Technology (NIST), \u201cFIPS Publication 186-1: Digital Signature Standard\u201d, December 15, 1998."},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"P. Nguyen and J. Stern, \u201cThe Hardness of the Hidden Subset Sum Problem and its Cryptographic Implications\u201d, Crypto\u2019 99, pp. 31\u201346.","DOI":"10.1007\/3-540-48405-1_3"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann and M. Waidner, \u201cAttacks on Protocols for Server-Aided RSA Computation\u201d, EUROCRYPT\u2019 92, pp. 153\u2013162.","DOI":"10.1007\/3-540-47555-9_13"},{"key":"28_CR29","unstructured":"J.-J. Quisquater and M. De Soete, \u201cSpeeding up Smart Card RSA Computation with Insecure Coprocessors\u201d, SMART CARD 2000, 1989, pp. 191\u2013197."},{"key":"28_CR30","unstructured":"E.M. Rains and N.J.A. Sloane, \u201cTable of Constant Weight Binary Codes\u201d, http:\/\/www.research.att.com\/~njas\/codes\/Andw\/ , 2000."},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"T. Sander, A. Young and M. Yung, \u201cNon-Interactive Crypto Computing for NC 1\u201d, FOCS\u2019 99, pp. 554\u2013567.","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"28_CR32","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.-P. Schnorr","year":"1991","unstructured":"C.-P. Schnorr, \u201cEfficient Signature Generation for Smart Cards,\u201d Journal of Cryptology, Vol. 4, 1991, pp. 161\u2013174.","journal-title":"Journal of Cryptology"},{"key":"28_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C.P. Schnorr","year":"1994","unstructured":"C.P. Schnorr and M. Euchner, \u201cLattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems\u201d, Mathematical Programming 66, 1994, pp. 181\u2013199.","journal-title":"Mathematical Programming"},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"C.P. Schnorr and H.H. H\u00f6rner, \u201cAttacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction\u201d, EUROCRYPT\u2019 95, pp. 1\u201312.","DOI":"10.1007\/3-540-49264-X_1"},{"key":"28_CR35","unstructured":"A.C. Yao, \u201cProtocols for Secure Computations\u201d, FOCS\u2019 82, pp. 160\u2013164."}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44586-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:36:07Z","timestamp":1737462967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44586-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416586","9783540445869"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-44586-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"5 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}