Interactivity in Constructive Cryptography : Modeling and Applications to Updatable Encryption and Private Information Retrieval

04/25/2022
βˆ™
by   FranΓ§oise Levy-dit-Vehel, et al.
βˆ™
0
βˆ™

In this work, we extend the Constructive Cryptography (CC) framework introduced by Maurer in 2011 so as to handle interactive protocols. We design and construct a so-called Interactive Server Memory Resource (ISMR), that is an augmented version of the basic instantiation of a client-server protocol in CC, namely the Server Memory Resource. We then apply our ISMR construction to two types of interactive cryptographic protocols for remote storage : Updatable Encryption (UE) and Private Information Retrieval (PIR). Concerning UE, our results are a composable version of those protocols, clarifying the security guarantees achieved by any UE scheme. Namely, we give the relevant security notion to consider according to a given leakage context. Letting USMR denote our ISMR adapted to the UE application, we prove that 𝖨𝖭𝖣-𝖴𝖀-𝖒𝖯𝖠 security is sufficient for a secure construction of a confidential USMR that hides the age of ciphertexts; and 𝖨𝖭𝖣-(𝖀𝖭𝖒+𝖴𝖯𝖣)-𝖒𝖯𝖠 security is sufficient for a secure construction of a confidential USMR in case of unrestricted leakage. As a consequence, contrary to what was claimed before, the 𝖨𝖭𝖣-𝖴𝖀 security notion is not always stronger than the 𝖨𝖭𝖣-(𝖀𝖭𝖒+𝖴𝖯𝖣) one. Concerning PIR, we also give a composable version of PIR protocols, yielding a unique model that unifies different notions of PIR : IT-PIR, C-PIR, one- or multi- server PIR. Using the flexibility of CC, we are also able to model PIR variants, such as SPIR.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 01/23/2020

The Capacity of Single-Server Weakly-Private Information Retrieval

A private information retrieval (PIR) protocol guarantees that a user ca...
research
βˆ™ 04/23/2019

Foundations, Properties, and Security Applications of Puzzles: A Survey

Cryptographic algorithms have been used not only to create robust cipher...
research
βˆ™ 10/27/2019

Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels

We revisit the problem of low-memory robust simulation of interactive pr...
research
βˆ™ 08/28/2022

Categorical composable cryptography: extended version

We formalize the simulation paradigm of cryptography in terms of categor...
research
βˆ™ 05/12/2021

Categorical composable cryptography

We formalize the simulation paradigm of cryptography in terms of categor...
research
βˆ™ 10/04/2021

A Lightweight, Anonymous and Confidential Genomic Computing for Industrial Scale Deployment

This paper studies anonymous and confidential genomic case and control c...

Please sign up or login with your details

Forgot password? Click here to reset