arXiv 1409.22482014-09-08cs.CR

Secure pseudo-random linear binary sequences generators based on arithmetic polynoms

Oleg Finko, Sergey Dichenko

发表信息：: Advances in Intelligent Systems and Computing (Pomeranian Univ Technol, Fac Comp Sci, Miedzyzdroje, POLAND, OCT 22-24, 2014), Soft Computing in Computer and Information Science, 342
DOI：: 10.1007/978-3-319-15147-2_24

英文摘要：

We present a new approach to constructing of pseudo-random binary sequences (PRS) generators for the purpose of cryptographic data protection, secured from the perpetrator's attacks, caused by generation of masses of hardware errors and faults. The new method is based on use of linear polynomial arithmetic for the realization of systems of boolean characteristic functions of PRS' generators. "Arithmetizatio" of systems of logic formulas has allowed to apply mathematical apparatus of residue systems for multisequencing of the process of PRS generation and organizing control of computing errors, caused by hardware faults. This has guaranteed high security of PRS generator's functioning and, consequently, security of tools for cryptographic data protection based on those PRSs.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Secure Generators of q-valued Pseudo-Random Sequences on Arithmetic Polynomials

A technique for controlling errors in the functioning of nodes for the formation of $q$-valued pseudo-random sequences (PRS) operating under both random errors and errors generated through intentional attack by an attacker is provided, in which systems of characteristic equations are realized by arithmetic polynomials that allow the calculation process to be parallelized and, in turn, allow the use of redundant modular codes device.

2018-09-07cs.CR

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation

