arXiv 1809.024522018-09-07cs.CR

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

Oleg Finko, Sergey Dichenko, Dmitry Samoylenko

备注：: 21ST INTERNATIONAL MULTI-CONFERENCE ON ADVANCED COMPUTER SYSTEMS ACS 2018 (Międzyzdroje, Poland, September 24-26, 2018)

英文摘要：

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.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

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

基于算术多项式的安全伪随机线性二进制序列发生器

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

我们提出了一种新的方法来构建伪随机二进制序列（PRS）生成器的加密数据保护的目的，从犯罪者的攻击，所造成的大量的硬件错误和故障的产生。新方法是基于使用线性多项式算法实现PRS生成器的布尔特征函数系统。逻辑公式系统的“算术化”允许应用剩余系统的数学装置来对PRS生成过程进行多序列化，并对由硬件故障引起的计算错误进行组织控制。这保证了PRS生成器功能的高度安全性，从而保证了基于这些PRS的加密数据保护工具的安全性。

2014-09-08cs.CR

基于FSM的安全算术码

Secure FSM- based arithmetic codes

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

2012-06-05cs.CR

基于算术多项式的$q$值伪随机序列并行生成器

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

基于算术多项式逻辑公式生成系统的表示，提出了一种并行生成$q$值伪随机序列的新方法。由$q$-值伪随机序列的$k$-元素组成的片段可以通过单个递归数值公式的单个计算来获得。提到的是，可以使用并进一步开发生成的“算术化”的方法，以保护加密齿轮免受密码攻击，从而导致大规模硬件故障的启动。所取得的成果可广泛应用于实现具有前景的高性能信息保护密码设施。

2014-09-02cs.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

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

Lightweight Joint Compression-Encryption-Authentication-Integrity Framework Based on Arithmetic Coding

Arithmetic Coding is an efficient lossless compression scheme applied for many multimedia standards such as JPEG, JPEG2000, H.263, H.264 and H.265. Due to nonlinearity, high error propagation and high error sensitivity of arithmetic coders, many techniques have been developed for extending the usage of arithmetic coders for security as a lightweight joint compression and encryption solution for systems with limited resources. Through this paper, we will describe how to upgrade these techniques to achieve an additional low cost authentication and integrity capabilities with arithmetic coders. C…

2018-04-12cs.CR

实值类伪随机酉算子

Real-Valued Somewhat-Pseudorandom Unitaries

本研究针对实值酉算子无法完全伪随机的问题，提出两种简洁的酉算子分布构造，证明其在特定输入下具备类伪随机特性，并给出基于量子安全单向函数的高效密码学实现。

2024-04-16cs.CRquant-ph

Secure Error Correction using Multi-Party Computation

During recent years with the increase of data and data analysis needs, privacy preserving data analysis methods have become of great importance. Researchers have proposed different methods for this purpose. Secure multi-party computation is one of such techniques that allows a group of parties to evaluate a function on their data without revealing the data. This is done by secret sharing approach, in which parties share a piece of their data using polynomials and after doing function evaluation on shares of data finally they do a Lagrange interpolation to get the result. Two approaches have be…

2019-05-12cs.CR

一次性密码本、算术编码和逻辑门：使用动态系统的统一主题

One-Time Pad, Arithmetic Coding and Logic Gates: An unifying theme using Dynamical Systems

本文证明了完全安全的一次性密码（One-Time Pad，OTP）加密可以看作是在基于完全随机密码的随机开关下，在二进制映射上寻找初始条件。这是Grangetto在二进制映射上进行的随机算术编码的一个特例。此外，我们使用这种方法推导出一组可能的完美保密系统。由于OTP加密是XOR运算，因此我们有XOR门的动态系统实现。我们展示了其他门的类似实现，如NOR，NAND，OR，XNOR，AND和NOT。动力系统框架统一了香农做出基础性贡献的三个领域：无损压缩（源代码），完美加密（密码学）和逻辑门设计（计算）。

2008-03-01cs.CRnlin.CD

High-speed Privacy Amplification Scheme using GMP in Quantum Key Distribution

Privacy amplification (PA) is the art of distilling a highly secret key from a partially secure string by public discussion. It is a vital procedure in quantum key distribution (QKD) to produce a theoretically unconditional secure key. The throughput of PA has become a bottleneck of the high-speed discrete variable QKD (DV-QKD) system. In this paper, a high-speed modular arithmetic hash PA scheme with GNU multiple precision (GMP) arithmetic library is presented. This scheme is implemented on two different central processing unit (CPU) platforms. The experimental results demon-strate that the t…

2019-12-26cs.CRquant-ph

Towards Secure and Practical Machine Learning via Secret Sharing and Random Permutation

College of Computer Science and Technology, Zhejiang University（浙江大学计算机科学与技术学院）；JZTData Technology（JZTData科技公司 (JZTData Technology)）

With the increasing demands for privacy protection, privacy-preserving machine learning has been drawing much attention in both academia and industry. However, most existing methods have their limitations in practical applications. On the one hand, although most cryptographic methods are provable secure, they bring heavy computation and communication. On the other hand, the security of many relatively efficient private methods (e.g., federated learning and split learning) is being questioned, since they are non-provable secure. Inspired by previous work on privacy-preserving machine learning, …

2022-02-21cs.CRcs.LG

Performance Evaluation of Secure Multi-party Computation on Heterogeneous Nodes

Secure multi-party computation (MPC) is a broad cryptographic concept that can be adopted for privacy-preserving computation. With MPC, a number of parties can collaboratively compute a function, without revealing the actual input or output of the plaintext to others. The applications of MPC range from privacy-preserving voting, arithmetic calculation, and large-scale data analysis. From the system perspective, each party in MPC can run on one compute node. The compute nodes of multiple parties could be either homogeneous or heterogeneous; however, the distributed workloads from the MPC protoc…

2020-04-23cs.CRcs.DCcs.PF

OD-Stega: 基于LLM的相对安全隐写术通过优化分布

OD-Stega: LLM-Based Relatively Secure Steganography via Optimized Distributions

Department of Electrical and Computer Engineering, Texas A&M University（电气与计算机工程系，德克萨斯A&M大学）；Department of Computer Scicence and Engineering, Texas A&M University（计算机科学与工程系，德克萨斯A&M大学）

OD-Stega通过优化分布提升LLM隐写术的安全性，结合算术编码与词汇截断技术，解决标记化不匹配问题，增强隐写文本的自然性。

2026-01-29cs.AIcs.CLcs.CR