Papers
Topics
Authors
Recent
Search
2000 character limit reached

SERENE: A Collusion Resilient Replication-based Verification Framework

Published 17 Apr 2024 in cs.CR and cs.NI | (2404.11410v2)

Abstract: The rapid advancement of autonomous driving technology is accompanied by substantial challenges, particularly the reliance on remote task execution without ensuring a reliable and accurate returned results. This reliance on external compute servers, which may be malicious or rogue, represents a major security threat. While researchers have been exploring verifiable computing, and replication-based task verification as a simple, fast, and dependable method to assess the correctness of results. However, colluding malicious workers can easily defeat this method. Existing collusion detection and mitigation solutions often require the use of a trusted third party server or verified tasks which may be hard to guarantee, or solutions that assume the presence of a minority of colluding servers. We propose SERENE, a collusion resilient replication-based verification framework that detects, and mitigates colluding workers. Unlike state-of-the-art solutions, SERENE uses a lightweight detection algorithm that detects collusion based on a single verification task. Mitigation requires a two stage process to group the workers and identifying colluding from honest workers. We implement and compare SERENE's performance to Staab et. al, resulting in an average of 50\% and 60\% accuracy improvement in detection and mitigation accuracy respectively.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. M. Walfish and A. J. Blumberg, “Verifying computations without reexecuting them,” Communications of the ACM, vol. 58, no. 2, pp. 74–84, 2015.
  2. R. Gennaro, C. Gentry, and B. Parno, “Non-interactive verifiable computing: Outsourcing computation to untrusted workers,” in Annual Cryptology Conference, pp. 465–482, Springer, 2010.
  3. P. Jauernig, A.-R. Sadeghi, and E. Stapf, “Trusted execution environments: properties, applications, and challenges,” IEEE Security & Privacy, vol. 18, no. 2, pp. 56–60, 2020.
  4. R. Canetti, B. Riva, and G. N. Rothblum, “Practical delegation of computation using multiple servers,” in Proceedings of the 18th ACM conference on Computer and communications security, pp. 445–454, 2011.
  5. G. Levitin, L. Xing, and Y. Dai, “Optimal spot-checking for collusion tolerance in computer grids,” IEEE Transactions on Dependable and Secure Computing, vol. 16, no. 2, pp. 301–312, 2017.
  6. G. C. Silaghi, F. Araujo, L. M. Silva, P. Domingues, and A. E. Arenas, “Defeating colluding nodes in desktop grid computing platforms,” Journal of Grid Computing, vol. 7, no. 4, pp. 555–573, 2009.
  7. A. Küpçü, “Incentivized outsourced computation resistant to malicious contractors,” IEEE Transactions on Dependable and Secure Computing, vol. 14, no. 6, pp. 633–649, 2015.
  8. S. Zhao, V. Lo, and C. G. Dickey, “Result verification and trust-based scheduling in peer-to-peer grids,” in Fifth IEEE International Conference on Peer-to-Peer Computing (P2P’05), pp. 31–38, IEEE, 2005.
  9. C. Dong, Y. Wang, A. Aldweesh, P. McCorry, and A. van Moorsel, “Betrayal, distrust, and rationality: Smart counter-collusion contracts for verifiable cloud computing,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 211–227, 2017.
  10. L.-C. Canon, E. Jeannot, and J. Weissman, “A dynamic approach for characterizing collusion in desktop grids,” in 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pp. 1–12, IEEE, 2010.
  11. E. Staab and T. Engel, “Collusion detection for grid computing,” in 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, pp. 412–419, IEEE, 2009.
  12. M. Backes, D. Fiore, and R. M. Reischuk, “Verifiable delegation of computation on outsourced data,” in Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, pp. 863–874, 2013.
  13. K. Elkhiyaoui, M. Önen, M. Azraoui, and R. Molva, “Efficient techniques for publicly verifiable delegation of computation,” in Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, pp. 119–128, 2016.
  14. F. Schuster, M. Costa, C. Fournet, C. Gkantsidis, M. Peinado, G. Mainar-Ruiz, and M. Russinovich, “Vc3: Trustworthy data analytics in the cloud using sgx,” in 2015 IEEE symposium on security and privacy, pp. 38–54, IEEE, 2015.
  15. N. O. Duarte, S. D. Yalew, N. Santos, and M. Correia, “Leveraging arm trustzone and verifiable computing to provide auditable mobile functions,” in Proceedings of the 15th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, pp. 302–311, 2018.
  16. Z. Chen, Y. Tian, J. Xiong, C. Peng, and J. Ma, “Towards reducing delegation overhead in replication-based verification: An incentive-compatible rational delegation computing scheme,” Information Sciences, vol. 568, pp. 286–316, 2021.
  17. L. Wang, Y. Tian, and J. Xiong, “Achieving reliable and anti-collusive outsourcing computation and verification based on blockchain in 5g-enabled iot,” Digital Communications and Networks, 2022.
  18. J. Ménétrey, C. Göttel, M. Pasin, P. Felber, and V. Schiavoni, “An exploratory study of attestation mechanisms for trusted execution environments,” arXiv preprint arXiv:2204.06790, 2022.
  19. M. Belenkiy, M. Chase, C. C. Erway, J. Jannotti, A. Küpçü, and A. Lysyanskaya, “Incentivizing outsourced computation,” in Proceedings of the 3rd international workshop on Economics of networked systems, pp. 85–90, 2008.
  20. K. Watanabe, M. Fukushi, and S. Horiguchi, “Collusion-resistant sabotage-tolerance mechanisms for volunteer computing systems,” in 2009 IEEE International Conference on e-Business Engineering, pp. 213–218, IEEE, 2009.
  21. Y. Kong, C. Peikert, G. Schoenebeck, and B. Tao, “Outsourcing computation: the minimal refereed mechanism,” in International Conference on Web and Internet Economics, pp. 256–270, Springer, 2019.
  22. F. Araujo, J. Farinha, P. Domingues, G. C. Silaghi, and D. Kondo, “A maximum independent set approach for collusion detection in voting pools,” Journal of Parallel and Distributed Computing, vol. 71, no. 10, pp. 1356–1366, 2011.
  23. A. Bendahmane, M. Essaaidi, A. El Moussaoui, and A. Younes, “The effectiveness of reputation-based voting for collusion tolerance in large-scale grids,” IEEE Transactions on Dependable and Secure Computing, vol. 12, no. 6, pp. 665–674, 2014.
  24. A. M. Sauber, A. Awad, A. F. Shawish, and P. M. El-Kafrawy, “A novel hadoop security model for addressing malicious collusive workers,” Computational Intelligence and Neuroscience, vol. 2021, 2021.
  25. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, “The eigentrust algorithm for reputation management in p2p networks,” in Proceedings of the 12th international conference on World Wide Web, pp. 640–651, 2003.
  26. Markov Clustering Documentation, “Markov Clustering Documentation.” https://markov-clustering.readthedocs.io/en/latest/. [Online; accessed March 15, 2024].
  27. U. Brandes, M. Gaertler, and D. Wagner, “Experiments on graph clustering algorithms,” in European symposium on algorithms, pp. 568–579, Springer, 2003.
  28. Markov Clustering Documentation, “Markov Clustering Documentation.” https://scikit-learn.org/stable/modules/generated/sklearn.cluster.SpectralClustering.html. [Online; accessed March 15, 2024].

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.