{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:24Z","timestamp":1725488064208},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006466"},{"type":"electronic","value":"9783540365044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36504-4_17","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T18:48:45Z","timestamp":1184957325000},"page":"238-252","source":"Crossref","is-referenced-by-count":2,"title":["Redistribution of Mechanical Secret Shares"],"prefix":"10.1007","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rei","family":"Safavi-Naini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BFb0027933","volume-title":"Information Security and Privacy, Second Australian Conference, ACISP\u2019 97","author":"F. Bao","year":"1997","unstructured":"F. Bao, R. Deng, Y. Han, and A. Jeng. Design and analysis of two basic protocols for use in TTP-based key escrow. Information Security and Privacy, Second Australian Conference, ACISP\u2019 97, LNCS 1270 (1997), 261\u2013270. Sydney, NSW, Australia, July 7\u20139."},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","first-page":"251","volume-title":"Advances in Cryptology-Crypto\u2019 86","author":"J. C. Benaloh","year":"1986","unstructured":"J. C. Benaloh, Secret sharing homomorphisms: Keeping shares of a secret secret, Advances in Cryptology-Crypto\u2019 86, LNCS, 263(1986), 251\u2013260."},{"key":"17_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-48329-2_28","volume-title":"Advances in Cryptology-CRYPTO\u201993","author":"J. Bierbrauer","year":"1994","unstructured":"J. Bierbrauer, T. Johansson, G. Kabatianskii and B. Smeets, On families of hash functions via geometric codes and concatenation, Advances in Cryptology-CRYPTO\u201993, LNCS, 773 (1994), 331\u2013342."},{"key":"17_CR4","first-page":"313","volume":"48","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48:313\u2013317, 1979.","journal-title":"Proceedings of AFIPS 1979 National Computer Conference"},{"key":"17_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Advance in Cryptology-Eurocrypt\u2019 96","author":"S. R. Blackburn","year":"1996","unstructured":"S. R. Blackburn, M. Burmester, Y. Desmedt and P. R. Wild, \u2018Efficient multiplicative sharing schemes,\u2019 in Advance in Cryptology-Eurocrypt\u2019 96, LNCS, 1070(1996), 107\u2013118."},{"key":"17_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623714","volume-title":"Deisigns, Graphs, Codes, and their Links","author":"P. J. Cameron","year":"1991","unstructured":"P. J. Cameron and J. H. Van Lint, Deisigns, Graphs, Codes, and their Links, Cambridge University Press, Cambridge 1991."},{"key":"17_CR7","first-page":"241","volume-title":"Cryptography and coding","author":"C. Boyd","year":"1986","unstructured":"C. Boyd. Digital multisignatures. In H. Beker and F. Piper, editors, Cryptography and coding, pp. 241\u2013246. Clarendon Press, 1989. Royal Agricultural College, Cirencester, December 15\u201317, 1986."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman, Universal classes of hash functions, Journal of Computer and System Sci., 18(1979), 143\u2013154","journal-title":"Journal of Computer and System Sci."},{"key":"17_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-62494-5_14","volume-title":"Security Protocols","author":"L. Chen","year":"1997","unstructured":"L. Chen, D. Gollmann, and C. Mitchell. Key escrow in mutually mistrusting domains. Security Protocols LNCS 1189 (1997), 139\u2013153."},{"key":"17_CR10","unstructured":"Y. Desmedt and S. Jajodia, Redistributing secret shares to new access structures and its applications, Preprint, 1997."},{"key":"17_CR11","unstructured":"J. Diamant and F. Rhee. FBI follows money to 7 close to home, catches Ghantt in Mexico. The Charlotte Observer, March 3, 1998. See also: \n                  http:\/\/www.charlotte.com\/observer\/special\/heist\/pub\/heist.htm\n                  \n                ."},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P. Erd\u00f6s","year":"1985","unstructured":"P. Erd\u00f6s, P. Frankl, and Z. Furedi, Families of finite sets in which no sets is covered by the union of r others, Israel Journal of Mathematics, 51(1985), 79\u201389.","journal-title":"Israel Journal of Mathematics"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Y. Frankel and P. Gemmell and P. D. MacKenzie and M. Yung, Optimal Resilience Proactive Public Key Cryptosystems, 38th Annual Symp. on Foundations of Computer Science (FOCS), 1997.","DOI":"10.1109\/SFCS.1997.646127"},{"key":"17_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-68697-5_3","volume-title":"Advances in Cryptology-Crypto\u201996","author":"T. Helleseth","year":"1996","unstructured":"T. Helleseth and T. Johansson, Universal hash functions from exponential sums over finite fields and Galois Rings, Advances in Cryptology-Crypto\u201996, LNCS, 1109(1996), 31\u201344."},{"key":"17_CR15","volume-title":"Projective Geometries over finite fields","author":"J. W. P. Hirschfeld","year":"1979","unstructured":"J. W. P. Hirschfeld. Projective Geometries over finite fields. Oxford University Press, N.Y., 1979."},{"key":"17_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 99","author":"R. Kumar","year":"1999","unstructured":"R. Kumar, S. Rajagopalan and A. Sahai. Coding constructions for blacklisting problems without computational assumptions, Advances in Cryptology\u2014CRYPTO\u2019 99, LNCS, 1666(1999), 609\u2013623."},{"issue":"8","key":"17_CR17","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1093\/comjnl\/42.8.638","volume":"42","author":"K. Martin","year":"1999","unstructured":"K. Martin, R. Safavi-Naini, and H. Wang, Bounds and techniques for efficient redistribution of secret shares to new access structures, The Computer Journal, 42(8) (1999), 638\u2013649.","journal-title":"The Computer Journal"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. Proceedings of the twenty first annual ACM Symp. Theory of Computing, STOC, (1989), 33\u201343.","DOI":"10.1145\/73007.73011"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1976","unstructured":"A. Shamir, How to Share a Secret, Communications of the ACM, 22(1976), 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"17_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-46766-1_5","volume-title":"Advances in Cryptology-CRYPTO\u2019 91","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, Universal hashing and authentication codes, Advances in Cryptology-CRYPTO\u2019 91, LNCS, 576 (1992), 74\u201385."},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D. R. Stinson","year":"1998","unstructured":"D. R. Stinson and R. Wei, Combinatorial Properties and Constructions of Trace-ability Schemes and Frameproof Codes, SIAM. J. Discrete Math, 11(1998)41\u201353.","journal-title":"SIAM. J. Discrete Math"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"D. S. Stinson","year":"2000","unstructured":"D. S. Stinson, R. Wei and L. Zhu, Some new bounds for cover-free families, Journal of Combinatorial Theory, A, 90(2000), 224\u2013234.","journal-title":"Journal of Combinatorial Theory, A"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"J. H. van Lint, Introduction to Coding Theory, Graduate Texts in Mathematics, Vol. 86, Springer-Verlag, 1992.","DOI":"10.1007\/978-3-662-00174-5"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. N. Wegman","year":"1981","unstructured":"M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22 (1981), 265\u2013279.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR25","unstructured":"F. J. MacWilliams and N. J. Sloane. The Theory of Error-Correcting Codes, north-holland publishing company, 1978."}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36504-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T18:08:46Z","timestamp":1548353326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36504-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006466","9783540365044"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-36504-4_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}