{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T23:40:10Z","timestamp":1745365210151,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357541"},{"type":"electronic","value":"9783642357558"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35755-8_6","type":"book-chapter","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T11:36:02Z","timestamp":1354188962000},"page":"74-81","source":"Crossref","is-referenced-by-count":0,"title":["Shared Security: How Wireless Sensor Networks Can Benefit from Threshold Cryptography"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Koschuch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Hudler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kr\u00fcger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Lory","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Wenzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"6_CR2","first-page":"1","volume-title":"Proceedings of the 20th Annual Symposium on Theory of Computing (STOC 1988)","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual Symposium on Theory of Computing (STOC 1988), pp. 1\u201310. ACM Press, New York (1988)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2006","unstructured":"Bogetoft, P., Damg\u00e5rd, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 142\u2013147. Springer, Heidelberg (2006)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., Franklin, M.: Efficient Generation of Shared RSA Keys. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 425\u2013439. Springer, Heidelberg (1997)"},{"key":"6_CR5","series-title":"Advanced Courses in Mathematics - CRM Barcelona","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-7643-7394-6_1","volume-title":"Contemporary Cryptology","author":"D. Catalano","year":"2005","unstructured":"Catalano, D.: Efficient distributed computation modulo a shared secret. In: Catalano, D., Cramer, R., Damg\u00e5rd, I., Di Crescenco, G., Pointcheval, D., Takagi, T. (eds.) Contemporary Cryptology. Advanced Courses in Mathematics - CRM Barcelona, pp. 1\u201339. Birkh\u00e4user, Basel (2005)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-45539-6_14","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"D. Catalano","year":"2000","unstructured":"Catalano, D., Gennaro, R., Halevi, S.: Computing Inverses over a Shared Secret Modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 190\u2013206. Springer, Heidelberg (2000)"},{"key":"6_CR7","first-page":"11","volume-title":"Proceedings of the 20th Annual Symposium on Theory of Computing (STOC 1988)","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proceedings of the 20th Annual Symposium on Theory of Computing (STOC 1988), pp. 11\u201319. ACM Press, New York (1988)"},{"key":"6_CR8","series-title":"Advanced Courses in Mathematics - CRM Barcelona","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-7643-7394-6_2","volume-title":"Contemporary Cryptology","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I.: Multiparty computation, an introduction. In: Catalano, D., Cramer, R., Damg\u00e5rd, I., Di Crescenco, G., Pointcheval, D., Takagi, T. (eds.) Contemporary Cryptology. Advanced Courses in Mathematics - CRM Barcelona, pp. 41\u201387. Birkh\u00e4user, Basel (2005)"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the Strong RSA Assumption. ACM Transactions on Information and System Security (ACM TISSEC)\u00a03(3), 161\u2013185 (2000)","journal-title":"ACM Transactions on Information and System Security (ACM TISSEC)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/11832072_25","volume-title":"Security and Cryptography for Networks","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.: Theory and Practice of Multiparty Computation. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 360\u2013364. Springer, Heidelberg (2006)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Halevi, S., Rabin, T.: Secure Hash-and-Sign Signatures without the Random Oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 123\u2013139. Springer, Heidelberg (1999)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/277697.277716","volume-title":"Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC 1998)","author":"R. Gennaro","year":"1998","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC 1998), pp. 101\u2013111. ACM Press, New York (1998)"},{"key":"6_CR14","first-page":"218","volume-title":"Proceedings of the 19th Annual Symposium on Theory of Computing (STOC 1987)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th Annual Symposium on Theory of Computing (STOC 1987), pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77036-9","volume-title":"Analysis by Its History","author":"E. Hairer","year":"2008","unstructured":"Hairer, E., Wanner, G.: Analysis by Its History, 2nd edn. Springer, Berlin (2008)","edition":"2"},{"unstructured":"Knuth, D.: The Art of Computer Programming, vol.\u00a02. Addison-Wesley (1998)","key":"6_CR16"},{"doi-asserted-by":"crossref","unstructured":"Koschuch, M., Hudler, M., Kr\u00fcger, M., Lory, P., Wenzl, J.: Applicability of Multiparty Computation Schemes for Wireless Sensor Networks - Position Paper. In: Sevillano, J.L., Obaidat, M.O., Nicopolitidis, P. (eds.) DCNET 2010 - International Conference on Data Communication Networking - Proceedings of DCNET and OPTICS 2010, pp. 125\u2013128. SciTePress - Science and Technology Publications (2010)","key":"6_CR17","DOI":"10.5220\/0003032901250128"},{"doi-asserted-by":"crossref","unstructured":"Lory, P.: Secure distributed multiplication of two polynomially shared values: Enhancing the efficiency of the protocol. In: Proceedings of the Third International Conference on Emerging Security Information, Systems and Technologies (SECURWARE 2009), pp. 486\u2013491. IEEE Computer Society (2009)","key":"6_CR18","DOI":"10.1109\/SECURWARE.2009.51"},{"doi-asserted-by":"crossref","unstructured":"Lory, P.: Reducing the complexity in the distributed multiplication protocol of two polynomially shared values. In: Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), pp. 404\u2013408. IEEE Computer Society (2007)","key":"6_CR19","DOI":"10.1109\/AINAW.2007.307"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1216370.1216371","volume":"39","author":"J.V. Merwe Der","year":"2007","unstructured":"Der Merwe, J.V., Dawoud, D., McDonald, S.: A survey on peer-to-peer key management for mobile ad hoc networks. ACM Computing Surveys (CSUR)\u00a039(1), 1\u201345 (2007)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/800116.803773","volume-title":"Proceedings of Seventh Annual ACM Symposium on Theory of Computing, STOC 1975","author":"G.L. Miller","year":"1975","unstructured":"Miller, G.L.: Riemann\u2019s Hypothesis and tests for primality. In: Proceedings of Seventh Annual ACM Symposium on Theory of Computing, STOC 1975, pp. 234\u2013239. ACM, New York (1975)"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithms for testing primality. Journal of Number Theory\u00a012, 128\u2013138 (1980)","journal-title":"Journal of Number Theory"},{"issue":"11","key":"6_CR23","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. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"6_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21738-3","volume-title":"Introduction to Numerical Analysis","author":"J. Stoer","year":"2002","unstructured":"Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis, 3rd edn. Springer, Berlin (2002)","edition":"3"},{"unstructured":"Wenzl, J.: Laufzeitanalyse dreier Versionen eines Mehrparteien-Multiplikationsprotokolls. In: Regensburger Diskussionsbeitr\u00e4ge zur Wirtschaftswissenschaft 440. Institut f\u00fcr Wirtschaftsinformatik, Universit\u00e4t Regensburg (2010)","key":"6_CR25"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS 1986), pp. 162\u2013167. IEEE Computer Society (1986)","key":"6_CR26","DOI":"10.1109\/SFCS.1986.25"},{"doi-asserted-by":"crossref","unstructured":"Yiliang, H., Xiaoyuan, Y., Jun, S., Delong, L.: Verifiable threshold cryptosystems based on elliptic curve. In: International Conference on Computer Networks and Mobile Computing, ICCNMC 2003, pp. 334\u2013337. IEEE Computer Society (2003)","key":"6_CR27","DOI":"10.1109\/ICCNMC.2003.1243064"}],"container-title":["Communications in Computer and Information Science","E-Business and Telecommunications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35755-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T23:09:18Z","timestamp":1745363358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35755-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642357541","9783642357558"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35755-8_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}