D-Card: A distributed mobile phone based system for relaying verified friendships

Cyber-physical networking systems (CPNSs) closely bridge cyberspace and the physical world. Cyberspace includes not only the Internet, but also telephone networks and short-range communications. CPNSs arise in many application domains, including social networking. Social CPNSs connect people embodied in the physical world with cyber social networking services to facilitate social interactions, including friendship formation. These services can be characterized by their dependence on Internet connections to operate. An important class of social CPNSs are mobile phone based ones. However, there is a lack of friendship verification in mobile phone based social CPNSs that allow miscreants to masquerade as friends. In this paper, we present D-Card, a mobile phone based social CPNS that provides friendship verification. D-Card provides an electronic name card that encodes relationship information for a person with his contact information. The name card includes a public key and digital signature. Comparing this public key with one from a trusted source enables identity verification. D-Card leverages a Bluetooth SDP toolkit to exchange information without requiring connection establishment. D-Card is a purely distributed CPNS that requires no Internet access or infrastructure. We implement the D-Card CPNS in Java ME and Bluetooth. Our experiments with real-world mobile phones illustrate its potential for friendship verification in mobile phone based social CPNSs. To the best of our knowledge, D-Card is the first such CPNS designed for this purpose.

[1]  Richard Sharp,et al.  Using visual tags to bypass Bluetooth device discovery , 2005, MOCO.

[2]  Lars Erik Holmquist,et al.  Supporting group collaboration with interpersonal awareness devices , 1999, Personal Technologies.

[3]  Jesper Kjeldskov,et al.  Just-for-us: a context-aware mobile information system facilitating sociality , 2005, Mobile HCI.

[4]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[5]  Dong Xuan,et al.  E-SmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[6]  Michael Mitzenmacher,et al.  Less Hashing, Same Performance: Building a Better Bloom Filter , 2006, ESA.

[7]  William G. Griswold,et al.  Peopletones: a system for the detection and notification of buddy proximity on mobile phones , 2008, MobiSys '08.

[8]  H BloomBurton Space/time trade-offs in hash coding with allowable errors , 1970 .

[9]  Mika Raento,et al.  ContextContacts: re-designing SmartPhone's contact book to support mobile awareness and collaboration , 2005, Mobile HCI.

[10]  Songwu Lu,et al.  Point&Connect: intention-based device pairing for mobile phone users , 2009, MobiSys '09.

[11]  Charles D. Knutson,et al.  Rapid heterogeneous ad hoc connection establishment: accelerating Bluetooth inquiry using IrDA , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[12]  Taly Sharon,et al.  Usage patterns of FriendZone: mobile location-based community services , 2004, MUM '04.