Cryptographic protocol for finding the meeting place of participants with confidentiality property
I. D. Ioganson, Alexandr A. Golovanov, Jean-Michel Nikodemovich Dakuo, Vadim Davydov
Abstract
Open-access reader
I. D. Ioganson, Alexandr A. Golovanov, Jean-Michel Nikodemovich Dakuo, Vadim Davydov
Abstract
Open-access reader
In this paper a new cryptographic protocol for finding the meeting place of participants is proposed. This protocol allows several participants to choose the meeting place closest to their locations not revealing the coordinates of each of the participants. The protocol also allows to detect an error occurring during the transfer of information between participants. The correctness and security of the used approach are proved, and the main advantages and disadvantages are determined.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper a new cryptographic protocol for finding the meeting place of participants is proposed. This protocol allows several participants to choose the meeting place closest to their locations not revealing the coordinates of each of the participants. The protocol also allows to detect an error occurring during the transfer of information between participants. The correctness and security of the used approach are proved, and the main advantages and disadvantages are determined.
Key concepts: Correctness, Protocol (science), Cryptography, Cryptographic protocol, Computer science, Confidentiality, Property (philosophy), Computer security