{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:19Z","timestamp":1747104199379},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pers Ubiquit Comput"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00779-012-0619-x","type":"journal-article","created":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T14:24:13Z","timestamp":1351520653000},"page":"75-90","source":"Crossref","is-referenced-by-count":6,"title":["An efficient privacy-preserving solution for finding the nearest doctor"],"prefix":"10.1007","volume":"18","author":[{"given":"George","family":"Drosatos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlos S.","family":"Efraimidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,30]]},"reference":[{"key":"619_CR1","doi-asserted-by":"crossref","unstructured":"Acquisti A, Gritzalis S, Lambrinoudakis C, De Capitani di Vimercati S (2008) Digital privacy. Auerbach Publications, Taylor & Francis Group, 6000 Broken Sound ParkWay NW","DOI":"10.1201\/9781420052183"},{"key":"619_CR2","doi-asserted-by":"crossref","unstructured":"Bickson D, Dolev D, Bezman G, Pinkas B (2008) Peer-to-peer secure multi-party numerical computation. IEEE international conference on Peer-to-Peer computing, pp 257\u2013266","DOI":"10.1109\/P2P.2008.22"},{"key":"619_CR3","doi-asserted-by":"crossref","unstructured":"Bogetoft P, Christensen DL, Damg\u00e5rd I, Geisler M, Jakobsen T, Kr\u00f8igaard M, Nielsen JD, Nielsen JB, Nielsen K, Pagter J, Schwartzbach M, Toft T (2009) Secure multiparty computation goes live. In: Dingledine R, Golle P (eds) Financial cryptography and data security. Springer, Berlin, pp 325\u2013343","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"619_CR4","unstructured":"Brandt F (2005) Efficient cryptographic protocol design based on distributed el gamal encryption. In: Proceedings of the 8th international conference on information security and cryptology (ICISC 2005), vol 3935. Springer, LNCS, pp 32\u201347"},{"key":"619_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-0-387-27696-0_10","volume-title":"Secure data management in decentralized systems, advances in information security","author":"V Ciriani","year":"2007","unstructured":"Ciriani V, Capitani di Vimercati S, Foresti S, Samarati P (2007) \u03ba-anonymity. In: Yu T, Jajodia S (eds) Secure data management in decentralized systems, advances in information security, vol 33. Springer, Berlin, pp 323\u2013353"},{"key":"619_CR6","doi-asserted-by":"crossref","unstructured":"Clarkson M, Chong S, Myers A (2008) Civitas: Toward a secure voting system. In: IEEE symposium on security and privacy (SP 2008), pp 354\u2013368","DOI":"10.1109\/SP.2008.32"},{"key":"619_CR7","doi-asserted-by":"crossref","unstructured":"Cramer R, Gennaro R, Schoenmakers B (1997) A secure and optimally efficient multi-authority election scheme. In: Proceedings of the 16th annual international conference on theory and application of cryptographic techniques. Springer, Berlin, EUROCRYPT\u201997, pp 103\u2013118","DOI":"10.1007\/3-540-69053-0_9"},{"key":"619_CR8","doi-asserted-by":"crossref","unstructured":"Cramer R, Damg\u00e5rd I, Nielsen JB (2001) Multiparty computation from threshold homomorphic encryption. In: Proceedings of the international conference on the theory and application of cryptographic techniques: advances in cryptology. Springer, London, EUROCRYPT\u201901, pp 280\u2013299","DOI":"10.1007\/3-540-44987-6_18"},{"key":"619_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Nielsen J (2003) Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Advances in cryptology\u2014CRYPTO\u201903 (Lecture notes in computer science), vol 2729. Springer, Berlin, pp 247\u2013264","DOI":"10.1007\/978-3-540-45146-4_15"},{"issue":"6","key":"619_CR10","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory 22(6):644\u2013654","journal-title":"IEEE Trans Inf Theory"},{"key":"619_CR11","doi-asserted-by":"crossref","unstructured":"Dingledine R, Mathewson N, Syverson P (2004) Tor: the second-generation onion router. In: Proceedings of the 13th USENIX security symposium, pp 303\u2013320","DOI":"10.21236\/ADA465464"},{"issue":"4","key":"619_CR12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1108\/09685220910993971","volume":"17","author":"PS Efraimidis","year":"2009","unstructured":"Efraimidis PS, Drosatos G, Nalbadis F, Tasidou A (2009) Towards privacy in personal data management. J Inf Manag Comput Secur 17(4):311\u2013329","journal-title":"J Inf Manag Comput Secur"},{"key":"619_CR13","unstructured":"Europe\u2019s Information Society (2009) eSafety. URL http:\/\/ec.europa.eu\/esafety"},{"key":"619_CR14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2007","unstructured":"Gennaro R, Jarecki S, Krawczyk H, Rabin T (2007) Secure distributed key generation for discrete-log based cryptosystems. J Cryptol 20:51\u201383","journal-title":"J Cryptol"},{"key":"619_CR15","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st annual ACM symposium on theory of computing, ACM, New York, NY, USA, STOC\u201909, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"619_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry C (2010) Computing arbitrary functions of encrypted data. Commun ACM 53:97\u2013105","journal-title":"Commun ACM"},{"key":"619_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"The foundations of cryptography","author":"O Goldreich","year":"2004","unstructured":"Goldreich O (2004) The foundations of cryptography, vol 2. Cambridge University Press, Cambridge"},{"key":"619_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, ACM, New York, NY, USA, STOC\u201987, pp 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"619_CR19","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (extended abstract). In: Odlyzko A (ed) Advances in cryptology\u2014CRYPTO\u201986 (Lecture notes in computer science), vol 263. Springer, Berlin, pp 171\u2013185"},{"key":"619_CR20","volume-title":"Beginning cryptography with Java","author":"D Hook","year":"2005","unstructured":"Hook D (2005) Beginning cryptography with Java. Wiley Publishing Inc., Indianapolis"},{"key":"619_CR21","unstructured":"Karger DR, Ruhl M (2004) Diminished chord: a protocol for heterogeneous subgroup formation in peer-to-peer networks. In: Proceedings of the third international conference on peer-to-peer systems. Springer-Verlag, Berlin, Heidelberg, IPTPS'04, pp 288\u2013297"},{"key":"619_CR22","doi-asserted-by":"crossref","unstructured":"Kissner L, Song D (2005) Privacy-preserving set operations. In: Shoup V (ed) Advances in cryptology\u2014CRYPTO\u201905 (Lecture notes in computer science), vol 3621. Springer, Berlin, pp 241\u2013257","DOI":"10.21236\/ADA457144"},{"key":"619_CR23","first-page":"59","volume":"1","author":"Y Lindell","year":"2009","unstructured":"Lindell Y, Pinkas B (2009) Secure multiparty computation for privacy-preserving data mining. Confidentiality 1:59\u201398","journal-title":"Confidentiality"},{"key":"619_CR24","volume-title":"Handbook of applied cryptography","author":"AJ Menezes","year":"1997","unstructured":"Menezes AJ, van Oorschot PC, Vanstone SA (1997) Handbook of applied cryptography. CRC Press, Inc., Boca Raton"},{"key":"619_CR25","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residue classes. In: Stern J (ed) Advances in cryptology\u2014EUROCRYPT 1999, vol 1592. Springer, Berlin, Heidelberg, LNCS, pp 223\u2013238"},{"key":"619_CR26","doi-asserted-by":"crossref","unstructured":"Peng K, Boyd C, Dawson E, Lee B (2005) Ciphertext comparison, a new solution to the millionaire problem. In: Proceedings of the 7th international conference on information and communications security (ICICS 2005), vol 3783. Springer, LNCS, pp 84\u201396","DOI":"10.1007\/11602897_8"},{"key":"619_CR27","doi-asserted-by":"crossref","unstructured":"Priyantha NB, Chakraborty A, Balakrishnan H (2000) The Cricket location-support system. In: MobiCom \u201900: Proceedings of the 6th annual international conference on mobile computing and networking, ACM, New York, NY, USA, pp 32\u201343","DOI":"10.1145\/345910.345917"},{"key":"619_CR28","unstructured":"Quisquater JJ, Guillou L, Annick M, Berson T (1989) How to explain zero-knowledge protocols to your children. In: Proceedings on advances in cryptology, Springer New York, Inc., New York, NY, USA, CRYPTO\u201989, pp 628\u2013631"},{"key":"619_CR29","doi-asserted-by":"crossref","unstructured":"Reed M, Syverson P, Goldschlag D (1998) Anonymous connections and onion routing. IEEE J Sel Areas Commun 16(4):482\u2013494","DOI":"10.1109\/49.668972"},{"key":"619_CR30","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"MK Reiter","year":"1998","unstructured":"Reiter MK, Rubin AD (1998) Crowds: anonymity for web transactions. ACM Trans Inf Syst Secur 1:66\u201392","journal-title":"ACM Trans Inf Syst Secur"},{"key":"619_CR31","unstructured":"Rivest R, Adleman L, Dertouzos M (1978) On data banks and privacy homomorphisms. In: DeMillo R, Dobkin D, Jones A, Lipton R (eds) Foundations of secure computation. Academic Press, New York, pp 169\u2013177"},{"key":"619_CR32","unstructured":"Stamatelatos G, Drosatos G, Efraimidis PS (2009) Quantum: A peer-to-peer network for distributed computations with enhanced privacy. In: EYRHKA 2009 conference proceedings, 3rd Panhellenic scientific student conference on informatics, pp 201\u2013210, written in Modern Greek"},{"key":"619_CR33","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM\u201901, San Diego, CA, pp 149\u2013160","DOI":"10.1145\/383059.383071"},{"key":"619_CR34","unstructured":"To Vima Online (2007) Missing doctor incident. URL http:\/\/www.tovima.gr\/relatedarticles\/article\/?aid=209954"},{"key":"619_CR35","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/128756.128759","volume":"10","author":"R Want","year":"1992","unstructured":"Want R, Hopper A, Falc\u00e3o V, Gibbons J (1992) The active badge location system. ACM Trans Inf Syst (TOIS) 10:91\u2013102","journal-title":"ACM Trans Inf Syst (TOIS)"},{"issue":"5","key":"619_CR36","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/98.626982","volume":"4","author":"A Ward","year":"1997","unstructured":"Ward A, Jones A, Hopper A (1997) A new location technique for the active office. IEEE Pers Commun 4(5):42\u201347","journal-title":"IEEE Pers Commun"},{"key":"619_CR37","unstructured":"Yao ACC (1982) Protocols for secure computations (extended abstract). In: Proceedings of twenty-third IEEE symposium on foundations of computer science, Chicago, Illinois, pp 160\u2013164"},{"key":"619_CR38","doi-asserted-by":"crossref","unstructured":"Yokoo M, Suzuki K (2002) Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions. In: Proceedings of the first international joint conference on Autonomous agents and multi-agent systems: part 1, ACM, New York, NY, USA, AAMAS\u201902, pp 112\u2013119","DOI":"10.1145\/544741.544770"}],"container-title":["Personal and Ubiquitous Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-012-0619-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00779-012-0619-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-012-0619-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T21:06:18Z","timestamp":1714511178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00779-012-0619-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,30]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["619"],"URL":"https:\/\/doi.org\/10.1007\/s00779-012-0619-x","relation":{},"ISSN":["1617-4909","1617-4917"],"issn-type":[{"value":"1617-4909","type":"print"},{"value":"1617-4917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,30]]}}}