Secure exchange of information by synchronization of neural networks
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
A connection between the theory of neural networks and cryptography is presented. A new phenomenon, namely synchronization of neural networks is leading to a new method of exchange of secret messages. Numerical simulations show that two artificial networks being trained by Hebbian learning rule on their mutual outputs develop an antiparallel state of their synaptic weights. The synchronized weights are used to construct an ephemeral key exchange protocol for a secure transmission of secret data. It is shown that an opponent who knows the protocol and all details of any transmission of the data has no chance to decrypt the secret message, since tracking the weights is a hard problem compared to synchronization. The complexity of the generation of the secure channel is linear with the size of the network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Gray, C. M., König, P., Engel, A. K., & Singer, W. (1989) · Nature · doi:10.1038/338334a0 · Cited by 4,183
Cited by
Coutinho, M., De Oliveira Albuquerque, R., Borges, F., García Villalba, L., & Kim, T.-H. (2018) · Sensors · doi:10.3390/s18051306 · Cited by 75
“In 2002, Kanter et al. [6] proposed a new key exchange protocol between two parties using the notion of chaotic synchronization, which makes it possible for two weakly interacting chaotic systems to converge even though each one of them continues to move in a chaotic way.”
BackgroundInfluentialNeural Networks-Based Cryptography: A Survey
Meraouche, I., Dutta, S., Tan, H., & Sakurai, K. (2021) · IEEE Access · doi:10.1109/access.2021.3109635 · Cited by 52
“One very popular protocol by Kanter et al. [9] was proposed during the year 2001 and showed how two neural networks can learn to exchange a secret key without using any sort of known cryptography methods.”
BackgroundMethodInfluential
Metadata
- Authors
- Kanter, I., Kinzel, W., & Kanter, E.
- Venue
- Europhysics Letters (EPL)
- Publisher
- IOP Publishing
- Published
- 2002-01
- Volume
- 57
- Issue
- 1
- Pages
- 141-147
- ISSN
- 0295-5075 (ISSN-L)
- 1286-4854
- OpenAlex
- W2027811079
- Cited by
- 180
- References
- 2
- FWCI
- 6.69
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.