Coordinate hiding in solving the generalized dangerous proximity problem
In connection with the rapid development of autopilot transportation systems (driverless cars, unmanned aerial vehicles – drones) all the more urgent becomes the problem of collision avoidance (the problem of dangerous proximity), especially in conditions of a large number of members of the traffic...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Joint Stock Company "Experimental Scientific and Production Association SPELS
2018-12-01
|
| Series: | Безопасность информационных технологий |
| Subjects: | |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/1165 |
| _version_ | 1827881881631195136 |
|---|---|
| author | Oleg V. Kazarin |
| author_facet | Oleg V. Kazarin |
| author_sort | Oleg V. Kazarin |
| collection | DOAJ |
| description | In connection with the rapid development of autopilot transportation systems (driverless cars, unmanned aerial vehicles – drones) all the more urgent becomes the problem of collision avoidance (the problem of dangerous proximity), especially in conditions of a large number of members of the traffic and its high intensity. If there is an attacker who is able to control one or more participants in the traffic, which strategy is to create an emergency on the road or collisions of unmanned vehicles there is a need to protect against such malicious behavior. One of the options of such protection is the use of the concept of multilateral confidential calculations to solve this particular problem. The future autopilot systems assume in some local traffic control zone the possibility of interaction of participants according to the "everyone-with-everyone" scheme, which is a necessary condition for multilateral confidential computing systems in conditions of various unauthorized actions.
In contrast to the previously published results using this concept in the model with the so-called semi-honest enemy, this article for the first time proposes some solutions to protect the traffic participants from the malicious actor, who, having revealed the coordinates of moving objects, tries to drive them to collision. It is also considered the expansion of this problem to three dimensions. At the same time, it is shown that the implementation of these systems in practice, most likely, does not help to avoid the problematic situations that are not solved only by mathematical methods. There is a large set of problems that must be solved by various organizational, technical and managerial methods. Nevertheless, the prospects of using the methods of provably safe coordinate hiding look, in the author's opinion, quite attractive for experts in the field of information security, communications, transport, and distributed systems. |
| first_indexed | 2024-03-12T18:46:54Z |
| format | Article |
| id | doaj.art-a81ac9b22079457ab7b3d89d55956e76 |
| institution | Directory Open Access Journal |
| issn | 2074-7128 2074-7136 |
| language | English |
| last_indexed | 2024-03-12T18:46:54Z |
| publishDate | 2018-12-01 |
| publisher | Joint Stock Company "Experimental Scientific and Production Association SPELS |
| record_format | Article |
| series | Безопасность информационных технологий |
| spelling | doaj.art-a81ac9b22079457ab7b3d89d55956e762023-08-02T07:34:34ZengJoint Stock Company "Experimental Scientific and Production Association SPELSБезопасность информационных технологий2074-71282074-71362018-12-0125410911810.26583/bit.2018.4.101122Coordinate hiding in solving the generalized dangerous proximity problemOleg V. Kazarin0Institute of Information Security Issues, Lomonosov MSU, Institute for Information Sciences and Security Technologies, RSUHIn connection with the rapid development of autopilot transportation systems (driverless cars, unmanned aerial vehicles – drones) all the more urgent becomes the problem of collision avoidance (the problem of dangerous proximity), especially in conditions of a large number of members of the traffic and its high intensity. If there is an attacker who is able to control one or more participants in the traffic, which strategy is to create an emergency on the road or collisions of unmanned vehicles there is a need to protect against such malicious behavior. One of the options of such protection is the use of the concept of multilateral confidential calculations to solve this particular problem. The future autopilot systems assume in some local traffic control zone the possibility of interaction of participants according to the "everyone-with-everyone" scheme, which is a necessary condition for multilateral confidential computing systems in conditions of various unauthorized actions. In contrast to the previously published results using this concept in the model with the so-called semi-honest enemy, this article for the first time proposes some solutions to protect the traffic participants from the malicious actor, who, having revealed the coordinates of moving objects, tries to drive them to collision. It is also considered the expansion of this problem to three dimensions. At the same time, it is shown that the implementation of these systems in practice, most likely, does not help to avoid the problematic situations that are not solved only by mathematical methods. There is a large set of problems that must be solved by various organizational, technical and managerial methods. Nevertheless, the prospects of using the methods of provably safe coordinate hiding look, in the author's opinion, quite attractive for experts in the field of information security, communications, transport, and distributed systems.https://bit.mephi.ru/index.php/bit/article/view/1165autopilot transport systems, geographic coordinates hiding, secure computation, secure function evaluation, two-party and multi-party protocols of secure computation. |
| spellingShingle | Oleg V. Kazarin Coordinate hiding in solving the generalized dangerous proximity problem Безопасность информационных технологий autopilot transport systems, geographic coordinates hiding, secure computation, secure function evaluation, two-party and multi-party protocols of secure computation. |
| title | Coordinate hiding in solving the generalized dangerous proximity problem |
| title_full | Coordinate hiding in solving the generalized dangerous proximity problem |
| title_fullStr | Coordinate hiding in solving the generalized dangerous proximity problem |
| title_full_unstemmed | Coordinate hiding in solving the generalized dangerous proximity problem |
| title_short | Coordinate hiding in solving the generalized dangerous proximity problem |
| title_sort | coordinate hiding in solving the generalized dangerous proximity problem |
| topic | autopilot transport systems, geographic coordinates hiding, secure computation, secure function evaluation, two-party and multi-party protocols of secure computation. |
| url | https://bit.mephi.ru/index.php/bit/article/view/1165 |
| work_keys_str_mv | AT olegvkazarin coordinatehidinginsolvingthegeneralizeddangerousproximityproblem |