TY - JOUR
T1 - Magnifying computing gaps
T2 - Establishing encrypted communication over unidirectional channels
AU - Dolev, Shlomi
AU - Korach, Ephraim
AU - Li, Ximing
AU - Li, Yin
AU - Uzan, Galit
N1 - Funding Information:
An extended abstract of this work [9] was presented in the Symposium on Stabilization Safety and Security, 2007. Partially supported by the Lynne and William Frankel Center for Computer Science . The first author is also supported by the Rita Altura Trust Chair in Computer Science .
Publisher Copyright:
© 2016 Elsevier B.V.
PY - 2016/7/11
Y1 - 2016/7/11
N2 - In the field of information security, the best way of protecting the privacy of the participants is to keep silent. Consider two, not necessarily identical, powerful computers or computer-grids connected by a unidirectional communication link that should transfer a long stream of information in the presence of a listening adversary that is slightly weaker. We present schemes that enhance the computation strength gap between the powerful computers and the adversary. The gap between the amount of information decrypted by the adversary and the information decrypted by the receiver grows with time. Based on a new defined shortest vector problem, we also propose a simplified version scheme in which only the receivers are computationally powerful. The scheme is self-stabilizing in the sense that it can establish a security level without relying on (previously distributed private keys that are part of) the state. The iterative nested approach can be used for enhancing the security of the classical protocol of Ralph Merkle [19]. Several applications for sensor networks and for secure communication with survivors are suggested.
AB - In the field of information security, the best way of protecting the privacy of the participants is to keep silent. Consider two, not necessarily identical, powerful computers or computer-grids connected by a unidirectional communication link that should transfer a long stream of information in the presence of a listening adversary that is slightly weaker. We present schemes that enhance the computation strength gap between the powerful computers and the adversary. The gap between the amount of information decrypted by the adversary and the information decrypted by the receiver grows with time. Based on a new defined shortest vector problem, we also propose a simplified version scheme in which only the receivers are computationally powerful. The scheme is self-stabilizing in the sense that it can establish a security level without relying on (previously distributed private keys that are part of) the state. The iterative nested approach can be used for enhancing the security of the classical protocol of Ralph Merkle [19]. Several applications for sensor networks and for secure communication with survivors are suggested.
KW - Combinatorial optimization problems
KW - Unidirectional encryption
UR - http://www.scopus.com/inward/record.url?scp=84975166299&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2016.04.032
DO - 10.1016/j.tcs.2016.04.032
M3 - Article
AN - SCOPUS:84975166299
SN - 0304-3975
VL - 636
SP - 17
EP - 26
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -