Privacy-preserving interest-casting in opportunistic networks

IEEE Wireless Communications and Networking Conference, WCNC

Volumn , Issue , 2012, Pages 2829-2834

  Costantino, Gianpiero ^a   Martinelli, Fabio ^a   Santi, Paolo ^a  

^a CNR   (Italy)

Author keywords

Secure Multiparty Computation; Security Attacks; The Millionaire's Problem; Wireless Networks

Indexed keywords

MESSAGE DELIVERY; MESSAGE FORWARDING; OPPORTUNISTIC NETWORKS; PRIVACY PRESERVING; PRIVATE INFORMATION; SECURE MULTI-PARTY COMPUTATION; SECURITY ATTACKS; SENSITIVE INFORMATIONS; SIMILAR INTERESTS; THE MILLIONAIRE'S PROBLEM;

WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS NETWORKS;

EID: 84864353961     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2012.6214283     Document Type: Conference Paper

References (14)

1. A. Mei, G. Morabito, P. Santi, and J. Stefa, "Social-aware stateless forwarding in pocket switched networks," in IEEE Infocom, 2011.
2. X. X. Ting Ning, Zhipeng Yang and H. Wu, "Incentive-aware data dissemination in delay-tolerant mobile networks," 2011.
3. L. Buttyán, L. Dóra, M. Félegyházi, and I. Vajda, "Barter trade improves message delivery in opportunistic networks," Ad Hoc Networks, vol. 8, no. 1, pp. 1-14, 2010.
4. N. Li and S. K. Das, "A trust-based framework for data forwarding in opportunistic networks," Ad Hoc Networks, vol. In Press, 2011.
5. S. Trifunovic, F. Legendre, and C. Anastasiades, "Social trust in opportunistic networks," in INFOCOM IEEE CCCW. IEEE, Mar. 2010, pp. 1-6.
6. M. R. P. Gonçalves, E. D. S. Moreira, and L. A. F. Martimiano, "Trust and privacy: Informal ways to assess risk on opportunistic exchanges," Inter. Journal of Computer Science Applications, vol. 6, pp. 66-85, 2009.
7. R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval. New York: ACM Press - Addison-Wesley, 1999.
8. S. Marsh, "Formalising trust as a computational concept," PhD thesis, University of Stirling, UK, 1994.
9. A. Jøsang, R. Ismail, and C. Boyd, "A survey of trust and reputation systems for online service provision," Decision Support Systems, vol. 43, no. 2, pp. 618-644, March 2007.
10. C. Andrew and C. Yao, "Protocols for secure computations," in 23rd IEEE Symposium on FOCS, 1982, pp. 160-164.
11. O. Goldreich, Foundations of Cryptography. Cambridge University Press, 2001, vol. Basic Tools.
12. M. J. Freedman, K. Nissim, and B. Pinkas, "Efficient Private Matching and Set Intersection," in EUROCRYPT, ser. LNCS, vol. 3027, 2004, pp. 1-19.
13. S. Li, D. Wang, and Y. Dai, "Symmetric cryptographic protocols for extended millionaires' problem," Information Sciences, vol. 52, no. 6, pp. 974-982, 2009.
14. I. Ioannidis and A. Grama, "An efficient protocol for Yao's millionaires' problem," System Sciences, 2003. Proc. of the 36th Annual Hawaii Int. Conf., p. 6, 2003.