具有自适应无差别安全性的多调整连接方案

IF 7 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

IEEE Transactions on Dependable and Secure Computing Pub Date : 2024-07-01 DOI:10.1109/TDSC.2023.3343872

Mojtaba Rafiee

{"title":"具有自适应无差别安全性的多调整连接方案","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":"{\"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}","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

摘要

多可调整连接（$\text{M-Adjoin}$M-Adjoin）方案[Khazaei-Rafiee，IEEE TDSC 2020]是$\text{Adjoin}$Adjoin方案[Popa-Zeldovich，MIT CSAIL TR 2012]的广义化，是一种对称密钥基元，它使用户能够安全地将其数据库外包给外部服务器，之后再对列列表发出连接查询。在[Rafiee-Khazaei，IEEE TDSC 2021]中，基于之前定义的$\text{Adjoin}$Adjoin的安全概念[Mironov-Segev-Shahaf，TCC 2017]，提出了$\text{M-Adjoin}$M-Adjoin的几个安全概念，并研究了它们之间的关系。迄今为止，构建一个对自适应对手具有不可区分安全性的 $\text{M-Adjoin}$M-Adjoin 仍然是一个具有挑战性的问题。在本文中，我们介绍了两种$\text{M-Adjoin}$M-Adjoin构造，以在随机甲骨文模型中实现这种强安全概念。我们证明了我们的构造在双线性群中 $\mathbb {G}_{1}$G1 (DDH1) 的 Decisional Diffie-Hellman 假设下的安全性。与之前的结构相比，尽管安全等级更高，但计算和存储开销并没有增加。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Multi-Adjustable Join Schemes With Adaptive Indistinguishably Security

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}$

(DDH1) in the bilinear groups. Compared with previous constructions, despite having a higher security level, the computation and storage overheads do not increase.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Transactions on Dependable and Secure Computing 工程技术-计算机：软件工程

CiteScore

11.20

自引率

5.50%

发文量

354

审稿时长

9 months

期刊介绍： 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.