| Title | Perfect Secrecy in the Bounded Storage Model |
| Publication Type | Conference Paper |
| Year of Publication | 2021 |
| Authors | Bhardwaj, Divyanshu, Sadjadpour, Hamid R. |
| Conference Name | 2021 IEEE Global Communications Conference (GLOBECOM) |
| Keywords | Additives, Bounded storage model, compositionality, Conferences, cryptography, faces, Global communication, group theory, information-theoretic security, Predictive Metrics, Protocols, provable security, pubcrawl, Resiliency, Secure storage |
| Abstract | In this paper, we propose a new provably secure cryptosystem for two party communication that provides security in the face of new technological breakthroughs. Most of the practical cryptosystems in use today can be breached in the future with new sophisticated methods. This jeopardizes the security of older but highly confidential messages. Our protocol is based on the bounded storage model first introduced in [1]. The protocol is secure as long as there is bound on the storage, however large it may be. We also suggest methods to extend the protocol to unbounded storage models where access to adversary is limited. Our protocol is a substantial improvement over previously known protocols and uses short key and optimal number of public random bits size of which is independent of message length. The smaller and constant length of key and public random string makes the scheme more practical. The protocol generates key using elements of the additive group \$\textbackslashtextbackslashmathbbZ\_\textbackslashtextbackslashmathrmn\$. Our protocol is very generalized and the protocol in [1] is a special case of our protocol. Our protocol is a step forward in making provably secure cryptosystems practical. An important open problem raised in [2] was designing an algorithm with short key and size of public random string \$O(\textbackslashtextbackslashmathcalB)\$ where \$\textbackslashtextbackslashmathcalB\$ bounds the storage of adversary. Our protocol satisfies the conditions and is easy to implement. |
| DOI | 10.1109/GLOBECOM46510.2021.9685688 |
| Citation Key | bhardwaj_perfect_2021 |
Perfect Secrecy in the Bounded Storage Model