{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T14:09:41Z","timestamp":1770732581685,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,10,25]],"date-time":"2004-10-25T00:00:00Z","timestamp":1098662400000},"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":[[2004,10,25]]},"DOI":"10.1145\/1030083.1030128","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T17:55:16Z","timestamp":1107107716000},"page":"330-343","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["The dual receiver cryptosystem and its applications"],"prefix":"10.1145","author":[{"given":"Theodore","family":"Diament","sequence":"first","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Homin K.","family":"Lee","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelos D.","family":"Keromytis","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,10,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Memory-bound Functions. In Proceedings of the ISOC Symposium on Network and Distributed Systems Security (SNDSS)","author":"Abadi M.","year":"2003","unstructured":"M. Abadi , M. Burrow , M. Manasse , and T. Wobber . Moderately Hard , Memory-bound Functions. In Proceedings of the ISOC Symposium on Network and Distributed Systems Security (SNDSS) , February 2003 .]] M. Abadi, M. Burrow, M. Manasse, and T. Wobber. Moderately Hard, Memory-bound Functions. In Proceedings of the ISOC Symposium on Network and Distributed Systems Security (SNDSS), February 2003.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586118"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502048"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0028465","volume-title":"Proceedings of International Conferenec on Information and Communications Security (ICICS)","author":"Aura T.","year":"1997","unstructured":"T. Aura and P. Nikander . Stateless connections . In Proceedings of International Conferenec on Information and Communications Security (ICICS) , Lecture Notes in Computer Science volume 1334 , pages 87 -- 97 . Springer , November 1997 .]] T. Aura and P. Nikander. Stateless connections. In Proceedings of International Conferenec on Information and Communications Security (ICICS), Lecture Notes in Computer Science volume 1334, pages 87--97. Springer, November 1997.]]"},{"key":"e_1_3_2_1_5_1","unstructured":"A. Back. Hashcash - A Denial of Service Counter-Measure. http:\/\/www.cypherspace.org\/hashcash\/hashcash.pdf August 2002.]]  A. Back. Hashcash - A Denial of Service Counter-Measure. http:\/\/www.cypherspace.org\/hashcash\/hashcash.pdf August 2002.]]"},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology | CRYPTO","author":"Boneh D.","year":"2001","unstructured":"D. Boneh and M. Franklin . Identity-based encryption from the Weil pairing . In J. Kilian, editor, Advances in Cryptology | CRYPTO 2001 , volume 2139 of Lecture Notes in Computer Science , pages 213 -- 229 . Springer-Verlag , 2001.]] D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, Advances in Cryptology | CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 213--229. Springer-Verlag, 2001.]]"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology | ASIACRYPT","author":"Boneh D.","year":"2001","unstructured":"D. Boneh , B. Lynn , and H. Shacham . Short signatures from the Weil pairing . In C. Boyd, editor, Advances in Cryptology | ASIACRYPT 2001 , volume 2248 of Lecture Notes in Computer Science , pages 514 -- 532 . Springer-Verlag , 2001.]] D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In C. Boyd, editor, Advances in Cryptology | ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 514--532. Springer-Verlag, 2001.]]"},{"key":"e_1_3_2_1_8_1","first-page":"236","volume-title":"Proceedings of CRYPTO","author":"Boneh D.","year":"2000","unstructured":"D. Boneh and M. Naor . Timed Commitments (Extended Abstract) . In Proceedings of CRYPTO , pages 236 -- 254 , August 2000 .]] D. Boneh and M. Naor. Timed Commitments (Extended Abstract). In Proceedings of CRYPTO, pages 236--254, August 2000.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 10th USENIX UNIX Security Symposium","author":"Dean D.","year":"2001","unstructured":"D. Dean and A. Stubblefield . Using Client Puzzles to Protect TLS . In Proceedings of the 10th USENIX UNIX Security Symposium , August 2001 .]] D. Dean and A. Stubblefield. Using Client Puzzles to Protect TLS. In Proceedings of the 10th USENIX UNIX Security Symposium, August 2001.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_3_2_1_11_1","first-page":"139","volume-title":"Proceedings of CRYPTO","author":"Dwork C.","year":"1992","unstructured":"C. Dwork and M. Naor . Pricing via Processing, or Combating Junk Mail . In Proceedings of CRYPTO , pages 139 -- 147 , August 1992 .]] C. Dwork and M. Naor. Pricing via Processing, or Combating Junk Mail. In Proceedings of CRYPTO, pages 139--147, August 1992.]]"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-45682-1_21","volume-title":"Advances in Cryptology | ASIACRYPT","author":"Fouque P.","year":"2001","unstructured":"P. Fouque and D. Pointcheval . Thrshold cryptosystems secure against chosen-ciphertext attacks . In C. Boyd, editor, Advances in Cryptology | ASIACRYPT 2001 , volume 2248 of Lecture Notes in Computer Science , pages 351 -- 368 . Springer-Verlag , 2001.]] P. Fouque and D. Pointcheval. Thrshold cryptosystems secure against chosen-ciphertext attacks. In C. Boyd, editor, Advances in Cryptology | ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 351--368. Springer-Verlag, 2001.]]"},{"key":"e_1_3_2_1_13_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/3-540-44750-4_18","volume-title":"Advances in Cryptology | CRYPTO","author":"Frankel Y.","year":"1995","unstructured":"Y. Frankel and M. Yung . Escrow encryption systems visited: attacks, analysis and designs . In D. Coppersmith, editor, Advances in Cryptology | CRYPTO 1995 , volume 963 of Lecture Notes in Computer Science , pages 222 -- 235 . Springer-Verlag , 1995.]] Y. Frankel and M. Yung. Escrow encryption systems visited: attacks, analysis and designs. In D. Coppersmith, editor, Advances in Cryptology | CRYPTO 1995, volume 963 of Lecture Notes in Computer Science, pages 222--235. Springer-Verlag, 1995.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.771254"},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Proc. Algorithmic Number Theory, 5th International Symposium (ANTS-V)","author":"Galbraith S. D.","year":"2002","unstructured":"S. D. Galbraith , K. Harrison , and D. Soldera . Implementing the Tate pairing . In C. Fieker and D. R. Kohel, editors, Proc. Algorithmic Number Theory, 5th International Symposium (ANTS-V) , volume 2369 of Lecture Notes in Computer Science , pages 324 -- 337 . Springer-Verlag , 2002 .]] S. D. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In C. Fieker and D. R. Kohel, editors, Proc. Algorithmic Number Theory, 5th International Symposium (ANTS-V), volume 2369 of Lecture Notes in Computer Science, pages 324--337. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765278.1765291"},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/3-540-36178-2_34","volume-title":"Advances in Cryptology | ASIACRYPT","author":"Gentry C.","year":"2002","unstructured":"C. Gentry and A. Silverberg . Hierarchical ID-based cryptography . In Y. Zheng, editor, Advances in Cryptology | ASIACRYPT 2002 , volume 2501 of Lecture Notes in Computer Science , pages 548 -- 566 . Springer-Verlag , 2002.]] C. Gentry and A. Silverberg. Hierarchical ID-based cryptography. In Y. Zheng, editor, Advances in Cryptology | ASIACRYPT 2002, volume 2501 of Lecture Notes in Computer Science, pages 548--566. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the Security Protocols Workshop","author":"Gligor V. D.","year":"2003","unstructured":"V. D. Gligor . Guaranteeing Access in Spite of Distributed Service-Flooding Attacks . In Proceedings of the Security Protocols Workshop , April 2003 .]] V. D. Gligor. Guaranteeing Access in Spite of Distributed Service-Flooding Attacks. In Proceedings of the Security Protocols Workshop, April 2003.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502013"},{"key":"e_1_3_2_1_22_1","volume-title":"Internet Engineering Task Force","author":"Harkins D.","year":"1998","unstructured":"D. Harkins and D. Carrel . The Internet Key Exchange (IKE). Request for Comments (Proposed Standard) 2409 , Internet Engineering Task Force , Nov. 1998 .]] D. Harkins and D. Carrel. The Internet Key Exchange (IKE). Request for Comments (Proposed Standard) 2409, Internet Engineering Task Force, Nov. 1998.]]"},{"key":"e_1_3_2_1_23_1","first-page":"371","volume-title":"Proceedings of the 19th National Information Systems Security Conference","author":"Heberlein L.","year":"1996","unstructured":"L. Heberlein and M. Bishop . Attack Class: Address Spoofing . In Proceedings of the 19th National Information Systems Security Conference , pages 371 -- 377 , October 1996 .]] L. Heberlein and M. Bishop. Attack Class: Address Spoofing. In Proceedings of the 19th National Information Systems Security Conference, pages 371--377, October 1996.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646278.687349"},{"key":"e_1_3_2_1_25_1","unstructured":"K. Houle G. Weaver N. Long and R. Thomas. Trends in Denial of Service Attack Technology. http:\/\/www.cert.org\/archive\/pdf\/DoS_trends.pdf October 2001.]]  K. Houle G. Weaver N. Long and R. Thomas. Trends in Denial of Service Attack Technology. http:\/\/www.cert.org\/archive\/pdf\/DoS_trends.pdf October 2001.]]"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the IFIP TC6 and TC11 Joint Working Conference on Communications and Multimedia Security","author":"Jakobsson M.","year":"1999","unstructured":"M. Jakobsson and A. Juels . Proofs of Work and Bread Pudding Protocols . In Proceedings of the IFIP TC6 and TC11 Joint Working Conference on Communications and Multimedia Security , September 1999 .]] M. Jakobsson and A. Juels. Proofs of Work and Bread Pudding Protocols. In Proceedings of the IFIP TC6 and TC11 Joint Working Conference on Communications and Multimedia Security, September 1999.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/839292.843033"},{"key":"e_1_3_2_1_28_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Proc. Algorithmic Number Theory, 4th International Symposium (ANTS-IV)","author":"Joux A.","year":"2000","unstructured":"A. Joux . A one-round protocol for tripartite Diffie-Hellman . In W. Bosma, editor, Proc. Algorithmic Number Theory, 4th International Symposium (ANTS-IV) , volume 1838 of Lecture Notes in Computer Science , pages 385 -- 394 . Springer-Verlag , 2000 .]] A. Joux. A one-round protocol for tripartite Diffie-Hellman. In W. Bosma, editor, Proc. Algorithmic Number Theory, 4th International Symposium (ANTS-IV), volume 1838 of Lecture Notes in Computer Science, pages 385--394. Springer-Verlag, 2000.]]"},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/3-540-45455-1_3","volume-title":"Proc. Algorithmic Number Theory, 5th International Symposium (ANTS-V)","author":"Joux A.","year":"2002","unstructured":"A. Joux . The Weil and Tate pairings as building blocks for public key cryptosystems . In C. Fieker and D. R. Kohel, editors, Proc. Algorithmic Number Theory, 5th International Symposium (ANTS-V) , volume 2369 of Lecture Notes in Computer Science , pages 20 -- 32 . Springer-Verlag , 2002 .]] A. Joux. The Weil and Tate pairings as building blocks for public key cryptosystems. In C. Fieker and D. R. Kohel, editors, Proc. Algorithmic Number Theory, 5th International Symposium (ANTS-V), volume 2369 of Lecture Notes in Computer Science, pages 20--32. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_30_1","volume-title":"Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Manuscript. Available from eprint.iacr.org","author":"Joux A.","year":"2001","unstructured":"A. Joux and K. Nguyen . Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Manuscript. Available from eprint.iacr.org , 2001 .]] A. Joux and K. Nguyen. Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Manuscript. Available from eprint.iacr.org, 2001.]]"},{"key":"e_1_3_2_1_31_1","first-page":"151","volume-title":"Proceedings of the ISOC Symposium on Network and Distributed Systems Security (SNDSS)","author":"Juels A.","year":"1999","unstructured":"A. Juels and J. Brainard . Client puzzles: A cryptographic countermeasure against connection depletion attacks . In Proceedings of the ISOC Symposium on Network and Distributed Systems Security (SNDSS) , pages 151 -- 165 , February 1999 .]] A. Juels and J. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of the ISOC Symposium on Network and Distributed Systems Security (SNDSS), pages 151--165, February 1999.]]"},{"key":"e_1_3_2_1_32_1","volume-title":"Internet Engineering Task Force","author":"Karn P.","year":"1999","unstructured":"P. Karn and W. Simpson . Photuris: Session-key management protocol. Request for Comments (Experimental) 2522 , Internet Engineering Task Force , Mar. 1999 .]] P. Karn and W. Simpson. Photuris: Session-key management protocol. Request for Comments (Experimental) 2522, Internet Engineering Task Force, Mar. 1999.]]"},{"key":"e_1_3_2_1_33_1","volume-title":"Network Security","author":"Kaufman C.","year":"2002","unstructured":"C. Kaufman , R. Perlman , and M. Speciner . Network Security , 2 nd Edition. Prentice Hall , 2002 .]] C. Kaufman, R. Perlman, and M. Speciner. Network Security, 2nd Edition. Prentice Hall, 2002.]]","edition":"2"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633032"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/647183.719501"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the USENIX BSD Conference (BSDCon)","author":"Lemmon J.","year":"2001","unstructured":"J. Lemmon . Resisting SYN-flood DoS Attacks with a SYN Cache . In Proceedings of the USENIX BSD Conference (BSDCon) , February 2001 .]] J. Lemmon. Resisting SYN-flood DoS Attacks with a SYN Cache. In Proceedings of the USENIX BSD Conference (BSDCon), February 2001.]]"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100273"},{"key":"e_1_3_2_1_38_1","series-title":"Lecture Notes in Computer Science","first-page":"159","volume-title":"Topics in Cryptology | CT-RSA","author":"Okamoto T.","year":"2002","unstructured":"T. Okamoto and D. Pointcheval . REACT: Rapid enhanced-security asymmetric cryptosystem transform . In B. Preneel, editor, Topics in Cryptology | CT-RSA 2002 , volume 2271 of Lecture Notes in Computer Science , pages 159 -- 175 . Springer-Verlag , 2002.]] T. Okamoto and D. Pointcheval. REACT: Rapid enhanced-security asymmetric cryptosystem transform. In B. Preneel, editor, Topics in Cryptology | CT-RSA 2002, volume 2271 of Lecture Notes in Computer Science, pages 159--175. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/647800.736976"},{"key":"e_1_3_2_1_40_1","unstructured":"B. Pinkas. Personal communication.]]  B. Pinkas. Personal communication.]]"},{"key":"e_1_3_2_1_41_1","series-title":"Lecture Notes in Computer Science","first-page":"433","volume-title":"Advances in Cryptology | CRYPTO","author":"Racko C.","year":"1991","unstructured":"C. Racko and D. R. Simon . Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack . In J. Feigenbaum, editor, Advances in Cryptology | CRYPTO 1991 , volume 576 of Lecture Notes in Computer Science , pages 433 -- 444 . Springer-Verlag , 1991.]] C. Racko and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, editor, Advances in Cryptology | CRYPTO 1991, volume 576 of Lecture Notes in Computer Science, pages 433--444. Springer-Verlag, 1991.]]"},{"issue":"1","key":"e_1_3_2_1_42_1","first-page":"7","volume":"2","author":"Rivest R.","year":"1996","unstructured":"R. Rivest and A. Shamir . PayWord and MicroMint. CryptoBytes , 2 ( 1 ): 7 -- 11 , 1996 .]] R. Rivest and A. Shamir. PayWord and MicroMint. CryptoBytes, 2(1):7--11, 1996.]]","journal-title":"PayWord and MicroMint. CryptoBytes"},{"key":"e_1_3_2_1_44_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/3-540-45708-9_22","volume-title":"Advances in Cryptology | CRYPTO","author":"Rubin K.","year":"2002","unstructured":"K. Rubin and A. Silverberg . Supersingular abelian varieties in cryptography . In M. Yung, editor, Advances in Cryptology | CRYPTO 2002 , volume 2442 of Lecture Notes in Computer Science , pages 336 -- 353 . Springer-Verlag , 2002.]] K. Rubin and A. Silverberg. Supersingular abelian varieties in cryptography. In M. Yung, editor, Advances in Cryptology | CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 336--353. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/882493.884376"},{"key":"e_1_3_2_1_46_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-44987-6_13","volume-title":"Advances in Cryptology | EUROCRYPT","author":"Verheul E. R.","year":"2001","unstructured":"E. R. Verheul . Evidence that XTR is more secure than supersingluar elliptic curve cryptosystems. In B. Pfizmann, editor, Advances in Cryptology | EUROCRYPT 2001 , volume 2045 of Lecture Notes in Computer Science , pages 195 -- 210 . Springer-Verlag , 2001.]] E. R. Verheul. Evidence that XTR is more secure than supersingluar elliptic curve cryptosystems. In B. Pfizmann, editor, Advances in Cryptology | EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 195--210. Springer-Verlag, 2001.]]"},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy","author":"Wang X.","year":"2003","unstructured":"X. Wang and M. K. Reiter . Defending Against Denial-of-Service Attacks with Puzzle Auctions (Extended Abstract) . In Proceedings of the IEEE Symposium on Security and Privacy , May 2003 .]] X. Wang and M. K. Reiter. Defending Against Denial-of-Service Attacks with Puzzle Auctions (Extended Abstract). In Proceedings of the IEEE Symposium on Security and Privacy, May 2003.]]"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2002.1039518"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301320"}],"event":{"name":"CCS04: 11th ACM Conference on Computer and Communications Security 2004","location":"Washington DC USA","acronym":"CCS04","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 11th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1030083.1030128","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1030083.1030128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:25:07Z","timestamp":1750263907000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1030083.1030128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,25]]},"references-count":48,"alternative-id":["10.1145\/1030083.1030128","10.1145\/1030083"],"URL":"https:\/\/doi.org\/10.1145\/1030083.1030128","relation":{},"subject":[],"published":{"date-parts":[[2004,10,25]]},"assertion":[{"value":"2004-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}