首页> 外文期刊>Quality Control, Transactions >A Secure Data Infrastructure for Personal Manufacturing Based on a Novel Key-Less, Byte-Less Encryption Method
【24h】

A Secure Data Infrastructure for Personal Manufacturing Based on a Novel Key-Less, Byte-Less Encryption Method

机译:基于小型密钥的字节加密方法的个人制造安全数据基础架构

获取原文
获取原文并翻译 | 示例
           

摘要

We are witnessing the advent of personal manufacturing, where home users and small and medium enterprises manufacture products locally, at the point and time of need. The impressively fast adoption of these technologies indicates this approach to manufacturing can become a key enabler of the real-time economy of the future. In this paper, we contribute a secure and dependable infrastructure and architecture for that new paradigm. Our solution leverages physical limitations of the computational process into a defense strategy that makes distributed file storage and transfer highly secure. The main idea is to replace asymmetric or public-key encryption functions with an unkeyed, collision, second preimage, and preimage resistant cryptographic hash function. Such a cryptosystem does not have an inverse function . We challenge each block hash against the full hash table to recreate the original message. To illustrate the approach, we describe secured protocols that provide a number of desirable properties during both data storage and streaming. Similar to proof-of-work blockchain consensus algorithms, we parameterized the solution based on the amount of infrastructure available. Experiments show the proposed method can recalculate hashes for a 3-dimensional of 256(3) at an average of 14 revisions per second, and one revision every 5 minutes for a bigger matrix of 4096(3). The increase in cloud infrastructure cost is insignificant compared to the level of protection offered.
机译:我们目睹了个人制造的出现,家庭用户和中小企业在本地制造产品,在需求的点和时间。这些技术的令人印象深刻的快速采用表明这种制造方法可以成为未来实时经济的关键推动因素。在本文中,我们为该新范例提供了一种安全可靠的基础设施和架构。我们的解决方案利用计算过程的物理限制成为一种使分布式文件存储和传输高度安全的防御策略。主要思想是用不对称,碰撞,第二次预报和预测耐受加密散列函数替换不对称或公钥加密功能。这种密码系统没有反向功能。我们挑战每个街区哈希哈希哈希表以重建原始信息。为了说明该方法,我们描述了在数据存储和流中提供了许多所需特性的安全协议。类似于工作验证区块链Consensus算法,我们根据可用的基础架构量参数化解决方案。实验表明,所提出的方法可以平均每秒重新计算三维256(3)的散列,每隔5分钟的每5分钟进行一次修订,为4096(3)的更大矩阵。与提供的保护级别相比,云基础设施成本的增加是微不足道的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号