Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a nonstandard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (geometry of numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.     

Secret-Sharing for NP

A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a “qualified” subset of parties can efficiently reconstruct the secret while any “unqualified” subset of parties cannot efficiently learn anything about the secret. The collection of “qualified” subsets is defined by a monotone Boolean function. It has been a major open problem to understand which (monotone) functions can be realized by a computational secret-sharing scheme. Yao suggested a method for secret-sharing for any function that has a polynomial-size monotone circuit (a class which is strictly smaller than the class of monotone functions in \({\mathsf {P}}\)). Around 1990 Rudich raised the possibility of obtaining secret-sharing for all monotone functions in \({\mathsf {NP}}\): in order to reconstruct the secret a set of parties must be “qualified” and provide a witness attesting to this fact. Recently, Garg et al. (Symposium on theory of computing conference, STOC, pp 467–476, 2013) put forward the concept of witness encryption, where the goal is to encrypt a message relative to a statement \(x\in L\) for a language \(L\in {\mathsf {NP}}\) such that anyone holding a witness to the statement can decrypt the message; however, if \(x\notin L\), then it is computationally hard to decrypt. Garg et al. showed how to construct several cryptographic primitives from witness encryption and gave a candidate construction. One can show that computational secret-sharing implies witness encryption for the same language. Our main result is the converse: we give a construction of a computational secret-sharing scheme for any monotone function in \({\mathsf {NP}}\) assuming witness encryption for \({\mathsf {NP}}\) and one-way functions. As a consequence we get a completeness theorem for secret-sharing: computational secret-sharing scheme for any single monotone \({\mathsf {NP}}\)-complete function implies a computational secret-sharing scheme for every monotone function in \({\mathsf {NP}}\).     

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries. Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp-Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.     

基于多层次可验证共享协议的密钥托管方案

本文基于ＥｌＧａｍａｌ公钥体制和多层次可验证共享方案,提出了一个多层次密钥托管方案,它不有效地克服了“公平公钥密码系统”中易受阈下信道攻击的缺点,而且能饲文献「１」中监听机权力过大的现象。     

WLAN漫游改进方案

WLAN只是解决了网络接入,并没有实现网络漫游,而漫游对拓宽WLAN的应用领域非常重要.介绍了WLAN漫游的相关背景,详细分析了现有的WLAN漫游技术并指出其优点与不足之处,在此基础上提出了一种可行的解决方案.     

Optimization Schemes for Protective Jamming

In this paper, we study strategies for allocating and managing friendly jammers, so as to create virtual barriers that would prevent hostile eavesdroppers from tapping sensitive wireless communication. Our scheme precludes the use of any encryption technique. Applications include domains such as (i) protecting the privacy of storage locations where RFID tags are used for item identification, (ii) secure reading of RFID tags embedded in credit cards, (iii) protecting data transmitted through wireless networks, sensor networks, etc. By carefully managing jammers to produce noise, we show how to reduce the SINR of eavesdroppers to below a threshold for successful reception, without jeopardizing network performance. In this paper, we present algorithms targeted towards optimizing power consumption and number of jammers needed in several settings. Experimental simulations back up our results.     

Transmit Diversity Schemes for WCDMA

Previous work on transmitter antenna diversity has shown that the use of multiple transmitter antennas at the base station results in improved performance due to increase of diversity (path diversity). This happens with no bandwidth cost, even when the signal quality along several paths is poor, but the receiver estimates the channel with accuracy. This paper evaluates the effects of channel estimation errors in the performance of the schemes designated as Space-Time Transmitter Diversity (STTD) and Selective Transmitter Diversity (STD). We consider low to medium signal to noise ratios characteristic of Wideband Code Division Multiple Access (WCDMA) networks. Different fading channel models are considered for comparison between the two schemes. The improvement due to convolutional coding associated with these techniques is also evaluated.     

Multi-Rate Access Schemes for MC-CDMA

In order to accommodate different types of traffic in future wirelesscommunications, it is necessary to consider a system, which can operatesatisfactorily at multiple transmission rates. Due to its capability to copewith the hostile frequency selective fading, that limits transmission rate,and its suitability to handle multi-rate data, multi-carrier CDMA (MC-CDMA)has recently drawn considerable attention as a suitable candidate forsupporting multimedia services in wireless communications. Multi-rate accessschemes where users are able to transmit at different data rates on MC-CDMAsystems are presented in this paper. Four multi-rate access schemes: uncodedfixed spreading length (UFSL), coded fixed spreading length (CFSL), multi-codefixed spreading length (MFSL) and variable spreading length (VSL) schemes areproposed. With these schemes, different traffic such as voice, video and highrate data can be transmitted seamlessly through one MC-CDMA infrastructure.A chip-level minimum mean square error combining (MMSEC) technique is employedfor joint energy combining and interference cancellation purpose. Theperformance of these schemes with MMSEC is compared by both theoreticalderivations and simulation results under frequency selective Rayleigh fadingchannels.     

Strategies for Dense Optical CDMA Communication Systems

1　Introduction　Recently, considerable interest has been focused on Opti cal Code Division Multiple Access (OCDMA)[1~15], be cause of the advantages of flexible bandwidth management,asynchronous access, and the potential network scalabilityetc. In an OCDMA system, many users can simultaneouslyshare the same channel through the allocation of specific ad dress codes. All users signals are transmitted by the sameoptical fiber channel. At the receiver end, the matched de coder can re…     

ASAF ALOHA Protocol for Dense RFID Systems

RFID tags are used for varied applications in large numbers. Human Tracking is one such important application wherein the RFID system detects the presence of a tag in a dense tag environment. Quick estimation of the number of tags in the field at a desired level of accuracy is one of the most common requirements in the present scenario. Identification of tags has become a critical area which need more time and unsuitable in many situations; especially where tag set is dense. We introduce a novel medium access control (MAC) protocol for Radio Frequency IDentification (RFID) systems which exploits the statistical information collected at the reader. The protocol, termed Adaptive Slot Adaptive Frame (ASAF) ALOHA protocol, is motivated to significantly improve the total read time performance of the currently suggested MAC protocols for RFID systems by minimizing the collisions of the tags. In order to perform this task, ASAF estimates the dynamic tag population and adapts the frame size and number of slots simultaneously in the subsequent round via a simple policy that maximizes an appropriately defined function. We demonstrated that ASAF is better than the current RFID MAC protocols. We also considered the case where suddenly if the number of tags increases, the running frame with adapted slots gets flushed away and new frame with increased number of slots gets adapted automatically by the system showing the robustness in this case as well.     

Demodulation Procedure for Very Wide-Band FM

Since conventional FM demodulators are incapable of accurately demodulating very wide-band frequency-modulated signals, a new approach to the problem is needed. Based upon a theorem by Sandberg, a practical procedure is presented for demodulating not only typical FM signals but also those employing modulation bandwidths and/or frequency deviations on the order of the cartier frequency. The proposed demodulator utilizes an iterative recovery procedure. The first iteration is analogous to demodulation by a conventional zero crossing discriminator and results in severe distortion of the modulation under wide-band conditions. This distortion is reduced by successive iterations. Because, in practice, the iterative process is truncated after a finite number of terms, a procedure for computing the coefficients of these terms for minimum mean-squared error is given. Using computer simulation, the demodulation technique is demonstrated to work effectively for several very wide-band FM signals.     

浅谈直流电源割接方案

结合四川电信公司正在进行机房整治的实际，主要介绍几种直流电源的割接方法和割接时应注意的事项，以供参考。     

Coding Schemes for Crisscross Error Patterns

This paper addresses two coding schemes which can handle emerging errors with crisscross patterns. First, a code with maximum rank distance, so-called Rank-Codes, is described and a modified Berlekamp–Massey algorithm is provided. Secondly, a Permutation Code based coding scheme for crisscross error patterns is presented. The influence of different types of noise are also discussed.

Very small MOSFET's for low-temperature operation

The improvements in the device characteristics of n-channel MOSFET's that occur at low temperatures are considered in this paper. The device parameters for polysilicon gate FET's with channel lengths of the order of 1 µm have been studied both experimentally and theoretically at temperatures ranging from room temperature down to liquid nitrogen temperature. Excellent agreement was found between the experimental dc device characteristics and those predicted by a two-dimensional current transport model, indicating that device behavior is well understood and predictable over this entire temperature range. A device design is presented for an enhancement mode FET with a channel length of I µm that is suitable for operation at liquid nitrogen temperature.     

Carrier Synchronization for Very Low SNR

The Turbo decoding performance will suffer serious degradation under low signal-to-noise ratios (SNR) conditions for the reason of residual frequency and phase offset in the carrier. In this paper, an improved residual carrier frequency offset estimation algorithm based on u priori probability aided (APPA) phase estimation is proposed. A carrier synchronization loop that combines the iterative turbo decoder and the phase estimator together is constructed, where the extrinsic information obtained from the Turbo decoder is used to aid an iterative phase estimation process. The simulation results show that the algorithm performs successfully under very low SNR conditions (for example, less than -7.4 dB) with large frequency offset and phase error and the performance of this algorithm is very close to the optimally synchronized system.     

Schemes for slot reuse in CRMA

Several schemes for slot reuse in CRMA are studied. A major challenge in CRMA is to incorporate slot reuse together with continuous message transmissions, i.e., to ensure that every message is transmitted in a stream of contiguous slots on the bus. Schemes based on the ideas of erasure nodes and destination release are developed and simulation results are presented     

选择重传ARQ重排序方法研究

分析了现有的重排序机制,提出了基于PFR方案的分级PFR方案H—PFR,通过保存正确的重排序数据帧,在进行TCP超时重传时,能立刻在本地完成正确排序的数据帧向高层的转发,缩短了延迟时间,节省了信道资源,提高了无线TCP的传输性能。     

Loading Schemes for Downlink OFDMA Systems

In this paper we study the subcarrier and bit allocation strategies for downlink OFDMA system.Our opti-mization objective is to find optimum subcarrier and bit assignment minimizing the total transmitted power with the con-straints on BER and data rate for all users.We divide this problem into three steps:resource allocation,subcarrier assign-ment and single-user power and bit allocation.For the first two steps we propose new algorithms.Various loading schemesconstitute by combining these algorithms as well as algorithms proposed in Ref.[6].Simulation results demonstrate thatour proposed suboptimal loading scheme can achieve performance closer to the near optimal algorithm in Ref.[8]withmuch lower complexity than schemes in Ref.[6].     

On Loss Differentiation for CSMA-Based Dense Wireless Network

In this paper, we propose a novel method to differentiate packet loss based on interference energy and timing relative to desired signal in CSMA-based dense wireless networks. All measurements are conducted locally at transmitters without any additional over-the-air overhead. Our method can estimate PER (packet error rate) due to interference prior to or after the beginning of the desired signal separately, allowing for more efficient MAC(media access control) adaptation design.     

面向密集城区网络的覆盖预测模型的应用研究

在目前密集城区CDMA无线网络日趋复杂的情况下,如何使覆盖预测与网络实际充分拟合,发挥射频仿真工具在网络优化中的作用,是一个十分值得探讨的课题.本文从密集城区的CDMA无线网络入手,分别选取了统计型模型的Okumura-Hata模型和确定性模型的3D射线跟踪模型进行研究,分析了两种模型在密集城区场景下的差异,最终在实践的基础上提出了面向密集城区的覆盖预测模型的选取方案.