{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:06:49Z","timestamp":1737522409261,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75551-7_6","type":"book-chapter","created":{"date-parts":[[2007,9,28]],"date-time":"2007-09-28T10:52:49Z","timestamp":1190976769000},"page":"77-94","source":"Crossref","is-referenced-by-count":16,"title":["Efficient Oblivious Augmented Maps: Location-Based Services with a Payment Broker"],"prefix":"10.1007","author":[{"given":"Markulf","family":"Kohlweiss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Faust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lothar","family":"Fritsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartek","family":"Gedrojc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Preneel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/266420.266426","volume-title":"CCS 1997","author":"N. Asokan","year":"1997","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: CCS 1997. Proceedings of the 4th ACM conference on Computer and communications security, pp. 7\u201317. ACM Press, New York, NY, USA (1997)"},{"key":"6_CR2","first-page":"86","volume":"00","author":"N. Asokan","year":"1998","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. sp\u00a000, 0086 (1998)","journal-title":"sp"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bangerter, E., Camenisch, J., Maurer, U.M.: Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order. In: Hutter and Ullmann [17], pp. 154\u2013171","DOI":"10.1007\/978-3-540-30580-4_11"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/MPRV.2003.1186725","volume":"2","author":"A.R. Beresford","year":"2003","unstructured":"Beresford, A.R., Stajano, F.: Location Privacy in Pervasive Computing. IEEE Pervasive Computing\u00a02(1), 46\u201355 (2003)","journal-title":"IEEE Pervasive Computing"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-69053-0_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"S. Brands","year":"1997","unstructured":"Brands, S.: Rapid demonstration of linear relations connected by boolean operators. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 318\u2013333. Springer, Heidelberg (1997)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Neven, G., Shelat, A.: Adaptive oblivious transfer from blind signatures (unpublished manuscript through personal communication) (2006)","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"6_CR7","unstructured":"Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical Report TR 260, Institute for Theoretical Computer Science, ETH Z\u00fcrich (March 1997)"},{"issue":"2","key":"6_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 addresses, and digital pseudonyms. Communications of the ACM\u00a024(2), 84\u201390 (1981)","journal-title":"Communications of the ACM"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: CRYPTO, pp. 199\u2013203 (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-30580-4_12","volume-title":"Public Key Cryptography - PKC 2005","author":"C.-K. Chu","year":"2005","unstructured":"Chu, C.-K., Tzeng, W.-G.: Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 172\u2013183. Springer, Heidelberg (2005)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"6_CR12","unstructured":"Federrath, H., Jerichow, A., Kesdogan, D., Pfitzmann, A.: Security in Public Mobile Communication Networks. In: IFIP TC 6 International Workshop on Personal Wireless Communications, pp. 105\u2013116 (1995)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"6_CR14","unstructured":"Fritsch, L.: Profiling and location based services. In: Hildebrandt, M., Gutwirth, S. (eds.) FIDIS D7.5: Profiling the European Citizen, Cross- disciplinary perspectives (2007)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Gruteser, M., Grunwald, D.: Anonymous usage of location-based services through spatial and temporal cloaking. In: MobiSys\u201903. Proceedings of First International Conference on Mobile Systems, Applications, and Services, pp. 31\u201342 (2003)","DOI":"10.1145\/1066116.1189037"},{"key":"6_CR16","unstructured":"GSM Association: Location Based Services. Permanent reference document. Technical report, SE.23 (2003)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Security in Pervasive Computing","year":"2005","unstructured":"Hutter, D., Ullmann, M. (eds.): SPC 2005. LNCS, vol.\u00a03450. Springer, Heidelberg (2005)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"K\u00f6lsch, T., Fritsch, L., Kohlweiss, M., Kesdogan, D.: Privacy for profitable location based services. In: Hutter and Ullmann [17], pp. 164\u2013178","DOI":"10.1007\/978-3-540-32004-3_18"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 573\u2013590. Springer, Heidelberg (1999)"},{"issue":"2-3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.jco.2003.08.023","volume":"20","author":"W. Ogata","year":"2004","unstructured":"Ogata, W., Kurosawa, K.: Oblivious keyword search. Journal of Complexity\u00a020(2-3), 356\u2013371 (2004)","journal-title":"Journal of Complexity"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/11535218_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R. Ostrovsky","year":"2005","unstructured":"Ostrovsky, R., Skeith I I I, W.: Private searching on streaming data. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 223\u2013240. Springer, Heidelberg (2005)"},{"key":"6_CR22","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 cryptosystem based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013228. Springer, Heidelberg (1999)"},{"key":"6_CR23","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation for smart cards. Journal of Cryptology\u00a04(3), 239\u2013252 (1991)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75551-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T08:21:23Z","timestamp":1737447683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75551-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755500"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75551-7_6","relation":{},"subject":[]}}