{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:57:04Z","timestamp":1725569824221},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174544"},{"type":"electronic","value":"9783642174551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17455-1_8","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T10:31:49Z","timestamp":1289989909000},"page":"116-135","source":"Crossref","is-referenced-by-count":5,"title":["Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares"],"prefix":"10.1007","author":[{"given":"Koen","family":"Simoens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roel","family":"Peeters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Preneel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-540-28628-8_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Abe","year":"2004","unstructured":"Abe, M., Fehr, S.: Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography. In: Franklin, M.K. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 317\u2013334. Springer, Heidelberg (2004)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-39927-8_28","volume-title":"Information and Communications Security","author":"F. Bao","year":"2003","unstructured":"Bao, F., Deng, R.H., Zhu, H.: Variations of Diffie-Hellman problem. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol.\u00a02836, pp. 301\u2013312. Springer, Heidelberg (2003)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-47555-9_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"D. Beaver","year":"1992","unstructured":"Beaver, D., Haber, S.: Cryptographic protocols provably secure against dynamic adversaries. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 307\u2013323. Springer, Heidelberg (1992)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10623-003-6154-z","volume":"35","author":"D.R.L. Brown","year":"2005","unstructured":"Brown, D.R.L.: Generic groups, collision resistance, and ECDSA. Designs, Codes and Cryptography\u00a035(1), 119\u2013152 (2005)","journal-title":"Designs, Codes and Cryptography"},{"key":"8_CR5","first-page":"136","volume-title":"FOCS 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136\u2013145. IEEE Computer Society, Los Alamitos (2001)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R. Canetti","year":"1999","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 98\u2013115. Springer, Heidelberg (1999)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"8_CR8","first-page":"427","volume-title":"FOCS 1987","author":"P. Feldman","year":"1987","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS 1987, pp. 427\u2013437. IEEE Computer Society, Los Alamitos (1987)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-44586-2_22","volume-title":"Public Key Cryptography","author":"P.A. Fouque","year":"2001","unstructured":"Fouque, P.A., Stern, J.: One round threshold discrete-log key generation without private channels. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 300\u2013316. Springer, Heidelberg (2001)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-48481-7_2","volume-title":"Algorithms - ESA\u201999","author":"Y. Frankel","year":"1999","unstructured":"Frankel, Y., MacKenzie, P.D., Yung, M.: Adaptively-secure distributed public-key systems. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 4\u201327. Springer, Heidelberg (1999)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"E. Fujisaki","year":"1998","unstructured":"Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 32\u201346. Springer, Heidelberg (1998)"},{"issue":"12","key":"8_CR12","doi-asserted-by":"publisher","first-page":"5719","DOI":"10.1109\/TIT.2008.2006431","volume":"54","author":"S. Galbraith","year":"2008","unstructured":"Galbraith, S., Hess, F., Vercauteren, F.: Aspects of pairing inversion. IEEE Transactions on Information Theory\u00a054(12), 5719\u20135728 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR13","unstructured":"Galbraith, S., Paterson, K., Smart, N.: Pairings for cryptographers. Cryptology ePrint Archive, Report 2006\/165 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","first-page":"10","volume-title":"CRYPTO \u201984","author":"T.E. Gamal","year":"1985","unstructured":"Gamal, T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 295\u2013310. Springer, Heidelberg (1999)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-36563-X_26","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"R. Gennaro","year":"2003","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure applications of Pedersen\u2019s distributed key generation protocol. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 373\u2013390. Springer, Heidelberg (2003)"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R. Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. of Cryptology\u00a020(1), 51\u201383 (2007)","journal-title":"J. of Cryptology"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-642-04159-4_19","volume-title":"SAC 2008","author":"S. Heidarvand","year":"2009","unstructured":"Heidarvand, S., Villar, J.L.: Public verifiability from pairings in secret sharing schemes. In: Avanzi, R., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 294\u2013308. Springer, Heidelberg (2009)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S. Jarecki","year":"2000","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 221\u2013242. Springer, Heidelberg (2000)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"SAC 2002","author":"J. Malone-Lee","year":"2002","unstructured":"Malone-Lee, J., Smart, N.P.: Modifications of ECDSA. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 1\u201312. Springer, Heidelberg (2002)"},{"key":"8_CR21","volume-title":"Modern Cryptography: Theory and Practice","author":"W. Mao","year":"2003","unstructured":"Mao, W.: Modern Cryptography: Theory and Practice. Prentice Hall, Englewood Cliffs (2003)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party (extended abstract). In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"issue":"3","key":"8_CR24","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. of Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"J. of Cryptology"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","first-page":"239","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.P. Schnorr","year":"1989","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1989)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"B. Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 148\u2013164. Springer, Heidelberg (1999)"},{"issue":"11","key":"8_CR27","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. of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm. of the ACM"},{"issue":"4","key":"8_CR28","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.dam.2006.07.004","volume":"155","author":"N.P. Smart","year":"2007","unstructured":"Smart, N.P., Vercauteren, F.: On computable isomorphisms in efficient asymmetric pairing-based systems. Discrete Applied Mathematics\u00a0155(4), 538\u2013547 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Stadler","year":"1996","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 190\u2013199. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography - Pairing 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17455-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:48:48Z","timestamp":1619772528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17455-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174544","9783642174551"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17455-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}