{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:26Z","timestamp":1740099026274,"version":"3.37.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319769523"},{"type":"electronic","value":"9783319769530"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-76953-0_10","type":"book-chapter","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T03:13:36Z","timestamp":1520306016000},"page":"179-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Asynchronous Provably-Secure Hidden Services"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6026-9069","authenticated-orcid":false,"given":"Philippe","family":"Camacho","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4968-5106","authenticated-orcid":false,"given":"Fernando","family":"Krell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,7]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"issue":"1","key":"10_CR2","doi-asserted-by":"crossref","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. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-76462-2_32","volume-title":"Kommunikation in Verteilten Systemen","author":"A Pfitzmann","year":"1991","unstructured":"Pfitzmann, A., Pfitzmann, B., Waidner, M.: ISDN-mixes: untraceable communication with very small bandwidth overhead. In: Effelsberg, W., Meuer, H.W., M\u00fcller, G. (eds.) Kommunikation in Verteilten Systemen, pp. 451\u2013463. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/978-3-642-76462-2_32"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Rackoff, C., Simon, D.R.: Cryptographic defense against traffic analysis. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 672\u2013681. ACM (1993)","DOI":"10.1145\/167088.167260"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. Technical report, Naval Research Lab, Washington DC (2004)","DOI":"10.21236\/ADA465464"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Murdoch, S.J., Danezis, G.: Low-cost traffic analysis of Tor. In: 2005 IEEE Symposium on Security and Privacy, pp. 183\u2013195. IEEE (2005)","DOI":"10.1109\/SP.2005.12"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-27809-2_25","volume-title":"Financial Cryptography","author":"BN Levine","year":"2004","unstructured":"Levine, B.N., Reiter, M.K., Wang, C., Wright, M.: Timing attacks in low-latency mix systems. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 251\u2013265. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27809-2_25"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-39650-5_7","volume-title":"Computer Security\u2013ESORICS 2003","author":"A Serjantov","year":"2003","unstructured":"Serjantov, A., Sewell, P.: Passive attack analysis for connection-based anonymity systems. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol. 2808, pp. 116\u2013131. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39650-5_7"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11423409_13","volume-title":"Privacy Enhancing Technologies","author":"Y Zhu","year":"2005","unstructured":"Zhu, Y., Fu, X., Graham, B., Bettati, R., Zhao, W.: On flow correlation attacks and countermeasures in mix networks. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 207\u2013225. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11423409_13"},{"issue":"2","key":"10_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/354876.354877","volume":"3","author":"S Dolev","year":"2000","unstructured":"Dolev, S., Ostrovsky, R.: Xor-trees for efficient anonymous multicast and reception. ACM Trans. Inf. Syst. Secur. 3(2), 63\u201384 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"MK Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: anonymity for web transactions. ACM Trans. Inf. Syst. Secur. (TISSEC) 1(1), 66\u201392 (1998)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"10_CR12","unstructured":"Wright, M.K., Adler, M., Levine, B.N., Shields, C.: An analysis of the degradation of anonymous protocols. In: NDSS, vol. 2, pp. 39\u201350 (2002)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Shmatikov, V.: Probabilistic analysis of anonymity. In: 2002 15th IEEE Proceedings of the Computer Security Foundations Workshop, pp. 119\u2013128. IEEE (2002)","DOI":"10.1109\/CSFW.2002.1021811"},{"issue":"3","key":"10_CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.3233\/JCS-2002-10302","volume":"10","author":"BN Levine","year":"2002","unstructured":"Levine, B.N., Shields, C.: Hordes: a multicast based protocol for anonymity1. J. Comput. Secur. 10(3), 213\u2013240 (2002)","journal-title":"J. Comput. Secur."},{"issue":"2","key":"10_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"D Goldschlag","year":"1999","unstructured":"Goldschlag, D., Reed, M., Syverson, P.: Onion routing. Commun. ACM 42(2), 39\u201341 (1999)","journal-title":"Commun. ACM"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Overlier, L., Syverson, P.: Locating hidden servers. In: 2006 IEEE Symposium on Security and Privacy, p. 15. IEEE (2006)","DOI":"10.1109\/SP.2006.24"},{"key":"10_CR17","unstructured":"Katti, S., Katabi, D., Puchala, K.: Slicing the onion: anonymous routing without PKI (2005)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-46885-4_32","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1989","author":"M Waidner","year":"1990","unstructured":"Waidner, M.: Unconditional sender and recipient untraceability in spite of active attacks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 302\u2013319. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_32"},{"key":"10_CR19","unstructured":"Akavia, A., LaVigne, R., Moran, T.: Topology-hiding computation on all graphs. Cryptology ePrint Archive, Report 2017\/296 (2017). http:\/\/eprint.iacr.org\/2017\/296"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-662-46494-6_8","volume-title":"Theory of Cryptography","author":"T Moran","year":"2015","unstructured":"Moran, T., Orlov, I., Richelson, S.: Topology-hiding computation. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 159\u2013181. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_8"},{"key":"10_CR21","unstructured":"Hirt, M., Maurer, U., Tschudi, D., Zikas, V.: Network-hiding communication and applications to multi-party protocols. Cryptology ePrint Archive, Report 2016\/556 (2016). http:\/\/eprint.iacr.org\/2016\/556"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-319-56617-7_21","volume-title":"Advances in Cryptology\u2013EUROCRYPT 2017","author":"A Akavia","year":"2017","unstructured":"Akavia, A., Moran, T.: Topology-hiding computation beyond logarithmic diameter. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 609\u2013637. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_21"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting: security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 259\u2013274. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_18"},{"key":"10_CR24","unstructured":"Camacho, P., Krell, F.: Asynchronous provably-secure hidden services (2017). http:\/\/eprint.iacr.org\/2017\/888"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Singh, A., et al.: Eclipse attacks on overlay networks: threats and defenses. In: IEEE INFOCOM. Citeseer (2006)","DOI":"10.1109\/INFOCOM.2006.231"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols, p. 136, October 2001","DOI":"10.1109\/SFCS.2001.959888"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-76953-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T03:37:57Z","timestamp":1570851477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-76953-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319769523","9783319769530"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-76953-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}