CryptoCache : Network caching with confidentiality. / Leguay, Jeremie; Paschos, Georgios; Quaglia, Elizabeth; Smyth, Ben.

2017. 1-6 Paper presented at Communications (ICC), 2017 IEEE International Conference on, Paris, France.

Research output: Contribution to conferencePaper

Published

Standard

CryptoCache : Network caching with confidentiality. / Leguay, Jeremie; Paschos, Georgios; Quaglia, Elizabeth; Smyth, Ben.

2017. 1-6 Paper presented at Communications (ICC), 2017 IEEE International Conference on, Paris, France.

Research output: Contribution to conferencePaper

Harvard

Leguay, J, Paschos, G, Quaglia, E & Smyth, B 2017, 'CryptoCache: Network caching with confidentiality' Paper presented at Communications (ICC), 2017 IEEE International Conference on, Paris, France, 21/05/17 - 25/05/17, pp. 1-6. https://doi.org/10.1109/ICC.2017.7996866

APA

Leguay, J., Paschos, G., Quaglia, E., & Smyth, B. (2017). CryptoCache: Network caching with confidentiality. 1-6. Paper presented at Communications (ICC), 2017 IEEE International Conference on, Paris, France. https://doi.org/10.1109/ICC.2017.7996866

Vancouver

Leguay J, Paschos G, Quaglia E, Smyth B. CryptoCache: Network caching with confidentiality. 2017. Paper presented at Communications (ICC), 2017 IEEE International Conference on, Paris, France. https://doi.org/10.1109/ICC.2017.7996866

Author

Leguay, Jeremie ; Paschos, Georgios ; Quaglia, Elizabeth ; Smyth, Ben. / CryptoCache : Network caching with confidentiality. Paper presented at Communications (ICC), 2017 IEEE International Conference on, Paris, France.6 p.

BibTeX

@conference{870be30b632647dc8e4dbf35045c578a,
title = "CryptoCache: Network caching with confidentiality",
abstract = "End-to-end encryption seemingly signifies the death of caching, because current methods ensure that no two sessions are alike. In this paper, we show that servers can reuse encrypted content between sessions, thereby rejuvenating caching. The main idea of our technique is to allow interim nodes to cache content based on pseudo-identifiers instead of real file identities. This enables caching of reusable pseudo-identifiers, whilst maintaining content confidentiality, i.e., ensuring that only the client and the server know the actual identity of the requested file. Furthermore, we provide an extension that prevents client linkability, i.e., ensuring it is impossible to tell if two clients are viewing the same content. Finally, we formally analyse the balance between security and the hit probability performance of the cache.",
author = "Jeremie Leguay and Georgios Paschos and Elizabeth Quaglia and Ben Smyth",
year = "2017",
month = "7",
day = "31",
doi = "10.1109/ICC.2017.7996866",
language = "English",
pages = "1--6",
note = "Communications (ICC), 2017 IEEE International Conference on, ICC ; Conference date: 21-05-2017 Through 25-05-2017",

}

RIS

TY - CONF

T1 - CryptoCache

T2 - Network caching with confidentiality

AU - Leguay, Jeremie

AU - Paschos, Georgios

AU - Quaglia, Elizabeth

AU - Smyth, Ben

PY - 2017/7/31

Y1 - 2017/7/31

N2 - End-to-end encryption seemingly signifies the death of caching, because current methods ensure that no two sessions are alike. In this paper, we show that servers can reuse encrypted content between sessions, thereby rejuvenating caching. The main idea of our technique is to allow interim nodes to cache content based on pseudo-identifiers instead of real file identities. This enables caching of reusable pseudo-identifiers, whilst maintaining content confidentiality, i.e., ensuring that only the client and the server know the actual identity of the requested file. Furthermore, we provide an extension that prevents client linkability, i.e., ensuring it is impossible to tell if two clients are viewing the same content. Finally, we formally analyse the balance between security and the hit probability performance of the cache.

AB - End-to-end encryption seemingly signifies the death of caching, because current methods ensure that no two sessions are alike. In this paper, we show that servers can reuse encrypted content between sessions, thereby rejuvenating caching. The main idea of our technique is to allow interim nodes to cache content based on pseudo-identifiers instead of real file identities. This enables caching of reusable pseudo-identifiers, whilst maintaining content confidentiality, i.e., ensuring that only the client and the server know the actual identity of the requested file. Furthermore, we provide an extension that prevents client linkability, i.e., ensuring it is impossible to tell if two clients are viewing the same content. Finally, we formally analyse the balance between security and the hit probability performance of the cache.

U2 - 10.1109/ICC.2017.7996866

DO - 10.1109/ICC.2017.7996866

M3 - Paper

SP - 1

EP - 6

ER -