乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:12:53Z","timestamp":1726413173157},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T00:00:00Z","timestamp":1365552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10115-013-0632-z","type":"journal-article","created":{"date-parts":[[2013,4,9]],"date-time":"2013-04-09T06:06:40Z","timestamp":1365487600000},"page":"49-77","source":"Crossref","is-referenced-by-count":5,"title":["A lightweight privacy preserving SMS-based recommendation system for mobile users"],"prefix":"10.1007","volume":"40","author":[{"given":"L.","family":"Becchetti","sequence":"first","affiliation":[]},{"given":"L.","family":"Bergamini","sequence":"additional","affiliation":[]},{"given":"U. M.","family":"Colesanti","sequence":"additional","affiliation":[]},{"given":"L.","family":"Filipponi","sequence":"additional","affiliation":[]},{"given":"Ginseppe","family":"Persiano","sequence":"additional","affiliation":[]},{"given":"A.","family":"Vitaletti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,10]]},"reference":[{"issue":"3","key":"632_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"key":"632_CR2","doi-asserted-by":"crossref","unstructured":"Aiello W, Chung F, Lu L (2000) A random graph model for massive graphs. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing. ACM, pp 171\u2013180","DOI":"10.1145\/335305.335326"},{"key":"632_CR3","doi-asserted-by":"crossref","unstructured":"Aiello W, Chung F, Lu L (2001) Random evolution in massive graphs. In: Werner B (ed) Proceedings of the 42nd IEEE symposium on foundations of computer science, pp 510\u2013521","DOI":"10.1109\/SFCS.2001.959927"},{"key":"632_CR4","doi-asserted-by":"crossref","unstructured":"Baglioni E, Becchetti L, Bergamini L, Colesanti U, Filipponi L, Vitaletti A, Persiano G (2010) A lightweight privacy preserving sms-based recommendation system for mobile users. In: Proceedings of the fourth ACM conference on recommender systems, RecSys \u201910. ACM, New York, NY, USA, pp 191\u2013198","DOI":"10.1145\/1864708.1864745"},{"key":"632_CR5","doi-asserted-by":"crossref","unstructured":"Barni M, Bianchi T, Catalano D, Di Raimondo M, Donida Labati R, Failla P, Fiore D, Lazzeretti R, Piuri V, Scotti F, Piva A (2010) Privacy-preserving fingercode authentication. In: Proceedings of the 12th ACM workshop on multimedia and security, MM &Sec \u201910. ACM, New York, NY, USA, pp 231\u2013240","DOI":"10.1145\/1854229.1854270"},{"key":"632_CR6","doi-asserted-by":"crossref","unstructured":"Bellare M, Namprempre C, Pointcheval D, Semanko M (2003) The one-more-rsa-inversion problems and the security of chaum\u2019s blind signature scheme. J Cryptol 16(3):185\u2013215","DOI":"10.1007\/s00145-002-0120-1"},{"key":"632_CR7","doi-asserted-by":"crossref","unstructured":"Blanton M, Gasti P (2011) Secure and efficient protocols for iris and fingerprint identification. In: Proceedings of the 16th European conference on research in computer security, ESORICS\u201911. Springer, Berlin, pp 190\u2013209","DOI":"10.1007\/978-3-642-23822-2_11"},{"key":"632_CR8","unstructured":"Blundo C, Cristofaro ED, Gasti P (2011) Espresso: efficient privacy-preserving evaluation of sample set similarity. CoRR, abs\/1111.5062"},{"key":"632_CR9","doi-asserted-by":"crossref","unstructured":"Bohman T, Cooper C, Frieze AM (2000) Min-wise independent linear permutations. Electr J Comb 7:R26. Accessed at: http:\/\/www.emis.ams.org\/journals\/EJC\/volume-7\/PDF\/v7ilr26.pdf","DOI":"10.37236\/1504"},{"key":"632_CR10","doi-asserted-by":"crossref","unstructured":"Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (1998) Min-wise independent permutations. In: ACM symposium on the theory of computing, New York, NY, USA","DOI":"10.1145\/276698.276781"},{"key":"632_CR11","doi-asserted-by":"crossref","unstructured":"Broder AZ, Glassman SC, Manasse MS, Zweig G (1997) Syntactic clustering of the web. In: Proceedings of the world wide web Conference","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"632_CR12","doi-asserted-by":"crossref","unstructured":"Buhler J, Lenstra HW, Pomerance C (1993) Factoring integers with the number field sieve. In: Lenstra A, Lenstra J, Hendrik W (eds) The development of the number field sieve. Lecture Notes in Mathematics, vol 1554. Springer, Berlin, pp 50\u201394","DOI":"10.1007\/BFb0091539"},{"key":"632_CR13","doi-asserted-by":"crossref","unstructured":"A. Campagna and R. Pagh. Finding associations and computing similarity via biased pair sampling. Knowl Inf Syst 1\u201322. doi: 10.1007\/s10115-011-0428-y","DOI":"10.1007\/s10115-011-0428-y"},{"key":"632_CR14","unstructured":"Consulting G (2008) Gartner says mobile messages to surpass 2 trillion messages in major markets in 2008"},{"key":"632_CR15","first-page":"141","volume":"2011","author":"ED Cristofaro","year":"2011","unstructured":"Cristofaro ED, Gasti P, Tsudik G (2011) Fast and private computation of set intersection cardinality. IACR Cryptol ePrint Arch 2011:141","journal-title":"IACR Cryptol ePrint Arch"},{"issue":"11","key":"632_CR16","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.1109\/TKDE.2008.227","volume":"21","author":"P Cunningham","year":"2009","unstructured":"Cunningham P (2009) A taxonomy of similarity mechanisms for case-based reasoning. IEEE Trans Knowl Data Eng 21(11):1532\u20131543","journal-title":"IEEE Trans Knowl Data Eng"},{"volume-title":"Grooming, gossip, and the evolution of language","year":"1998","author":"R Dunbar","key":"632_CR17","unstructured":"Dunbar R (1998) Grooming, gossip, and the evolution of language. Harvard University Press, Cambridge"},{"issue":"4","key":"632_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N Eagle","year":"2006","unstructured":"Eagle N, Pentland A (2006) Reality mining: sensing complex social systems. Pers Ubiquitous Comput 10(4):255\u2013268","journal-title":"Pers Ubiquitous Comput"},{"key":"632_CR19","unstructured":"eMarketer forecasts online. http:\/\/technokitten.blogspot.com\/2008\/05\/big-growth-predicted-for-mobile-soc"},{"key":"632_CR20","doi-asserted-by":"crossref","unstructured":"Erkin Z, Piva A, Katzenbeisser S, Lagendijk RL, Shokrollahi J, Neven G, Barni M (2007) Protection and retrieval of encrypted multimedia content: when cryptography meets signal processing. EURASIP J Inf Secur 2007. doi: 10.1155\/2007\/78943","DOI":"10.1155\/2007\/78943"},{"issue":"9","key":"632_CR21","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1109\/JSAC.2011.111011","volume":"29","author":"M Gjoka","year":"2001","unstructured":"Gjoka M, Kurant M, Butts CT, Markopoulou A (2001) Practical recommendations on crawling online social networks. IEEE J Sel Areas Commun 29(9):1872\u20131892","journal-title":"IEEE J Sel Areas Commun"},{"key":"632_CR22","unstructured":"Indyk P (1999) A small approximately min-wise independent family of hash functions. In: SODA"},{"key":"632_CR23","unstructured":"Jyngle web site. http:\/\/www.jyngle.com\/ , 2008"},{"key":"632_CR24","doi-asserted-by":"crossref","unstructured":"Leroy V, Cambazoglu BB, Bonchi F (2010) Cold start link prediction. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201910. ACM, New York, NY, USA, pp 393\u2013402","DOI":"10.1145\/1835804.1835855"},{"issue":"7","key":"632_CR25","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"key":"632_CR26","doi-asserted-by":"crossref","unstructured":"Liben-Nowell D, Kleinberg J (2003) The link prediction problem for social networks. In: Proceedings of the twelfth international conference on information and knowledge management, CIKM \u201903. ACM, New York, NY, USA, pp 556\u2013559","DOI":"10.1145\/956863.956972"},{"key":"632_CR27","doi-asserted-by":"crossref","unstructured":"Lin Z, Lyu M, King I. Matchsim: a novel similarity measure based on maximum neighborhood matching. Knowl Inf Syst 1\u201326. doi: 10.1007\/s10115-011-0427-z","DOI":"10.1007\/s10115-011-0427-z"},{"key":"632_CR28","unstructured":"Market intelligence on messaging and marketing. http:\/\/www.lloydsmiu.com\/pdf\/Jun-2005\/16\/mma_sample_issue_june.pdf , 2009"},{"issue":"3","key":"632_CR29","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/1010614.1010618","volume":"22","author":"BN Miller","year":"2004","unstructured":"Miller BN, Konstan JA, Riedl J (2004) Pocketlens: toward a personal recommender system. ACM Trans Inf Syst 22(3):437\u2013476","journal-title":"ACM Trans Inf Syst"},{"key":"632_CR30","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s00778-009-0175-9","volume":"19","author":"M Murugesan","year":"2010","unstructured":"Murugesan M, Jiang W, Clifton C, Si L, Vaidya J (2010) Efficient privacy-preserving similar document detection. VLDB J 19:457\u2013475","journal-title":"VLDB J"},{"issue":"2","key":"632_CR31","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"key":"632_CR32","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Stern J (ed) Advances in cryptology EUROCRYPT 99. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"632_CR33","unstructured":"Peekamo web site: http:\/\/peekamo.com\/ , 2008"},{"key":"632_CR34","unstructured":"Reality mining project. http:\/\/reality.media.mit.edu\/"},{"key":"632_CR35","unstructured":"Sadeghi A-R, Schneider T, Wehrenberg I (2010) Efficient privacy-preserving face recognition. In: Proceedings of the 12th international conference on information security and cryptology, ICISC\u201909. Springer, Berlin, pp 229\u2013244"},{"key":"632_CR36","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TNET.2008.2001730","volume":"17","author":"D Stutzbach","year":"2009","unstructured":"Stutzbach D, Rejaie R, Duffield N, Sen S, Willinger W (2009) On unbiased sampling for unstructured peer-to-peer networks. IEEE\/ACM Trans Netw 17:377\u2013390","journal-title":"IEEE\/ACM Trans Netw"},{"key":"632_CR37","doi-asserted-by":"crossref","unstructured":"Stutzbach D, Rejaie R, Duffield N, Sen S, Willinger W (2006) Sampling techniques for large, dynamic graphs. In: INFOCOM 2006. 25th IEEE international conference on computer communications. Proceedings, pp 1\u20136, April 2006","DOI":"10.1109\/INFOCOM.2006.39"},{"issue":"3","key":"632_CR38","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/1096737.1096740","volume":"12","author":"L Terveen","year":"2005","unstructured":"Terveen L, McDonald DW (2005) Social matching: a framework and research agenda. ACM Trans Comput Hum Interact 12(3):401\u2013434","journal-title":"ACM Trans Comput Hum Interact"},{"key":"632_CR39","unstructured":"W3c workshop on the future of social networking. http:\/\/planb.nicecupoftea.org\/2009\/01\/14\/w3c-workshop-on-the-future-of-socia"},{"key":"632_CR40","doi-asserted-by":"crossref","unstructured":"Zerfos P, Meng X, Wong SH, Samanta V, Lu S (2006) A study of short message service of a nationwide cellular network. In: IMC \u201906: proceedings of the 6th ACM SIGCOMM conference on internet measurement. ACM NY, USA, pp 263\u2013268","DOI":"10.1145\/1177080.1177114"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0632-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0632-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0632-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T02:46:12Z","timestamp":1595645172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0632-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,10]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["632"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0632-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2013,4,10]]}}}