sFEA: A Lightweight, Scalable, and Secure Finite Element Analysis Technique

S. Chaduvula, M. Atallah, Jitesh H. Panchal
{"title":"sFEA: A Lightweight, Scalable, and Secure Finite Element Analysis Technique","authors":"S. Chaduvula, M. Atallah, Jitesh H. Panchal","doi":"10.1115/DETC2018-85566","DOIUrl":null,"url":null,"abstract":"Designers need a way to overcome information related risks, including information leakage and misuse from their own collaborators during a collaborative product realization process. Existing cryptographic techniques aimed at overcoming these information related risks are computationally expensive and slow even for moderate problem sizes, and legal approaches (e.g., the use of non-disclosure agreements) are not effective. The computational practicality problem is particularly pronounced for simulation computations like finite element analysis (FEA), that involve both a geometric partitioning (meshing) and computations of cubic time complexity. In this paper, we propose a technological approach that enables designers to perform simulations, such as FEA computations, without the need for revealing their information to anyone, including their design collaborators. We demonstrate our approach using secure finite element analysis (sFEA) which enables designers to perform FEA without having to reveal structural/material information to their counterparts even though the computed answer depends on all the collaborators’ confidential information. We build sFEA using computationally efficient protocols implementing a secure co-design framework. One of our findings is that the most natural implementations of sFEA, using existing protocols, suffer from limited scalability. To overcome these limitations, we propose strategies that help improve the scalability of sFEA. We document and discuss the experiments we conducted to determine the computational overhead imposed by sFEA. The results indicate that the computational burden imposed by sFEA makes it challenging for large-scale FEA — our scheme significantly increases the problem sizes that can be handled when compared to implementations using previous algorithms and protocols, but large enough problem sizes will swamp our scheme as well (in some sense this is unavoidable because of the cubic nature of the FEA time complexity). This work is another step towards opening up new avenues for improving the way information is exchanged in collaborative simulation computations such as FEA.","PeriodicalId":142043,"journal":{"name":"Volume 1A: 38th Computers and Information in Engineering Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Volume 1A: 38th Computers and Information in Engineering Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1115/DETC2018-85566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Designers need a way to overcome information related risks, including information leakage and misuse from their own collaborators during a collaborative product realization process. Existing cryptographic techniques aimed at overcoming these information related risks are computationally expensive and slow even for moderate problem sizes, and legal approaches (e.g., the use of non-disclosure agreements) are not effective. The computational practicality problem is particularly pronounced for simulation computations like finite element analysis (FEA), that involve both a geometric partitioning (meshing) and computations of cubic time complexity. In this paper, we propose a technological approach that enables designers to perform simulations, such as FEA computations, without the need for revealing their information to anyone, including their design collaborators. We demonstrate our approach using secure finite element analysis (sFEA) which enables designers to perform FEA without having to reveal structural/material information to their counterparts even though the computed answer depends on all the collaborators’ confidential information. We build sFEA using computationally efficient protocols implementing a secure co-design framework. One of our findings is that the most natural implementations of sFEA, using existing protocols, suffer from limited scalability. To overcome these limitations, we propose strategies that help improve the scalability of sFEA. We document and discuss the experiments we conducted to determine the computational overhead imposed by sFEA. The results indicate that the computational burden imposed by sFEA makes it challenging for large-scale FEA — our scheme significantly increases the problem sizes that can be handled when compared to implementations using previous algorithms and protocols, but large enough problem sizes will swamp our scheme as well (in some sense this is unavoidable because of the cubic nature of the FEA time complexity). This work is another step towards opening up new avenues for improving the way information is exchanged in collaborative simulation computations such as FEA.
sFEA:一种轻量级、可扩展和安全的有限元分析技术
设计人员需要一种方法来克服与信息相关的风险,包括在协作产品实现过程中来自他们自己的合作者的信息泄漏和误用。旨在克服这些信息相关风险的现有加密技术在计算上是昂贵的,并且即使对于中等规模的问题也是缓慢的,并且法律方法(例如,使用保密协议)并不有效。对于像有限元分析(FEA)这样的模拟计算来说,计算实用性问题尤其明显,因为它既涉及几何划分(网格划分),也涉及三次时间复杂度的计算。在本文中,我们提出了一种技术方法,使设计人员能够执行模拟,如有限元计算,而不需要向任何人透露他们的信息,包括他们的设计合作者。我们使用安全有限元分析(sFEA)来演示我们的方法,该方法使设计人员无需向同行透露结构/材料信息即可执行有限元分析,即使计算结果取决于所有合作者的机密信息。我们使用实现安全协同设计框架的高效计算协议构建sFEA。我们的发现之一是,使用现有协议的最自然的sFEA实现受到有限的可扩展性的影响。为了克服这些限制,我们提出了有助于提高sFEA可扩展性的策略。我们记录并讨论了我们进行的实验,以确定sFEA施加的计算开销。结果表明,sFEA带来的计算负担使得大规模FEA具有挑战性-与使用以前的算法和协议实现相比,我们的方案显着增加了可以处理的问题规模,但是足够大的问题规模也会淹没我们的方案(在某种意义上这是不可避免的,因为FEA时间复杂性的立方性质)。这项工作是为改进协同模拟计算(如有限元分析)中信息交换方式开辟新途径的又一步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信