{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:07:27Z","timestamp":1761401247941,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T00:00:00Z","timestamp":1131321600000},"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":[[2005,11,7]]},"DOI":"10.1145\/1102219.1102228","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"53-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved topology assumptions for threshold cryptography in mobile ad hoc networks"],"prefix":"10.1145","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[{"name":"Telcordia Technologies Inc., Piscataway, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renwei","family":"Ge","sequence":"additional","affiliation":[{"name":"University of Delaware, Newark, DE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo R.","family":"Arce","sequence":"additional","affiliation":[{"name":"University of Delaware, Newark, DE"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of Eurocrypt","author":"Beaver D.","year":"1992","unstructured":"D. Beaver and S. Haber , Cryptographic Protocols Provably Secure Against Dynamic Adversaries , in Proc. of Eurocrypt 1992 .]] D. Beaver and S. Haber, Cryptographic Protocols Provably Secure Against Dynamic Adversaries, in Proc. of Eurocrypt 1992.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2003.1233531"},{"volume-title":"Proc. of CRYPTO 97","author":"Boneh D.","key":"e_1_3_2_1_4_1","unstructured":"D. Boneh and M. Franklin , Efficient Generation of Shared RSA Keys , in Proc. of CRYPTO 97 .]] D. Boneh and M. Franklin, Efficient Generation of Shared RSA Keys, in Proc. of CRYPTO 97.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/647097.717005"},{"volume-title":"Proc. of CRYPTO 89","author":"Desmedt Y.","key":"e_1_3_2_1_6_1","unstructured":"Y. Desmedt and Y. Frankel , Threshold Cryptosystems , in Proc. of CRYPTO 89 .]] Y. Desmedt and Y. Frankel, Threshold Cryptosystems, in Proc. of CRYPTO 89.]]"},{"key":"e_1_3_2_1_7_1","volume-title":"European Transaction of Telecommunications","volume":"5","author":"Desmedt Y.","year":"1994","unstructured":"Y. Desmedt , Threshold Cryptography , in European Transaction of Telecommunications , vol. 5 , n, 4, 1994 .]] Y. Desmedt, Threshold Cryptography, in European Transaction of Telecommunications, vol. 5, n, 4, 1994.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103780.1103798"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of STACS","author":"Crescenzo G. Di","year":"2000","unstructured":"G. Di Crescenzo , N. Ferguson , R. Impagliazzo and M. Jakobsson , How to Forget a Secret , in Proc. of STACS 2000 .]] G. Di Crescenzo, N. Ferguson, R. Impagliazzo and M. Jakobsson, How to Forget a Secret, in Proc. of STACS 2000.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of SCN","author":"Crescenzo G. Di","year":"2004","unstructured":"G. Di Crescenzo , R. Ge and G. Arce , Threshold Cryptography over Mobile Ad Hoc Networks , in Proc. of SCN 2004 .]] G. Di Crescenzo, R. Ge and G. Arce, Threshold Cryptography over Mobile Ad Hoc Networks, in Proc. of SCN 2004.]]"},{"volume-title":"Proc. of FOCS 87","author":"Feldman P.","key":"e_1_3_2_1_11_1","unstructured":"P. Feldman , A Practical Scheme for Non-Interactive Verifiable Secret Sharing , in Proc. of FOCS 87 .]] P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing, in Proc. of FOCS 87.]]"},{"volume-title":"Proc. of RSA security conf. 03","author":"Gennaro R.","key":"e_1_3_2_1_12_1","unstructured":"R. Gennaro , S. Jarecki , H. Krawczyk and T. Rabin , Revisiting the Distributed Key Generation for Discrete Log Based Cryptosystems , in Proc. of RSA security conf. 03 .]] R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, Revisiting the Distributed Key Generation for Discrete Log Based Cryptosystems, in Proc. of RSA security conf. 03.]]"},{"volume-title":"Proc. of CRYPTO 95","author":"Herzberg A.","key":"e_1_3_2_1_13_1","unstructured":"A. Herzberg , S. Jarecki , H. Krawczyk , and M. Yung , Proactive Secret Sharing or : How to Cope with Perpetual Leakage , in Proc. of CRYPTO 95 .]] A.Herzberg, S.Jarecki, H.Krawczyk, and M.Yung, Proactive Secret Sharing or: How to Cope with Perpetual Leakage, in Proc. of CRYPTO 95.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/827275.829350"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of NDSS","author":"Montenegro G.","year":"2002","unstructured":"G. Montenegro and C. Castelluccia , Statistically Unique and Cryptographically Verifiable (SUCV) Identifier and Addresses , in Proc. of NDSS 2002 .]] G. Montenegro and C. Castelluccia, Statistically Unique and Cryptographically Verifiable (SUCV) Identifier and Addresses, in Proc. of NDSS 2002.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984660"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/505666.505668"},{"volume-title":"Proc. of Eurocrypt 91","author":"Threshold A","key":"e_1_3_2_1_18_1","unstructured":"A Threshold Cryptosystem without a Trusted Party , in Proc. of Eurocrypt 91 .]] A Threshold Cryptosystem without a Trusted Party, in Proc. of Eurocrypt 91.]]"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of ACNS","author":"Distributed Key Round Optimal","year":"2003","unstructured":"Round Optimal Distributed Key Generation of Threshold Cryptosystem based on Discrete Logarithm Problem , in Proc. of ACNS 2003 .]] Round Optimal Distributed Key Generation of Threshold Cryptosystem based on Discrete Logarithm Problem, in Proc. of ACNS 2003.]]"},{"issue":"6","key":"e_1_3_2_1_20_1","volume":"13","author":"Zhou L.","year":"1999","unstructured":"L. Zhou and Z. J. Haas . Securing Ad Hoc Networks, in IEEE Network Magazine , vol. 13 , no. 6 , 1999 .]] L. Zhou and Z. J. Haas. Securing Ad Hoc Networks, in IEEE Network Magazine, vol. 13, no.6, 1999.]]","journal-title":"Securing Ad Hoc Networks, in IEEE Network Magazine"}],"event":{"name":"CCS05: 12th ACM Conference on Computer and Communications Security 2005","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Alexandria VA USA","acronym":"CCS05"},"container-title":["Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1102219.1102228","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1102219.1102228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:08Z","timestamp":1750262888000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1102219.1102228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,7]]},"references-count":19,"alternative-id":["10.1145\/1102219.1102228","10.1145\/1102219"],"URL":"https:\/\/doi.org\/10.1145\/1102219.1102228","relation":{},"subject":[],"published":{"date-parts":[[2005,11,7]]},"assertion":[{"value":"2005-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}