In several settings of practical interest, two parties seek to collaboratively perform inference on their private data using a public machine learning model. For instance, several hospitals might wish to share patient medical records for enhanced diagnostics and disease prediction, but may not be able to share data in the clear because of privacy concerns. In this work, we propose an actively secure protocol for outsourcing secure and private machine learning computations. Recent works on the problem have mainly focused on passively secure protocols, whose security holds against passive (`semi…

2018-12-04cs.CR

ReDASH：用于安全外包推理的算术乱码电路中的快速高效缩放

ReDASH: Fast and efficient Scaling in Arithmetic Garbled Circuits for Secure Outsourced Inference

本研究提出ReDASH框架，通过基于剩余数系统广义基扩展的乱码缩放组件与ScaleQuant+量化机制，突破Dash仅能2的幂缩放的限制，实现最高33倍推理加速且保留强安全保证，提升乱码卷积神经网络安全外包推理的实用性与灵活性。

2025-06-17cs.CR

基于FSM的安全算术码

Secure FSM- based arithmetic codes

近年来，算术编码因其高压缩性能而引起了众多学者的关注。因此，在本文中，提出了一种方法，它增加了这个众所周知的源代码的保密性。有限状态算术码（FSAC）被用作源代码以增加安全性。利用其有限状态机（FSM）特性，在信源编码过程中插入随机跳变。此外，为每个状态设计了霍夫曼码，即使在跳跃中也可以解码。霍夫曼码是一种无前缀码，当授权用户使用正确的对称伪随机密钥进行解码时，霍夫曼码可以帮助用户跟踪正确的状态。我们提出的方案的鲁棒性进一步加强了通过交换在每个状态下的霍夫曼码的输出增加另一个额外的不确定性。几个测试图像用于检查建议的霍夫曼有限状态算术编码（HFSAC）的有效性。实验结果、密钥空间分析、统计分析、密钥敏感性和明文敏感性测试表明，HFSAC算法对图像加密系统的压缩效率影响很小，为实时图像加密和传输提供了一种高效、安全的方法。

2012-06-05cs.CR

无诚实多数的安全算术计算

Secure Arithmetic Computation with No Honest Majority

我们研究了有限环上安全评估算术电路的复杂性。这个问题的动机是自然的安全计算任务。我们的主要目标是：（1）只对环操作和标准密码原语进行黑箱调用，（2）最小化此类黑箱调用的数量以及通信开销。我们提出了几种解决方案，其不同的效率，一般性和潜在的棘手的假设。这些措施包括：1. OT-混合模型中的无条件安全协议，其使用任意环$R$的黑盒，但是其中环操作的数量随着$\log|R|$（上界）线性增长。2. OT-混合模型中的计算安全协议，该模型使用底层环的黑盒，并且其中环操作的数量不随环的大小而增长。这些结果扩展了Naor和Pinkas用于安全多项式评估的先前方法（SIAM J. Comput.，35（5），2006）。3.环$\mathbb{Z}_m=\mathbb{Z}/m\mathbb{Z}$的一种协议，它只使用同态加密方案的黑盒。当$m$是素数时，电路的每个门对加密方案的调用（分摊）次数是恒定的。事实上，我们所有的协议在OT混合模型中都是UC安全的，并且可以推广到具有任意数量恶意方的多方计算。

2008-11-08cs.CCcs.CR

Efficient and secure modular operations using the Adapted Modular Number System

The Adapted Modular Number System (AMNS) is a sytem of representation of integers to speed up arithmetic operations modulo a prime p. Such a system can be defined by a tuple (p, n, γ, ρ, E) where E is in Z[X]. In [13] conditions are given to build AMNS with E(X) = {X^n +1}. In this paper, we generalize their results and show how to generate multiple AMNS for a given prime p with E(X)={X^n-λ} and λ in Z. Moreover, we propose a complete set of algorithms without conditional branching to perform arithmetic and conversion operations in the AMNS, using a Montgomery-like method described in [15].

2019-01-31cs.CR

更多相关论文收起更多论文

安全视频组播的混沌算术编码

Chaotic Arithmetic Coding for Secure Video Multicast

算术编码（AC）广泛用于文本和视频数据的熵编码。它涉及根据输入符号出现的相对概率递归划分范围[0，1）。混沌算术编码（CAC）是一种基于算术编码的数据（图像或视频）加密方案。在CAC中，可以使用大量的混沌映射来执行编码，每个混沌映射都可以实现香农最优压缩性能。映射的确切选择由一个键控制。CAC具有对间隔进行加扰而不对码字必须位于其中的间隔的宽度进行任何改变的效果，从而允许加密而不牺牲任何编码效率。在本文中，我们使用了一个冗余的CAC过程中的安全多播的视频，多个用户被分配不同的密钥来解码相同的加密文件。通过加密一次，我们可以生成多个密钥，其中任何一个都可以用于解密编码文件。这非常适合于通过互联网的视频分发，其中单个视频可以以隐私保护的方式分发给多个客户端。

2013-11-13cs.CRcs.ITcs.MM

Parallel generator of $q$-valued pseudorandom sequences based on arithmetic polynomials

A new method for parallel generation of $q$-valued pseudorandom sequence based on the presentation of systems generating logical formulae by means of arithmetic polynomials is proposed. Fragment consisting of $k$-elements of $q$-valued pseudorandom sequence may be obtained by means of single calculation of a single recursion numerical formula. It is mentioned that the method of the "arithmetization" of generation may be used and further developed in order to protect the encryption gears from cryptographic onset, resulting in the initiating of mass hardware failures. The achieved results may be…

2014-09-02cs.CR

无安全信道的数据聚合：如何评估多元多项式密钥

Data Aggregation without Secure Channel: How to Evaluate a Multivariate Polynomial Securely

已经进行了许多研究，以安全地将多方的数据聚合外包给不可信的聚合器而不公开每个人的数据，或者使多方能够在保护隐私的同时联合聚合他们的数据。然而，这些工作要么假设具有安全信道，要么遭受高复杂度。在这里，我们考虑外部聚合器或多方如何学习一些代数统计（例如，求和、乘积），而任何个人的输入数据对其他人（聚合器和其他参与者）保密。我们假设在我们的建设渠道是不安全的。也就是说，所有信道都受到窃听攻击，并且整个聚合中的所有通信都对其他人开放。我们成功地保证数据的机密性，在这个弱的假设下，同时限制通信和计算的复杂性，最多线性。

2013-04-11cs.CR

A novel reversible data hiding in encrypted images based on polynomial arithmetic

Reversible data hiding in encrypted images is an effective technology for data hiding and protecting image privacy. Although there are many high-capacity methods have been presented in recent year, most of them need a pre-processing phase to reserve room in the original image before encryption. It may be unpractical, because the image provider has to analyze the content of the image and accomplish additional operations. In this paper, we propose a new robust vacate room after encryption schema based on polynomial arithmetic, which achieves a high embedding capacity with the perfect recovery of…

2021-12-18cs.CR

FMPC: Secure Multiparty Computation from Fourier Series and Parseval's Identity

FMPC is a novel multiparty computation protocol of arithmetic circuits based on secret-sharing, capable of computing multiplication of secrets with no online communication; it thus enjoys constant online communication latency in the size of the circuit. FMPC is based on the application of Fourier series to Parseval's identity, and introduces the first generalization of Parseval's identity for Fourier series applicable to an arbitrary number of inputs. FMPC operates in a setting where users wish to compute a function over some secret inputs by submitting the computation to a set of nodes, but i…

2019-12-05cs.CR

浮点算术下的安全多方计算

Secure multiparty computations in floating-point arithmetic

本文证明仅用标准浮点算术即可实现隐私保护机器学习的安全多方计算，其信息泄露小于舍入误差且具备最坏情况界与数值稳定性证明，并在多种广义线性模型上验证了高性能。

2020-01-09cs.CRcs.ITcs.LG

递归双倍大小固定精度算术

Recursive double-size fixed precision arithmetic

这项工作是SHIVA（安全硬件免疫通用架构）项目的一部分，其目的是提供一个可编程和可重构的硬件模块具有高水平的安全性。我们提出了一个递归的两倍大小的固定精度算法称为RecInt。我们的工作可以分为两部分。首先，我们开发了一个C++软件库，其性能与GMP软件库相当。其次，我们简单的整数表示允许在FPGA上实现。我们的想法是考虑2的幂的大小，并应用加倍技术来有效地实现它们：我们设计了一个递归的数据结构，其中大小为2^k（k> k 0）的整数可以存储为两个大小为2^{k-1}的整数。显然，当k<= k 0时，我们使用机器算法（k 0取决于体系结构）。

2011-04-04cs.CR

使用全同态加密的安全数值模拟

Secure numerical simulations using fully homomorphic encryption

本文基于CKKS全同态加密方案和两个Julia软件包，探索并验证了在加密数据上求解偏微分方程的隐私保护数值模拟可行性，同时分析了计算开销、数值误差及算法限制。

2025-09-24cs.CRcs.NAmath.NA