{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:25:14Z","timestamp":1743150314458,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493007"},{"type":"electronic","value":"9783662493014"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49301-4_33","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T11:15:43Z","timestamp":1458299743000},"page":"543-549","source":"Crossref","is-referenced-by-count":2,"title":["Crypto Santa"],"prefix":"10.1007","author":[{"given":"Peter Y. A.","family":"Ryan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,18]]},"reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/3-540-48329-2_27","volume-title":"Advances in Cryptology - CRYPTO 1993","author":"C Cr\u00e9peau","year":"1994","unstructured":"Cr\u00e9peau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 319\u2013330. Springer, Heidelberg (1994)"},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00165-013-0274-7","volume":"26","author":"J Heather","year":"2014","unstructured":"Heather, J., Schneider, S., Teague, V.: Cryptographic protocols with everyday objects. Formal Aspects Comput. 26(1), 37\u201362 (2014)","journal-title":"Formal Aspects Comput."},{"key":"33_CR3","unstructured":"Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by randomized partial checking. In: Proceedings of the 11th USENIX Security Symposium, San Francisco, CA, USA, 5\u20139 August 2002, pp. 339\u2013353 (2002)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-68880-8_26","volume-title":"Algorithmic Aspects in Information and Management","author":"L Liberti","year":"2008","unstructured":"Liberti, L., Raimondi, F.: The secret santa problem. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 271\u2013279. Springer, Heidelberg (2008)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-662-45921-8_26","volume-title":"Security Protocols XVIII","author":"S Mauw","year":"2014","unstructured":"Mauw, S., Radomirovi\u0107, S., Ryan, P.Y.A.: Security protocols for secret santa. In: Christianson, B., Malcolm, J. (eds.) Security Protocols 2010. LNCS, vol. 7061, pp. 175\u2013184. Springer, Heidelberg (2014)"},{"key":"33_CR6","unstructured":"Haenni, R., Spycher, O.: Secure internet voting on limited devices with anonymized DSA public keys. In: Proceedings of the 2011 Conference on Electronic Voting Technology\/Workshop on Trustworthy Elections, EVT\/WOTE 2011. USENIX Association (2011)"},{"key":"33_CR7","volume-title":"Cryptografie - Beveiliging van de Digitale Maatschappij","author":"G Tel","year":"2002","unstructured":"Tel, G.: Cryptografie - Beveiliging van de Digitale Maatschappij. Addison Wesley, Reading (2002)"},{"key":"33_CR8","unstructured":"Verelst, J.: Secure computing and distributed solutions to the Secret Santa problem. Master\u2019s thesis, Computer Science Dept., University of Utrecht (2003)"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11593447_15","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"D Wikstr\u00f6m","year":"2005","unstructured":"Wikstr\u00f6m, D.: A sender verifiable mix-net and a new proof of a shuffle. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 273\u2013292. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","The New Codebreakers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49301-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:51:33Z","timestamp":1559400693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49301-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493007","9783662493014"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49301-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}