{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:51:37Z","timestamp":1794336697438,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540306849","type":"print"},{"value":"9783540322672","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593447_14","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:37:16Z","timestamp":1132018636000},"page":"253-272","source":"Crossref","is-referenced-by-count":4,"title":["Spreading Alerts Quietly and the Subgroup Escape Problem"],"prefix":"10.1007","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zo\u00eb","family":"Diamadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristian","family":"Gj\u00f8steen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren\u00e9","family":"Peralta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aleksandr","family":"Yampolskiy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M. Abe","year":"1999","unstructured":"Abe, M.: Mix-networks on permutation networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 258\u2013273. Springer, Heidelberg (1999)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with applications to the generation of shared safe prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Diamadi, Z., Gj\u00f8steen, K., Peralta, R., Yampolskiy, A.: Spreading alerts quietly and the subgroup escape problem. Technical Report YALEU\/DCS\/TR-1326, Yale University (August. 2005), Available at ftp:\/\/ftp.cs.yale.edu\/pub\/TR\/tr1326.pdf","DOI":"10.1007\/11593447_14"},{"key":"14_CR4","first-page":"1","volume-title":"Second International Conference on FUN with Algorithms","author":"A. Beimel","year":"2001","unstructured":"Beimel, A., Dolev, S.: Buses for anonymous message delivery. In: Second International Conference on FUN with Algorithms, pp. 1\u201313. Carleton Scientific, Ottawa (2001)"},{"key":"14_CR5","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"I.F. Blake","year":"1999","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. London Mathematical Society Lecture Note Series, vol.\u00a0265. Cambridge University Press, Cambridge (1999)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences\u00a037(2), 156\u2013189 (1988)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return address and digital pseudonyms. Communications of the ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Chaum, D., Ryan, P.Y., Schneider, S.A.: A practical, voter-verifiable election scheme. Technical Report CS-TR-880, School of Computing Science, University of Newcastle (December 2004)","DOI":"10.1007\/11555827_8"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/41840.41841","volume-title":"Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing","author":"A. Demers","year":"1987","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Schneider, F.B. (ed.) Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, BC, Canada, August 1987, pp. 1\u201312. ACM, New York (1987)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48285-7_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"N. Demytko","year":"1994","unstructured":"Demytko, N.: A new elliptic curve based analogue of RSA. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 40\u201349. Springer, Heidelberg (1994)"},{"issue":"2","key":"14_CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s00145-001-0015-6","volume":"15","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D.: Elliptic curve Paillier schemes. Journal of Cryptology\u00a015(2), 129\u2013138 (2002)","journal-title":"Journal of Cryptology"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Gj\u00f8steen, K.: Subgroup membership problems and public key cryptosystems. PhD thesis, NTNU (May 2004)","DOI":"10.1007\/978-3-540-30580-4_8"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-30580-4_8","volume-title":"Public Key Cryptography - PKC 2005","author":"K. Gj\u00f8steen","year":"2005","unstructured":"Gj\u00f8steen, K.: Symmetric subgroup membership problems. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 104\u2013119. Springer, Heidelberg (2005)"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1145\/320211.320213","volume":"46","author":"S. Goldwasser","year":"1999","unstructured":"Goldwasser, S., Kilian, J.: Primality testing using elliptic curves. Journal of the Association for Computing Machinery\u00a046, 450\u2013472 (1999)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028, 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-24676-3_27","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P. Golle","year":"2004","unstructured":"Golle, P., Juels, A.: Dining cryptographers revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 456\u2013473. Springer, Heidelberg (2004)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Jakobsson","year":"1998","unstructured":"Jakobsson, M.: A practical Mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 448\u2013461. Springer, Heidelberg (1998)"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/301308.301333","volume-title":"Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing","author":"M. Jakobsson","year":"1999","unstructured":"Jakobsson, M.: Flash mixing. In: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 83\u201389. ACM, New York (1999)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Johnson, R., Molnar, D., Song, D.X., Wagner, D.: Homomorphic signature schemes. In: CT-RSA, pp. 244\u2013262 (2002)","DOI":"10.1007\/3-540-45760-7_17"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-46766-1_20","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"K. Koyama","year":"1992","unstructured":"Koyama, K., Maurer, U.M., Okamoto, T., Vanstone, S.A.: New public-key schemes based on elliptic curves over the ring z n . In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 252\u2013266. Springer, Heidelberg (1992)"},{"key":"14_CR24","unstructured":"Kunihiro, N., Koyama, K.: Equivalence of counting the number of points on elliptic curve over the ring Z n and factoring n. In: Nyberg, (ed.) [30]"},{"issue":"3","key":"14_CR25","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostack, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-58691-1_64","volume-title":"Algorithmic Number Theory","author":"G.-J. Lay","year":"1994","unstructured":"Lay, G.-J., Zimmer, H.G.: Constructing elliptic curves with given group order over large finite fields. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 250\u2013263. Springer, Heidelberg (1994)"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126, 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Nyberg, (ed.) [30], pp. 308\u2013318","DOI":"10.1145\/288090.288106"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-45600-7_38","volume-title":"Information and Communications Security","author":"J.M.G. Nieto","year":"2001","unstructured":"Nieto, J.M.G., Boyd, C., Dawson, E.: A public key cryptosystem based on the subgroup membership problem. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol.\u00a02229, pp. 352\u2013363. Springer, Heidelberg (2001)"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","year":"1998","unstructured":"Nyberg, K. (ed.): EUROCRYPT 1998. LNCS, vol.\u00a01403. Springer, Heidelberg (1998)"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, (ed.) [30], pp. 308\u2013318","DOI":"10.1007\/BFb0054135"},{"key":"14_CR32","first-page":"208","volume-title":"Proceedings of ACM Symposium on Theory of Computing","author":"H. Ong","year":"1984","unstructured":"Ong, H., Schnorr, C.-P., Shamir, A.: An efficient signature scheme based on quadratic equations. In: Proceedings of ACM Symposium on Theory of Computing, pp. 208\u2013216. ACM, New York (1984)"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residue classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"14_CR34","unstructured":"Rabin, M.: Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT\/LCS\/TR-212, Laboratory for Computer Science, Massachusetts Institute of Technology (January 1979)"},{"issue":"2","key":"14_CR35","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"issue":"5","key":"14_CR36","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TIT.1987.1057350","volume":"33","author":"C.P. Schnorr","year":"1987","unstructured":"Schnorr, C.P., Pollard, J.: An efficient solution of the congruence x2 + ky2 $\\equiv m \\pmod{n}$ . IEEE Transactions on Information Theory\u00a033(5), 702\u2013709 (1987)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"issue":"226","key":"14_CR38","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1090\/S0025-5718-99-01068-6","volume":"68","author":"J.H. Silverman","year":"1999","unstructured":"Silverman, J.H.: Computing rational points on rank 1 elliptic curves via L-series and canonical heights. Mathematics of computation\u00a068(226), 835\u2013858 (1999)","journal-title":"Mathematics of computation"},{"issue":"4","key":"14_CR39","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"P.F. Syverson","year":"1998","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and Onion routing. IEEE Journal on Selected Areas in Communications: Special Issue on Copyright and Privacy Protection\u00a016(4), 482\u2013494 (1998)","journal-title":"IEEE Journal on Selected Areas in Communications: Special Issue on Copyright and Privacy Protection"},{"key":"14_CR40","first-page":"34","volume-title":"DISCEX 2000:Proceedings of the DARPA information survivability conference and exposition","author":"P.F. Syverson","year":"2000","unstructured":"Syverson, P.F., Reed, M.G., Goldschlag, D.M.: Onion routing access configurations. In: DISCEX 2000:Proceedings of the DARPA information survivability conference and exposition, pp. 34\u201340. IEEE CS Press, Los Alamitos (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593447_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T10:07:44Z","timestamp":1736071664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593447_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540306849","9783540322672"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/11593447_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11593447","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}