| 查看: 1209 | 回复: 4 | |||
| 【有奖交流】积极回复本帖子，参与交流，就有机会分得作者 心静心诚 的 25 个金币 | |||
| 当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖 | |||
[交流]
修改后有希望中吗
|
|||
|
Reviewer 1 The paper discuss about the collaborative privacy protection scheme based on verifiable secret sharing and trust mechanism. The work seems to be interesting. These are my suggestions. 1. Abstract parts needs to be rewritten 2. In the results section author can discuss about the computation costs theoretically such as exponential operation, hash function, random number, etc. 3. Conclusion needs to be rewritten where major finding needs to discuss. 4. Include the following references in introduction and related works a) Anonymous and linkable location-based services VK Yadav, N Andola, S Verma, S Venkatesan IEEE Transactions on Vehicular Technology 71 (9), 9397-9409 b) Efficient and privacy-preserving location-based services over the cloud VK Yadav, S Verma, S Venkatesan Cluster Computing 25 (5), 3175-3192 c) Efficient and privacy-preserving location-based services over the cloud VK Yadav, S Verma, S Venkatesan Cluster Computing 25 (5), 3175-3192 d) Linkable privacy-preserving scheme for location-based services VK Yadav, S Verma, S Venkatesan IEEE Transactions on Intelligent Transportation Systems 23 (7), 7998-8012 e) P2LBS: Privacy provisioning in location-based services VK Yadav, N Andola, S Verma, S Venkatesan IEEE Transactions on Services Computing f) P2LBS: Privacy provisioning in location-based services VK Yadav, N Andola, S Verma, S Venkatesan IEEE Transactions on Services Computing 5. Author can discuss the problem definition after the related work. After major revision, the paper can be consider for publication Reviewer 2 The manuscript based on a verifiable secret sharing and trust mechanism is proposed to solve the trust and cooperate among mutliple users and service. The requester uses a verifiable secret-sharing algorithm to encrypt and split the master secret and provides a corresponding coefficient commitment to verify the sub-secret data, so it is difficult for cooperative users to know any information about the initiator. If t users do not collide with each other, it is difficult for collusion to form a complete query. The combination of verifiable secret sharing and trust mechanism further provides incentive competition because the cooperative users who submit partition information first and get corresponding feedback will get the incentive. However, I have some suggestions for the author. 1. “For the first time, we introduce a privacy protection scheme based....” I suggest the author research the relevant literature to see if it is the first time this method has been proposed. 2. The logical relationship between LBS privacy and VSS-TPPS is not clear. 3 There are more colloquial descriptions in the article, some typos. 4.Suggest the author list the secure model and motivation. Reviewer 3 A novel collaborative privacy protection scheme based on verifiable secret sharing and trust mechanism Summary Authors propose a verifiable secret-sharing and trust mechanism. Overall, the paper is well written. However, there are few minor changes required. 1.?Table 2 could be shifted before 3.1 2.?The proposed scheme is mentioned as VSS-TPPS in few places but it is represented as VSSTPPS in few places. Please unify. 3.?Please unify the equation reference. For example, Eq. (10), Equation (9), Equation 5… 4.?Correct the typo error in few places…Who are malicmous users? 发自小木虫IOS客户端 |
回复此楼» 猜你喜欢
一志愿北京化工大学材料与化工296分求调剂
已经有4人回复
-
291求调剂
已经有9人回复
-
288求调剂
已经有3人回复
-
334求调剂
已经有5人回复
-
一志愿郑州大学，学硕，物理化学， 333求调剂
已经有7人回复
-
材料学学硕308分/本科东北大学/一志愿西北工业大学/
已经有9人回复
-
320材料与化工，求调剂
已经有12人回复
-
化工284求调剂
已经有8人回复
-
复试调剂
已经有4人回复
-
0703化学调剂
已经有5人回复
RRRKKK
至尊木虫 (著名写手)
- 应助: 13 (小学生)
- 金币: 24159.7
- 散金: 148
- 红花: 35
- 帖子: 2857
- 在线: 1141.5小时
- 虫号: 1076628
- 注册: 2010-08-18
- 专业: 控制理论与方法
5楼2024-10-02 16:40:29
tzynew
神虫浮云 (文学泰斗)
- 应助: 51 (初中生)
- 金币: 1496830
- 散金: 2
- 红花: 63
- 沙发: 20
- 帖子: 1337664
- 在线: 40656.3小时
- 虫号: 1071604
- 注册: 2010-08-09
- 性别: GG
- 专业: 有机合成
2楼2024-10-02 14:27:28
3楼2024-10-02 15:14:14
4楼2024-10-02 15:15:56
