{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:16:19Z","timestamp":1648934179305},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,1,20]],"date-time":"2010-01-20T00:00:00Z","timestamp":1263945600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10623-009-9357-0","type":"journal-article","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T09:12:41Z","timestamp":1263892361000},"page":"139-160","source":"Crossref","is-referenced-by-count":2,"title":["Anonymity in shared symmetric key primitives"],"prefix":"10.1007","volume":"57","author":[{"given":"Gregory M.","family":"Zaverucha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,20]]},"reference":[{"key":"9357_CR1","doi-asserted-by":"crossref","unstructured":"An J.H., Dodis Y., Rabin T.: On the security of joint signature and encryption. In: Proceedings of EUROCRYPT\u201902, LNCS 2332, pp. 83\u2013107 (2002).","DOI":"10.1007\/3-540-46035-7_6"},{"key":"9357_CR2","doi-asserted-by":"crossref","unstructured":"Bassalygo L.A., Burmester M., Dyachkov A., Kabatianski G.: Hash codes. In: Proceedings of the 1997 IEEE International Symposium on Information Theory, pp. 174 (1997).","DOI":"10.1109\/ISIT.1997.613089"},{"key":"9357_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1006\/jcta.1998.2876","volume":"83","author":"S.R. Blackburn","year":"1998","unstructured":"Blackburn S.R., Wild P.R.: Optimal linear perfect hash families. J. Combinat. Theory Ser. A 83, 233\u2013250 (1998)","journal-title":"J. Combinat. Theory Ser. A"},{"key":"9357_CR4","doi-asserted-by":"crossref","unstructured":"Brickell E.F., Di Crescenzo G., Frankel Y.: Sharing block ciphers. In: Information Security and Privacy, LNCS 1841, pp. 457\u2013470 (2000).","DOI":"10.1007\/10718964_37"},{"key":"9357_CR5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/214438.214442","volume":"3","author":"S. Even","year":"1985","unstructured":"Even S., Goldreich O.: On the power of cascade ciphers. ACM Trans. Comput. Syst. 3, 108\u2013116 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9357_CR6","doi-asserted-by":"crossref","unstructured":"Katz J., Lindell A.Y.: Aggregate message authentication codes. In: Proceedings of CT-RSA \u201908, LNCS 4964, pp. 155\u2013169 (2008).","DOI":"10.1007\/978-3-540-79263-5_10"},{"key":"9357_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10623-006-9004-y","volume":"41","author":"L. Liu","year":"2006","unstructured":"Liu L., Shen H.: Explicit constructions of separating hash families from algebraic curves over finite fields. Desig. Codes Cryptogr. 41, 221\u2013233 (2006)","journal-title":"Desig. Codes Cryptogr."},{"key":"9357_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10623-006-0007-5","volume":"40","author":"S. Long","year":"2006","unstructured":"Long S., Pieprzyk J., Wang H., Wong D.S.: Generalised cumulative arrays in secret sharing. Desig. Codes Cryptogr. 40, 191\u2013209 (2006)","journal-title":"Desig. Codes Cryptogr."},{"key":"9357_CR9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1515\/JMC.2007.002","volume":"1","author":"K.M. Martin","year":"2007","unstructured":"Martin K.M., Ng S.-L.: The combinatorics of generalised cumulative arrays. J. Math. Cryptol. 1, 13\u201332 (2007)","journal-title":"J. Math. Cryptol."},{"key":"9357_CR10","unstructured":"Martin K.M., Pieprzyk J., Safavi-Naini R., Wang H., Wild P.R.: Threshold MACs. In: Proceedings of ICISC 2002, LNCS 2587, pp. 237\u2013252 (2003)."},{"key":"9357_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10623-003-1719-4","volume":"36","author":"K.M. Martin","year":"2005","unstructured":"Martin K.M., Safavi-Naini R., Wang H., Wild P.R.: Distributing the encryption and decryption of a block cipher. Desig. Codes Cryptogr. 36, 263\u2013287 (2005)","journal-title":"Desig. Codes Cryptogr."},{"key":"9357_CR12","volume-title":"Data Structures and Algorithms, vol 1","author":"K. Melhorn","year":"1984","unstructured":"Melhorn K.: Data Structures and Algorithms, vol 1. Springer-Verlag, Berlin (1984)"},{"key":"9357_CR13","unstructured":"Walker R.A., II: PHFtables.com. www.phftables.com . Accessed April (2008)."},{"key":"9357_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/(SICI)1520-6610(2000)8:3<189::AID-JCD4>3.0.CO;2-A","volume":"8","author":"D.R. Stinson","year":"2000","unstructured":"Stinson D.R., Wei R., Zhu L.: New constructions for perfect hash families and related structures using combinatorial designs and codes. J. Combinat. Desig. 8, 189\u2013200 (2000)","journal-title":"J. Combinat. Desig."},{"key":"9357_CR15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"D.R. Stinson","year":"2002","unstructured":"Stinson D.R.: Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Math. Comput. 71, 379\u2013391 (2002)","journal-title":"Math. Comput."},{"key":"9357_CR16","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0012-365X(03)00287-5","volume":"279","author":"D.R. Stinson","year":"2004","unstructured":"Stinson D.R., Wei R.: Generalized cover-free families. Discrete Math. 279, 463\u2013477 (2004)","journal-title":"Discrete Math."},{"key":"9357_CR17","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jcta.2000.3068","volume":"93","author":"H. Wang","year":"2001","unstructured":"Wang H., Xing C.: Explicit constructions of perfect hash families from algebraic curves over finite fields. J. Combinat. Theory Ser. A 93, 112\u2013124 (2001)","journal-title":"J. Combinat. Theory Ser. A"},{"key":"9357_CR18","doi-asserted-by":"crossref","unstructured":"Wang H., Pieprzyk J.: Shared generation of pseudo-random function with cumulative maps. In: Proceedings of CT-RSA \u201903, LNCS 2612, pp. 281\u2013294 (2003).","DOI":"10.1007\/3-540-36563-X_19"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9357-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9357-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9357-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:27Z","timestamp":1559231907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9357-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,20]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9357"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9357-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,20]]}}}