{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:50Z","timestamp":1750307270276,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001837","name":"Estonian Science Foundation","doi-asserted-by":"publisher","award":["8124"],"award-info":[{"award-number":["8124"]}],"id":[{"id":"10.13039\/501100001837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1982185.1982508","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:14Z","timestamp":1305637154000},"page":"1510-1515","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On the (im)possibility of perennial message recognition protocols without public-key cryptography"],"prefix":"10.1145","author":[{"given":"Madeline","family":"Gonz\u00e1lez Mu\u00f1iz","sequence":"first","affiliation":[{"name":"Cybernetica AS, Tallinn, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/112600.112618"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/302350.302353"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/11555827_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/794201.795170"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/11863908_25"},{"key":"e_1_3_2_1_6_1","first-page":"138","volume-title":"Does Secure Time-Stamping Imply Collision-Free Hash Functions? In ProvSec (LNCS 4784)","author":"Buldas A.","year":"2007","unstructured":"A. Buldas and A. J\u00fcrgenson . Does Secure Time-Stamping Imply Collision-Free Hash Functions? In ProvSec (LNCS 4784) , pages 138 -- 150 . Springer , 2007 . A. Buldas and A. J\u00fcrgenson. Does Secure Time-Stamping Imply Collision-Free Hash Functions? In ProvSec (LNCS 4784), pages 138--150. Springer, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/978-3-540-88733-1_18"},{"key":"e_1_3_2_1_8_1","first-page":"500","volume-title":"ASIACRYPT (LNCS 3329)","author":"Buldas A.","year":"2004","unstructured":"A. Buldas and M. Saarepera . On Provably Secure Time-Stamping Schemes . In ASIACRYPT (LNCS 3329) , pages 500 -- 514 . Springer , 2004 . A. Buldas and M. Saarepera. On Provably Secure Time-Stamping Schemes. In ASIACRYPT (LNCS 3329), pages 500--514. Springer, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/978-3-642-11528-8_5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"Goldreich O.","year":"2001","unstructured":"O. Goldreich . Foundations of Cryptography , Volume I - Basic Techniques. Cambridge University Press , 2001 . O. Goldreich. Foundations of Cryptography, Volume I - Basic Techniques. Cambridge University Press, 2001."},{"key":"e_1_3_2_1_13_1","volume-title":"ICISC '09: 12th International Conference on Information Security and Cryptology","author":"Gonz\u00e1lez Mu\u00f1iz M.","year":"2009","unstructured":"M. Gonz\u00e1lez Mu\u00f1iz and R. Steinwandt . Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson . In ICISC '09: 12th International Conference on Information Security and Cryptology , 2009 . M. Gonz\u00e1lez Mu\u00f1iz and R. Steinwandt. Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson. In ICISC '09: 12th International Conference on Information Security and Cryptology, 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/73007.73012"},{"key":"e_1_3_2_1_15_1","volume-title":"Implementing Cryptographic Primitives in the Symbolic Model. Submitted","author":"Laud P.","year":"2010","unstructured":"P. Laud . Implementing Cryptographic Primitives in the Symbolic Model. Submitted , 2010 . P. Laud. Implementing Cryptographic Primitives in the Symbolic Model. Submitted, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1504\/IJSN.2009.023427"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/288090.288117"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/IPSN.2008.47"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/978-3-540-89754-5_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/978-3-540-89641-8_27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/978-3-642-01957-9_14"},{"key":"e_1_3_2_1_22_1","first-page":"369","volume-title":"CRYPTO (LNCS 293)","author":"Merkle R. C.","year":"1987","unstructured":"R. C. Merkle . A Digital Signature Based on a Conventional Encryption Function . In CRYPTO (LNCS 293) , pages 369 -- 378 . Springer , 1987 . R. C. Merkle. A Digital Signature Based on a Conventional Encryption Function. In CRYPTO (LNCS 293), pages 369--378. Springer, 1987."},{"key":"e_1_3_2_1_23_1","first-page":"360","volume-title":"9th IMA International Conference (LNCS 2398)","author":"Mitchell C. J.","year":"2003","unstructured":"C. J. Mitchell . Remote User Authentication Using Public Information. In Cryptography and Coding , 9th IMA International Conference (LNCS 2398) , pages 360 -- 369 . Springer-Verlag , 2003 . C. J. Mitchell. Remote User Authentication Using Public Information. In Cryptography and Coding, 9th IMA International Conference (LNCS 2398), pages 360--369. Springer-Verlag, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.5555\/1150577.1150581"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/CSF.2010.25"},{"key":"e_1_3_2_1_26_1","first-page":"334","volume-title":"Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In EUROCRYPT (LNCS 1403)","author":"Simon D. R.","year":"1998","unstructured":"D. R. Simon . Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In EUROCRYPT (LNCS 1403) , pages 334 -- 345 . Springer , 1998 . D. R. Simon. Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In EUROCRYPT (LNCS 1403), pages 334--345. Springer, 1998."},{"key":"e_1_3_2_1_27_1","first-page":"172","volume-title":"7th International Workshop (LNCS 1796)","author":"Stajano F.","year":"2000","unstructured":"F. Stajano and R. Anderson . The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks. In Security Protocols , 7th International Workshop (LNCS 1796) , pages 172 -- 182 . Springer , 2000 . F. Stajano and R. Anderson. The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks. In Security Protocols, 7th International Workshop (LNCS 1796), pages 172--182. Springer, 2000."},{"key":"e_1_3_2_1_28_1","first-page":"73","volume-title":"10th Annual International Workshop, SAC 2003 (LNCS 3006)","author":"Weimerskirch A.","year":"2004","unstructured":"A. Weimerskirch and D. Westhoff . Zero Common-Knowledge Authentication for Pervasive Networks. In Selected Areas in Cryptography , 10th Annual International Workshop, SAC 2003 (LNCS 3006) , pages 73 -- 87 . Springer , 2004 . A. Weimerskirch and D. Westhoff. Zero Common-Knowledge Authentication for Pervasive Networks. In Selected Areas in Cryptography, 10th Annual International Workshop, SAC 2003 (LNCS 3006), pages 73--87. Springer, 2004."},{"key":"e_1_3_2_1_29_1","first-page":"55","volume-title":"IEEE Symposium on Security and Privacy","author":"Zhou J.","year":"1996","unstructured":"J. Zhou and D. Gollmann . A Fair Non-repudiation Protocol . In IEEE Symposium on Security and Privacy , pages 55 -- 61 . IEEE Computer Society , 1996 . J. Zhou and D. Gollmann. A Fair Non-repudiation Protocol. In IEEE Symposium on Security and Privacy, pages 55--61. IEEE Computer Society, 1996."}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"acronym":"SAC'11","name":"SAC'11: The 2011 ACM Symposium on Applied Computing","location":"TaiChung Taiwan"},"container-title":["Proceedings of the 2011 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982508","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1982185.1982508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:56Z","timestamp":1750243976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":28,"alternative-id":["10.1145\/1982185.1982508","10.1145\/1982185"],"URL":"https:\/\/doi.org\/10.1145\/1982185.1982508","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}