arXiv 1306.62652013-06-26cs.CRcs.ITmath.IT

Towards Secure Two-Party Computation from the Wire-Tap Channel

Hervé Chabanne, Gérard Cohen, Alain Patey

英文摘要：

We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of binary intersecting codes or $q$-ary minimal codes, which are also studied in this paper.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels

A polar coding scheme is introduced in this paper for the wire-tap channel. It is shown that the provided scheme achieves the entire rate-equivocation region for the case of symmetric and degraded wire-tap channel, where the weak notion of secrecy is assumed. For the particular case of binary erasure wire-tap channel, an alternative proof is given. The case of general non-degraded wire-tap channels is also considered.

2010-08-15cs.CRcs.ITmath.IT

Achievable Rates for Two-Way Wire-Tap Channels

We consider two-way wire-tap channels, where two users are communicating with each other in the presence of an eavesdropper, who has access to the communications through a multiple-access channel. We find achievable rates for two different scenarios, the Gaussian two-way wire-tap channel, (GTW-WT), and the binary additive two-way wire-tap channel, (BATW-WT). It is shown that the two-way channels inherently provide a unique advantage for wire-tapped scenarios, as the users know their own transmitted signals and in effect help encrypt the other user's messages, similar to a one-time pad. We comp…

2007-04-23cs.CRcs.ITmath.IT

The Gaussian Multiple Access Wire-Tap Channel

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the signal at the receiver. We define suitable security measures for this multi-access environment. Using codebooks generated randomly according to a Gaussian distribution, achievable secrecy rate regions are identified using superposition coding and TDMA coding schemes. An upper bound for the secrecy sum-rate is derived, and our coding schemes are shown to achiev…

2008-03-31cs.CRcs.ITmath.IT

The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the signal at the receiver. We define a suitable security measure for this multi-access environment. We derive an outer bound for the rate region such that secrecy to some pre-determined degree can be maintained. We also find, using Gaussian codebooks, an achievable such secrecy region. Gaussian codewords are shown to achieve the sum capacity outer bound, and the …

2006-05-06cs.CRcs.ITmath.IT

The Gaussian multiple access wire-tap channel: wireless secrecy and cooperative jamming

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy measures, termed individual and collective, to reflect the confidence in the system for this multi-access environment. We determine achievable rates such that secrecy to some pre-determined degree can be maintained, using Gaussian codebooks. We also find outer bounds for the case when the eavesdropper receives a degraded version of the intended receiver's s…

2007-02-09cs.CRcs.ITmath.IT

Non-Malleable Codes from the Wire-Tap Channel

Recently, Dziembowski et al. introduced the notion of non-malleable codes (NMC), inspired from the notion of non-malleability in cryptography and the work of Gennaro et al. in 2004 on tamper proof security. Informally, when using NMC, if an attacker modifies a codeword, decoding this modified codeword will return either the original message or a completely unrelated value. The definition of NMC is related to a family of modifications authorized to the attacker. In their paper, Dziembowski et al. propose a construction valid for the family of all bit-wise independent functions. In this article,…

2011-05-19cs.CRcs.ITmath.IT

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

The General Gaussian Multiple Access and Two-Way Wire-Tap Channels: Achievable Rates and Cooperative Jamming

The General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT) and the Gaussian Two-Way Wire-Tap Channel (GTW-WT) are considered. In the GGMAC-WT, multiple users communicate with an intended receiver in the presence of an eavesdropper who receives their signals through another GMAC. In the GTW-WT, two users communicate with each other over a common Gaussian channel, with an eavesdropper listening through a GMAC. A secrecy measure that is suitable for this multi-terminal environment is defined, and achievable secrecy rate regions are found for both channels. For both cases, the power allocati…

2008-01-25cs.CRcs.ITmath.IT

Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the intended receiver, but has different channel parameters. We aim to provide perfect secrecy for the transmitters in this multi-access environment. Using Gaussian codebooks, an achievable secrecy region is determined and the power allocation that maximizes the achievable sum-rate is found. Numerical results showing the new rate region are presented. It is shown that…

2006-12-18cs.CRcs.ITmath.IT

Applications of LDPC Codes to the Wiretap Channel

With the advent of quantum key distribution (QKD) systems, perfect (i.e. information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical error-correcting codes for both error correction (for the honest parties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspective, a good model that corresponds to such a setting is the wire tap channel introduced by Wyner in 1975. In this paper, we study fundamental limits and coding methods for wire tap channels. We provide an…

2007-01-29cs.CRcs.ITmath.IT

SDA TAP实验室原型战斗管理系统的数据与决策可追溯性

Data and Decision Traceability for SDA TAP Lab's Prototype Battle Management System

本研究将MITRE和NIST供应链可追溯性制造元框架原则应用于SDA TAP实验室原型战斗管理系统，构建数据与决策的可追溯路径，以实现系统内决策的透明度、问责制和完整性。

2025-02-17cs.CRcs.IR

An Information-Theoretic Analysis of the Security of Communication Systems Employing the Encoding-Encryption Paradigm

This paper proposes a generic approach for providing enhanced security to communication systems which encode their data for reliability before encrypting it through a stream cipher for security. We call this counter-intuitive technique the {\em encoding-encryption} paradigm, and use as motivating example the standard for mobile telephony GSM. The enhanced security is based on a dedicated homophonic or wire-tap channel coding that introduces pure randomness, combined with the randomness of the noise occurring over the communication channel. Security evaluation regarding recovery of the secret k…

2010-08-05cs.CR

二进制信道下的带窃听承诺

Wiretapped Commitment over Binary Channels

该研究提出带窃听承诺问题，以噪声信道为资源构建含窃听者的两方承诺模型，定义带窃听承诺容量，并探究窃听者与通信方共谋的影响，给出两种私有机制下的容量结果。

2024-06-19cs.CRcs.ITmath.IT

Leaky Wires: Information Leakage and Covert Communication Between FPGA Long Wires

Field-Programmable Gate Arrays (FPGAs) are integrated circuits that implement reconfigurable hardware. They are used in modern systems, creating specialized, highly-optimized integrated circuits without the need to design and manufacture dedicated chips. As the capacity of FPGAs grows, it is increasingly common for designers to incorporate implementations of algorithms and protocols from a range of third-party sources. The monolithic nature of FPGAs means that all on-chip circuits, including third party black-box designs, must share common on-chip infrastructure, such as routing resources. In …

2018-03-13cs.CR

Fast and Secure Key Generation with Channel Obfuscation in Slowly Varying Environments

The physical-layer secret key generation has emerged as a promising solution for establishing cryptographic keys by leveraging reciprocal and time-varying wireless channels. However, existing approaches suffer from low key generation rates and vulnerabilities under various attacks in slowly varying environments. We propose a new physical-layer secret key generation approach with channel obfuscation, which improves the dynamic property of channel parameters based on random filtering and random antenna scheduling. Our approach makes one party obfuscate the channel to allow the legitimate party t…

2021-12-04cs.CRcs.ITmath.IT