{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:40Z","timestamp":1750307920851,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T00:00:00Z","timestamp":1174348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,3,20]]},"DOI":"10.1145\/1229285.1229297","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:41:00Z","timestamp":1175802060000},"page":"57-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Kleptographic attacks on a cascade of mix servers"],"prefix":"10.1145","author":[{"given":"Przemys\u0142aw","family":"Kubiak","sequence":"first","affiliation":[{"name":"Wroclaw University of Technology"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[{"name":"Wroclaw University of Technology"}]},{"given":"Filip","family":"Zag\u00f3rski","sequence":"additional","affiliation":[{"name":"Wroclaw University of Technology"}]}],"member":"320","published-online":{"date-parts":[[2007,3,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056677"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSNC.2006.50"},{"key":"e_1_3_2_1_3_1","unstructured":"Certicom Inc. The Certicom ECC challenge. {online}. Available from: http:\/\/www.certicom.com\/index.php?action=ecc ecc_challenge.]]  Certicom Inc. The Certicom ECC challenge. {online}. Available from: http:\/\/www.certicom.com\/index.php?action=ecc ecc_challenge.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSECP.2004.1264852"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889663_9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_3_2_1_7_1","unstructured":"W. M. Duckworth II. Codes Designs and Distance. PhD thesis University of North Carolina at Chapel Hill 1998.]]  W. M. Duckworth II. Codes Designs and Distance . PhD thesis University of North Carolina at Chapel Hill 1998.]]"},{"key":"e_1_3_2_1_8_1","volume-title":"Hardness of approximating the minimum distance of a linear code. Electronic Colloquium on Computational Complexity (ECCC), 6(29)","author":"Dumer I.","year":"1999","unstructured":"I. Dumer , D. Micciancio , and M. Sudan . Hardness of approximating the minimum distance of a linear code. Electronic Colloquium on Computational Complexity (ECCC), 6(29) , 1999 .]] I. Dumer, D. Micciancio, and M. Sudan. Hardness of approximating the minimum distance of a linear code. Electronic Colloquium on Computational Complexity (ECCC), 6(29), 1999.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11766155_35"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005140.1005155"},{"key":"e_1_3_2_1_11_1","volume-title":"Dec.","author":"Har-Peled S.","year":"2005","unstructured":"S. Har-Peled . Class notes for randomized algorithms , Dec. 2005 .]] S. Har-Peled. Class notes for randomized algorithms, Dec. 2005.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647096.716871"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647253.720294"},{"key":"e_1_3_2_1_14_1","volume-title":"Forward-secure key evolution protocol in wireless sensor networks","author":"Klonowski M.","year":"2006","unstructured":"M. Klonowski , M. Kuty\u0142owski , M. Ren , and K. Rybarczyk . Forward-secure key evolution protocol in wireless sensor networks . Nov. 2006 . Manuscript .]] M. Klonowski, M. Kuty\u0142owski, M. Ren, and K. Rybarczyk. Forward-secure key evolution protocol in wireless sensor networks. Nov. 2006. Manuscript.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"The Art of Computer Programming: Seminumerical Algorithms","author":"Knuth D. E.","year":"1998","unstructured":"D. E. Knuth . The Art of Computer Programming: Seminumerical Algorithms ., volume 2 . Addison-Wesley , Reading, Massachusetts , 3 rd edition, Nov. 1998 .]] D. E. Knuth. The Art of Computer Programming: Seminumerical Algorithms., volume 2. Addison-Wesley, Reading, Massachusetts, 3rd edition, Nov. 1998.]]","edition":"3"},{"key":"e_1_3_2_1_16_1","volume-title":"IAVoSS Workshop On Trustworthy Elections (WOTE","author":"Lundin D.","year":"2006","unstructured":"D. Lundin , H. Treharne , P. Y. Ryan , S. Schneider , and J. Heather . Distributed creation of the ballot form in Pr\u00eat \u00e0 Voter using an element of visual encryption . IAVoSS Workshop On Trustworthy Elections (WOTE 2006 ).]] D. Lundin, H. Treharne, P. Y. Ryan, S. Schneider, and J. Heather. Distributed creation of the ballot form in Pr\u00eat \u00e0 Voter using an element of visual encryption. IAVoSS Workshop On Trustworthy Elections (WOTE 2006).]]"},{"key":"e_1_3_2_1_17_1","volume-title":"The Hamming codes and Delsarte's linear programming bound. Master's thesis","author":"McKinley S.","year":"2003","unstructured":"S. McKinley . The Hamming codes and Delsarte's linear programming bound. Master's thesis , Portland State University , May 2003 .]] S. McKinley. The Hamming codes and Delsarte's linear programming bound. Master's thesis, Portland State University, May 2003.]]"},{"key":"e_1_3_2_1_18_1","volume-title":"Handbook of applied cryptography","author":"Menezes A. J.","year":"1996","unstructured":"A. J. Menezes , P. C. van Oorschot , and S. A. Vanstone . Handbook of applied cryptography . CRC Press , Boca Raton , Florida, 1996 .]] A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of applied cryptography. CRC Press, Boca Raton, Florida, 1996.]]"},{"key":"e_1_3_2_1_19_1","first-page":"335","volume-title":"ESORICS, LNCS 3193","author":"M\u00f6ller B.","year":"2004","unstructured":"B. M\u00f6ller . A public-key encryption scheme with pseudo-random ciphertexts . In: ESORICS, LNCS 3193 , pages 335 -- 351 . Springer , 2004 .]] B. M\u00f6ller. A public-key encryption scheme with pseudo-random ciphertexts. In: ESORICS, LNCS 3193, pages 335--351. Springer, 2004.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.55"},{"key":"e_1_3_2_1_21_1","unstructured":"C. Neff. Verifiable mixing (shuffling) of ElGamal pairs. Apr. 2004.]]  C. Neff. Verifiable mixing (shuffling) of ElGamal pairs. Apr. 2004.]]"},{"key":"e_1_3_2_1_22_1","volume-title":"Workshop on Electronic Voting and e-Government in the UK, 27th-28th","author":"Ryan P.","year":"2006","unstructured":"P. Ryan . Socio-technical trade-offs in cryptographic voting schemes . Workshop on Electronic Voting and e-Government in the UK, 27th-28th Feb. 2006 .]] P. Ryan. Socio-technical trade-offs in cryptographic voting schemes. Workshop on Electronic Voting and e-Government in the UK, 27th-28th Feb. 2006.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_20"},{"key":"e_1_3_2_1_26_1","volume-title":"Introduction to Coding Theory. Graduate Texts in Mathematics","author":"van Lint J. H.","year":"1998","unstructured":"J. H. van Lint . Introduction to Coding Theory. Graduate Texts in Mathematics . Springer-Verlag New York, Inc. , Secaucus, NJ, USA , 3rd rev. and expanded edition, 1998 .]] J. H. van Lint. Introduction to Coding Theory. Graduate Texts in Mathematics. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 3rd rev. and expanded edition, 1998.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"e_1_3_2_1_28_1","first-page":"89","volume-title":"LNCS 1109","author":"Young A.","year":"1996","unstructured":"A. Young and M. Yung . The dark side of \"black-box\" cryptography, or: Should we trust capstone? In: CRYPTO , LNCS 1109 , pages 89 -- 103 . Springer , 1996 .]] A. Young and M. Yung. The dark side of \"black-box\" cryptography, or: Should we trust capstone? In: CRYPTO, LNCS 1109, pages 89--103. Springer, 1996.]]"},{"key":"e_1_3_2_1_29_1","first-page":"62","volume-title":"EUROCRYPT, LNCS 1233","author":"Young A.","year":"1997","unstructured":"A. Young and M. Yung . Kleptography: Using cryptography against cryptography . In: EUROCRYPT, LNCS 1233 , pages 62 -- 74 . Springer , 1997 .]] A. Young and M. Yung. Kleptography: Using cryptography against cryptography. In: EUROCRYPT, LNCS 1233, pages 62--74. Springer, 1997.]]"},{"key":"e_1_3_2_1_30_1","first-page":"235","volume-title":"CHES, LNCS 2162","author":"Young A.","year":"2001","unstructured":"A. Young and M. Yung . Bandwidth-optimal kleptographic attacks . In: CHES, LNCS 2162 , pages 235 -- 250 . Springer , 2001 .]] A. Young and M. Yung. Bandwidth-optimal kleptographic attacks. In: CHES, LNCS 2162, pages 235--250. Springer, 2001.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-540-30564-4_14","volume-title":"Selected Areas in Cryptography, LNCS 3357","author":"Young A.","year":"2004","unstructured":"A. Young and M. Yung . A subliminal channel in secret block ciphers . In: Selected Areas in Cryptography, LNCS 3357 , pages 198 -- 211 . Springer , 2004 .]] A. Young and M. Yung. A subliminal channel in secret block ciphers. In: Selected Areas in Cryptography, LNCS 3357, pages 198--211. Springer, 2004.]]"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_9"}],"event":{"name":"Asia CCS07: Asia CCS'07 ACM Symposium on Information, Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Singapore","acronym":"Asia CCS07"},"container-title":["Proceedings of the 2nd ACM symposium on Information, computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1229285.1229297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1229285.1229297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:36Z","timestamp":1750258296000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1229285.1229297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,20]]},"references-count":31,"alternative-id":["10.1145\/1229285.1229297","10.1145\/1229285"],"URL":"https:\/\/doi.org\/10.1145\/1229285.1229297","relation":{},"subject":[],"published":{"date-parts":[[2007,3,20]]},"assertion":[{"value":"2007-03-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}