Anonymous Aggregate Fine-Grained Cloud Data Verification System for Smart Health

With the rapid development of cloud computing and Internet of Things (IoT), smart health (s-health) is anticipated to enhance healthcare quality significantly. However, data integrity, user anonymity, and authentication concerns have not been adequately addressed in s-health. Remote data integrity checking (RDIC) and digital signature schemes have great potential to address these requirements. Nevertheless, the direct adoption of these schemes suffers from two flaws. Firstly, they incur prohibitively high computation and communication overhead. Secondly, they leak sensitive health information about patients and do not provide complete anonymity. To address these issues, we introduce <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {A^{3}B}$</tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {RDV}$</tex-math></inline-formula> , an aggregate anonymous attribute-based remote data verification scheme. In <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {A^{3}B}$</tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {RDV}$</tex-math></inline-formula> , the integrity of an arbitrary number of cloud data files can be verified at once without downloading the whole data, thereby saving communication and computation resources. Moreover, in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {A^{3}B}$</tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {RDV}$</tex-math></inline-formula> , data owners can be authenticated by performing highly efficient operations. Also, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {A^{3}B}$</tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {RDV}$</tex-math></inline-formula> provides complete anonymity and supports dishonest-user traceability. We provide security definitions for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {A^{3}B}$</tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {RDV}$</tex-math></inline-formula> and prove its security under the hardness assumption of the bilinear Diffie-Hellman (BDH) problem. Performance comparisons and experimental results indicate that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {A^{3}B}$</tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathbf {RDV}$</tex-math></inline-formula> is more efficient and expressive than state-of-the-art approaches.