Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Due to the proliferation of online social networking, a large number of personal data are publicly available. As such, personal attacks, reputational, financial, or family losses might occur once this personal and sensitive information falls into the hands of malicious hackers. Research on Privacy-Preserving Network Publishing has attracted much attention in recent years. But most work focus on node de-identification and link protection. In academic social networks, business transaction networks, and transportation networks, etc, node identities and link structures are public knowledge but ights and shortest paths are sensitive. In this work,  study the problem of k-anonymous path privacy. A published network graph with k-anonymous path privacy has at least k indistinguishable shortest paths beten the source and destination vertices [21]. In order to achieve such privacy, three different strategies of modification on edge ights of directed graphs are proposed. Numerical comparisons show that ight-proportional-based strategy is more efficient than PageRank-based and degree-based strategies. In addition, it is also more efficient and causes less information loss than running on un-directed graphs.
['Shyue-Liang Wang', 'Yu-Chuan Tsai', 'Hung-Yu Kao', 'I-Hsien Ting', 'Tzung-Pei Hong']
I am writing a research paper on a idea SHORTEST PATHS ANONYMIZATION ON WEIGHTED GRAPHS
[{"from": "human", "value": "I am writing a research paper on a idea SHORTEST PATHS ANONYMIZATION ON WEIGHTED GRAPHS"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Due to the proliferation of online social networking, a large number of personal data are publicly available. As such, personal attacks, reputational, financial, or family losses might occur once this personal and sensitive information falls into the hands of malicious hackers. Research on Privacy-Preserving Network Publishing has attracted much attention in recent years. But most work focus on node de-identification and link protection. In academic social networks, business transaction networks, and transportation networks, etc, node identities and link structures are public knowledge but ights and shortest paths are sensitive. In this work,  study the problem of k-anonymous path privacy. A published network graph with k-anonymous path privacy has at least k indistinguishable shortest paths beten the source and destination vertices [21]. In order to achieve such privacy, three different strategies of modification on edge ights of directed graphs are proposed. Numerical comparisons show that ight-proportional-based strategy is more efficient than PageRank-based and degree-based strategies. In addition, it is also more efficient and causes less information loss than running on un-directed graphs."}]