{"title":"Multi-Adjustable Join Schemes With Adaptive Indistinguishably Security","authors":"Mojtaba Rafiee","doi":"10.1109/TDSC.2023.3343872","DOIUrl":null,"url":null,"abstract":"A multi-adjustable join (<inline-formula><tex-math notation=\"LaTeX\">$\\text{M-Adjoin}$</tex-math><alternatives><mml:math><mml:mtext>M-Adjoin</mml:mtext></mml:math><inline-graphic xlink:href=\"rafiee-ieq1-3343872.gif\"/></alternatives></inline-formula>) scheme [Khazaei-Rafiee, IEEE TDSC 2020], a generalization of <inline-formula><tex-math notation=\"LaTeX\">$\\text{Adjoin}$</tex-math><alternatives><mml:math><mml:mtext>Adjoin</mml:mtext></mml:math><inline-graphic xlink:href=\"rafiee-ieq2-3343872.gif\"/></alternatives></inline-formula> scheme [Popa-Zeldovich, MIT CSAIL TR 2012], is a symmetric-key primitive that enables a user to securely outsource his database to an external server, and later to issue join queries for a list of columns. In [Rafiee-Khazaei, IEEE TDSC 2021], based on the previously defined security notions for <inline-formula><tex-math notation=\"LaTeX\">$\\text{Adjoin}$</tex-math><alternatives><mml:math><mml:mtext>Adjoin</mml:mtext></mml:math><inline-graphic xlink:href=\"rafiee-ieq3-3343872.gif\"/></alternatives></inline-formula> [Mironov-Segev-Shahaf, TCC 2017], several security notions for <inline-formula><tex-math notation=\"LaTeX\">$\\text{M-Adjoin}$</tex-math><alternatives><mml:math><mml:mtext>M-Adjoin</mml:mtext></mml:math><inline-graphic xlink:href=\"rafiee-ieq4-3343872.gif\"/></alternatives></inline-formula> were proposed and their relationships were investigated. Constructing an <inline-formula><tex-math notation=\"LaTeX\">$\\text{M-Adjoin}$</tex-math><alternatives><mml:math><mml:mtext>M-Adjoin</mml:mtext></mml:math><inline-graphic xlink:href=\"rafiee-ieq5-3343872.gif\"/></alternatives></inline-formula> with indistinguishability security against adaptive adversary has remained a challenging problem so far. In this paper, we introduce two <inline-formula><tex-math notation=\"LaTeX\">$\\text{M-Adjoin}$</tex-math><alternatives><mml:math><mml:mtext>M-Adjoin</mml:mtext></mml:math><inline-graphic xlink:href=\"rafiee-ieq6-3343872.gif\"/></alternatives></inline-formula> constructions to achieve this strong security notion in the random oracle model. We prove the security of our constructions under Decisional Diffie-Hellman assumption in <inline-formula><tex-math notation=\"LaTeX\">$\\mathbb {G}_{1}$</tex-math><alternatives><mml:math><mml:msub><mml:mi mathvariant=\"double-struck\">G</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math><inline-graphic xlink:href=\"rafiee-ieq7-3343872.gif\"/></alternatives></inline-formula> (DDH1) in the bilinear groups. Compared with previous constructions, despite having a higher security level, the computation and storage overheads do not increase.","PeriodicalId":13047,"journal":{"name":"IEEE Transactions on Dependable and Secure Computing","volume":null,"pages":null},"PeriodicalIF":7.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Dependable and Secure Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/TDSC.2023.3343872","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
A multi-adjustable join ($\text{M-Adjoin}$M-Adjoin) scheme [Khazaei-Rafiee, IEEE TDSC 2020], a generalization of $\text{Adjoin}$Adjoin scheme [Popa-Zeldovich, MIT CSAIL TR 2012], is a symmetric-key primitive that enables a user to securely outsource his database to an external server, and later to issue join queries for a list of columns. In [Rafiee-Khazaei, IEEE TDSC 2021], based on the previously defined security notions for $\text{Adjoin}$Adjoin [Mironov-Segev-Shahaf, TCC 2017], several security notions for $\text{M-Adjoin}$M-Adjoin were proposed and their relationships were investigated. Constructing an $\text{M-Adjoin}$M-Adjoin with indistinguishability security against adaptive adversary has remained a challenging problem so far. In this paper, we introduce two $\text{M-Adjoin}$M-Adjoin constructions to achieve this strong security notion in the random oracle model. We prove the security of our constructions under Decisional Diffie-Hellman assumption in $\mathbb {G}_{1}$G1 (DDH1) in the bilinear groups. Compared with previous constructions, despite having a higher security level, the computation and storage overheads do not increase.
期刊介绍:
The "IEEE Transactions on Dependable and Secure Computing (TDSC)" is a prestigious journal that publishes high-quality, peer-reviewed research in the field of computer science, specifically targeting the development of dependable and secure computing systems and networks. This journal is dedicated to exploring the fundamental principles, methodologies, and mechanisms that enable the design, modeling, and evaluation of systems that meet the required levels of reliability, security, and performance.
The scope of TDSC includes research on measurement, modeling, and simulation techniques that contribute to the understanding and improvement of system performance under various constraints. It also covers the foundations necessary for the joint evaluation, verification, and design of systems that balance performance, security, and dependability.
By publishing archival research results, TDSC aims to provide a valuable resource for researchers, engineers, and practitioners working in the areas of cybersecurity, fault tolerance, and system reliability. The journal's focus on cutting-edge research ensures that it remains at the forefront of advancements in the field, promoting the development of technologies that are critical for the functioning of modern, complex systems.