{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:56:57Z","timestamp":1725494217650},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008477"},{"type":"electronic","value":"9783540365631"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","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":[[2003]]},"DOI":"10.1007\/3-540-36563-x_19","type":"book-chapter","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T14:24:59Z","timestamp":1194013499000},"page":"281-295","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Shared Generation of Pseudo-Random Functions with Cumulative Maps"],"prefix":"10.1007","author":[{"given":"Huaxiong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","first-page":"27","volume-title":"Adv. in Cryptology-CRYPTO\u2019 88","author":"J. Benaloh","year":"1988","unstructured":"J. Benaloh and J. Leichter. Generalised secret sharing and monotone functions. Adv. in Cryptology-CRYPTO\u2019 88, LNCS, 403(1988), 27\u201335. 283"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"G. R. Blakley. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48(1979), 313\u2013317. 283","DOI":"10.1109\/MARK.1979.8817296"},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume-title":"Security of ramp schemes","author":"G. R. Blakley","year":"1985","unstructured":"G. R. Blakley and C. Meadows. Security of ramp schemes. Advances in Cryptology-Proceedings of CRYPTO\u2019 84, Lecture Notes in Comput. Sci., 196(1985), 242\u2013268. 283"},{"key":"19_CR4","series-title":"Lect Notes Comput Sci","first-page":"110","volume-title":"Advances in Cryptology-CRYPTO\u2019 93","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. Cresti, A. De Santis and U. Vaccaro. Fully dynamic secret sharing schemes. Advances in Cryptology-CRYPTO\u2019 93, Lecture Notes in Comput. Sci., 773(1993), 110\u2013125."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/10718964_37","volume-title":"Information Security and Privacy","author":"E. Brickell","year":"2000","unstructured":"E. Brickell, G. Di Crescenzo and Y. Frankel. Sharing Block Ciphers. Information Security and Privacy, Lecture Notes in Computer Science, 1841(2000) 457\u2013470. 281, 282"},{"key":"19_CR6","unstructured":"T. Cormen, C Leiserson and R. Rivest, Introduction to Algorithms, The MIT Press, 1989. 289, 290"},{"key":"19_CR7","unstructured":"A. De Santis, Y. Desmedt, Y. Frankel and M. Yung. How to Share a Function Securely. Proceedings of ACM Symp. Theory of Computing (STOC)\u2019 94 (1994) 522\u2013533. 281"},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","first-page":"307","volume-title":"Advances in Cryptology-CRYPTO\u2019 89","author":"Y. Desmedt","year":"1989","unstructured":"Y. Desmedt, Y. Frankel. Threshold Cryptosystems. Advances in Cryptology-CRYPTO\u2019 89, Lecture Notes in Computer Science, 435(1989), 307\u2013315. 281"},{"key":"19_CR9","series-title":"Lect Notes Comput Sci","first-page":"556","volume-title":"Eurocrypt\u201900","author":"Y. Desmedt","year":"2000","unstructured":"Y. Desmedt and K. Kurosawa. How to Break a Practical MIX and Design a New One. Eurocrypt\u201900, Lecture Notes in Computer Science, 2000, 556\u2013572. 287"},{"key":"19_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography 2000","author":"P.-A. Fouque","year":"2001","unstructured":"P.-A. Fouque, G. Poupard and J. Stern. Sharing Decryption in the Context of Voting or Lotteries. Financial Cryptography 2000, Lecture Notes in Computer Science, 1962 (2001) 90\u2013104. 281"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell and M. Yung, Witness-based Cryptographic Program Checking and Robust Function Sharing. Proc. 28th STOC, 499\u2013508, ACM, 1996.","DOI":"10.1145\/237814.237998"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. MacKenzie and M. Yung. Robust efficient distributed RSA-key generation. Proc. 30th STOC, 663\u2013672, ACM, 1998. 281","DOI":"10.1145\/276698.276882"},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Advances in Cryptology: Eurocrypt\u2019 96","author":"R. Gennaro","year":"1996","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Robust Threshold DSS Signatures. Advances in Cryptology: Eurocrypt\u2019 96, Lecture Notes in Computer Science, 1070 (1996) 354\u2013371. 281"},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s001459910011","volume":"13","author":"R. Gennaro","year":"2000","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Robust and efficient sharing of RSA functions, J. of Cryptology, 13(2) (2000) 273\u2013300. 281","journal-title":"J. of Cryptology"},{"issue":"4","key":"19_CR15","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33(4) (1986), 792\u2013804.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"R. Impaliazzo, L. Levin and M. Luby. Pseudo-random generation from one-way functions. Proceedings of the 21th Annual ACM Symposium on Theory of Computing, 1989, 12\u201324. 285","DOI":"10.1145\/73007.73009"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M. Ito","year":"1993","unstructured":"M. Ito, A. Saito and T. Nishizeki. Secret Sharing Scheme Realizing General Access Structure. J. Cryptology, 6 (1993) 15\u201320. 282, 283, 284","journal-title":"J. Cryptology"},{"key":"19_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-57220-1_51","volume-title":"Advances in Cryptology: Auscrypt\u2019 92","author":"W.-A. Jackson","year":"1993","unstructured":"W.-A. Jackson and K. M. Martin. Cumulative Arrays and Geometric Secret Sharing Schemes, Advances in Cryptology: Auscrypt\u2019 92, Lecture Notes in Computer Science, 718 (1993) 48\u201355. 282, 283, 284, 286, 290"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"W.-A. Jackson","year":"1994","unstructured":"W.-A. Jackson and K. M. Martin. Geometric secret sharing schemes and their duals. Des. Codes Cryptogr., 4(1994), 83\u201395. 283","journal-title":"Des. Codes Cryptogr."},{"key":"19_CR20","first-page":"51","volume":"14","author":"W.-A. Jackson","year":"1996","unstructured":"W.-A. Jackson and K. M. Martin. A combinatorial interpretation of ramp schemes. Australasian Journal of Combinatorics, 14(1996), 51\u201360. 283","journal-title":"Australasian Journal of Combinatorics"},{"key":"19_CR21","series-title":"Lect Notes Comput Sci","first-page":"126","volume-title":"Advances in Cryptology: Eurocrypt\u2019 93","author":"K. Kurosawa","year":"1993","unstructured":"K. Kurosawa, K. Okada, K. Sakano, W. Ogata and S. Tsujii. Non-perfect secret sharing schemes and matroids. Advances in Cryptology: Eurocrypt\u2019 93, Lecture Notes in Computer Science, 765 (1993) 126\u2013141. 283"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"L. Levin. One-way functions and pseudorandom generators. Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, 363\u2013365. 285","DOI":"10.1145\/22145.22185"},{"key":"19_CR23","unstructured":"K. Martin, R. Safavi-Naini, H. Wang and P. Wild. Distributing the Encryption and Decryption of a Block Cipher. Preprint, 2002. 293"},{"key":"19_CR24","series-title":"Lect Notes Comput Sci","volume-title":"Threshold MACs","author":"K. Martin","year":"2002","unstructured":"K. Martin, J. Pieprzyk, R. Safavi-Naini, H. Wang and P. Wild. Threshold MACs. ICISC02, the 5th international conference on information security and Cryptology, Lecture Notes in Computer Science, 2002, to appear. 293"},{"key":"19_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-44750-4_15","volume-title":"Advances in Cryptology: CRYPTO\u2019 95","author":"S. Micali","year":"1995","unstructured":"S. Micali and R. Sidney. A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems. Advances in Cryptology: CRYPTO\u2019 95, Lecture Notes in Computer Science, 963(1995), 185\u2013195. 282, 284, 285, 286, 287, 288, 289"},{"key":"19_CR26","unstructured":"D. Mount. Design and Analysis of Computer Algorithms. Lecture Notes of the University of Maryland, College Park, 1999. 290"},{"key":"19_CR27","unstructured":"M. Naor, N. Pinks and O. Reingold, Distributied Pseudo-random Functions and KDCs. Eurocrypt\u201999. 282, 286, 287, 290"},{"issue":"8","key":"19_CR28","first-page":"690","volume":"4","author":"W. Ogata","year":"1998","unstructured":"W. Ogata and K. Kurosawa, Some basic properties of general nonperfect secret sharing schemes, Journal of Universal Computer Science, 4(8), 1998, 690\u2013704. 283","journal-title":"Journal of Universal Computer Science"},{"key":"19_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Crypto\u2019 98","author":"T. Rabin","year":"1998","unstructured":"T. Rabin, A simplified Approach to Threshold and Proactive RSA, In Crypto\u2019 98, pages 89\u2013104, 1998. Springer-Verlag, LNCS 1109. 281"},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Communications of the ACM, 22:612\u2013613, 1979. 283","journal-title":"Communications of the ACM"},{"key":"19_CR31","first-page":"71","volume":"1","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons, W.-A. Jackson and K. Martin. The Geometry of Shared Secret Schemes, Bulletin of the ICA, 1 (1991), 71\u201388. 283","journal-title":"Bulletin of the ICA"},{"key":"19_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology-Eurocrypt\u201999","author":"V. Shoup","year":"2000","unstructured":"V. Shoup, Practical Threshold Signature, Advances in Cryptology-Eurocrypt\u201999, LNCS, 1807(2000), 207\u2013222."},{"key":"19_CR33","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr., 2:357\u2013390, 1992. 283","journal-title":"Des. Codes Cryptogr."}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2003"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36563-X_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T19:58:19Z","timestamp":1588017499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36563-X_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008477","9783540365631"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-36563-x_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}