TY - JOUR
T1 - Learning Multi-Party Adversarial Encryption and Its Application to Secret Sharing
AU - Meraouche, Ishak
AU - Dutta, Sabyasachi
AU - Mohanty, Sraban Kumar
AU - Agudo, Isaac
AU - Sakurai, Kouichi
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2022
Y1 - 2022
N2 - Neural networks based cryptography has seen a significant growth since the introduction of adversarial cryptography which makes use of Generative Adversarial Networks (GANs) to build neural networks that can learn encryption. The encryption has been proven weak at first but many follow up works have shown that the neural networks can be made to learn the One Time Pad (OTP) and produce perfectly secure ciphertexts. To the best of our knowledge, existing works only considered communications between two or three parties. In this paper, we show how multiple neural networks in an adversarial setup can remotely synchronize and establish a perfectly secure communication in the presence of different attackers eavesdropping their communication. As an application, we show how to build Secret Sharing Scheme based on this perfectly secure multi-party communication. The results show that it takes around 45,000 training steps for 4 neural networks to synchronize and reach equilibria. When reaching equilibria, all the neural networks are able to communicate between each other and the attackers are not able to break the ciphertexts exchanged between them.
AB - Neural networks based cryptography has seen a significant growth since the introduction of adversarial cryptography which makes use of Generative Adversarial Networks (GANs) to build neural networks that can learn encryption. The encryption has been proven weak at first but many follow up works have shown that the neural networks can be made to learn the One Time Pad (OTP) and produce perfectly secure ciphertexts. To the best of our knowledge, existing works only considered communications between two or three parties. In this paper, we show how multiple neural networks in an adversarial setup can remotely synchronize and establish a perfectly secure communication in the presence of different attackers eavesdropping their communication. As an application, we show how to build Secret Sharing Scheme based on this perfectly secure multi-party communication. The results show that it takes around 45,000 training steps for 4 neural networks to synchronize and reach equilibria. When reaching equilibria, all the neural networks are able to communicate between each other and the attackers are not able to break the ciphertexts exchanged between them.
UR - http://www.scopus.com/inward/record.url?scp=85142782685&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85142782685&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2022.3223430
DO - 10.1109/ACCESS.2022.3223430
M3 - Article
AN - SCOPUS:85142782685
SN - 2169-3536
VL - 10
SP - 121329
EP - 121339
JO - IEEE Access
JF - IEEE Access
ER -