Size-estimation framework with applications to transitive closure and reachability
Journal of Computer and System Sciences
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ANF: a fast and scalable tool for data mining in massive graphs
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
Fast Random Walk with Restart and Its Applications
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Spatially-decaying aggregation over a network
Journal of Computer and System Sciences
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Summarizing data using bottom-k sketches
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
HyperANF: approximating the neighbourhood function of very large graphs on a budget
Proceedings of the 20th international conference on World wide web
A comparison of three algorithms for approximating the distance distribution in real-world graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Robustness of social networks: comparative results based on distance distributions
SocInfo'11 Proceedings of the Third international conference on Social informatics
Sparse reliable graph backbones
Information and Computation
How user behavior is related to social affinity
Proceedings of the fifth ACM international conference on Web search and data mining
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
Little research explores the activity of sharing mobile numbers on OSNs, in particular via public posts. In this work, we understand the characteristics and risks of mobile numbers shared on OSNs either via profile or public posts and focus on Indian mobile numbers. We collected 76,347 unique mobile numbers posted by 85,905 users on Twitter and Facebook and analyzed 2,997 numbers, prefixed with +91. We observed that most users shared their own mobile numbers to spread urgent information and to market products, IT facilities and escort business. Users resorted to applications like Twitterfeed and TweetDeck to post and popularize mobile numbers on multiple OSNs. To assess risks associated with mobile numbers exposed on OSNs, we used mobile numbers to gain sensitive information (e.g. name, Voter ID) about their owners. We communicated the observed risks to the owners by calling them on their mobile number. Few users were surprised to know the online presence of their number, while few users intentionally put it online for business purposes. With these observations, we highlight that there is a need to monitor leakage of mobile numbers via profile and public posts. To the best of our knowledge, this is the first exploratory study to critically investigate the exposure of mobile numbers on OSNs.