scholarly journals Threshold Secret Sharing Transmission against Passive Eavesdropping in MIMO Wireless Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-7
Author(s):  
Jungho Myung ◽  
Keunyoung Kim ◽  
Taehong Kim
Keyword(s):  
Wireless Networks ◽  
Secret Sharing ◽  
Symbol Error Rate ◽  
Base Station ◽  
Secret Data ◽  
Threshold Secret Sharing ◽  
Legitimate User ◽  
Multiple Input ◽  
Spatial Dimensions ◽  
The Difference

We propose a threshold secret sharing scheme for secure communications in multiple input and multiple output wireless networks. In the proposed scheme, the base station divides the secret data into Nmin parts using a polynomial of degree T-1  (T≤Nmin) and transmits the divided data to the legitimate user by beamforming with multiple spatial dimensions. Then, at the user, the secret data can be reconstructed with a sufficient number (≥T) of divided parts by using the Lagrange interpolating polynomial. However, it is difficult for the eavesdropper to correctly estimate the T parts due to the difference between the main channel with beamforming and the eavesdropping channel in the physical layer, which results in the failure of secret data reconstruction. The numerical results show that the eavesdropping probability of the proposed scheme is lower than those of conventional schemes. Moreover, we analyze the symbol-error-rate and show that the theoretical result is well aligned with simulation results.

scholarly journals Capacity Analysis and Linear Detection in Massive MIMO for 5G Wireless Systems

2019 ◽  
Vol 8 (9) ◽  
pp. 2938-2943
Keyword(s):  
Massive Mimo ◽  
Multiple Input Multiple Output ◽  
Symbol Error Rate ◽  
Base Station ◽  
Matlab Simulation ◽  
Maximum Ratio Combining ◽  
Single Antenna ◽  
Air Interface ◽  
Multiple Input ◽  
Input Multiple Output

Multiple Input Multiple Output (MIMO) is an attractive air interface solution which is used in the 4 th generation wireless networks to achieve higher data rate. With a very large antenna array in Massive MIMO the capacity will increase drastically. In this paper channel capacity comparison for MIMO using known Channel State Information (CSI) and unknown CSI has been carried out for a higher number of antennas at transmitter and receiver side. It has shown that at lower SNR known CSI will give better performance compared to unknown CSI. At higher SNR known CSI and unknown CSI will provide similar results. Capacity comparison has been evaluated with help of MATLAB for known CSI and unknown CSI from a small number of antennas to hundred of antennas. Also, the performance evaluated with MATLAB simulation of linear detectors zero-forcing (ZF) and maximum ratio combining (MRC) method for large number of antennas at Base station (BS) which are serving a small number of single antenna users. Performance is evaluated in terms of Symbol Error Rate (SER) for ZF and MRC, and results show that ZF will outperform MRC. It has also been analyzed that increasing the antennas at BS for a small number of users will also help to reduce SER.

A companding approach for PAPR suppression in OFDM based massive MIMO system

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Ajay Kumar Yadav ◽  
Pritam Keshari Sahoo ◽  
Yogendra Kumar Prajapati
Keyword(s):  
Massive Mimo ◽  
Orthogonal Frequency Division Multiplexing ◽  
Mimo System ◽  
Multiple Input Multiple Output ◽  
Average Power ◽  
Base Station ◽  
Convex Optimization Problem ◽  
Multiple Input ◽  
Input Multiple Output ◽  
Mimo Ofdm

Abstract Orthogonal frequency division multiplexing (OFDM) based massive multiuser (MU) multiple input multiple output (MIMO) system is popularly known as high peak-to-average power ratio (PAPR) issue. The OFDM-based massive MIMO system exhibits large number of antennas at Base Station (BS) due to the use of large number of high-power amplifiers (HPA). High PAPR causes HPAs to work in a nonlinear region, and hardware cost of nonlinear HPAs are very high and also power inefficient. Hence, to tackle this problem, this manuscript suggests a novel scheme based on the joint MU precoding and PAPR minimization (PP) expressed as a convex optimization problem solved by steepest gradient descent (GD) with μ-law companding approach. Therefore, we develop a new scheme mentioned to as MU-PP-GDs with μ-law companding to minimize PAPR by compressing and enlarging of massive MIMO OFDM signals simultaneously. At CCDF = 10−3, the proposed scheme (MU-PP-GDs with μ-law companding for Iterations = 100) minimizes the PAPR to 3.70 dB which is better than that of MU-PP-GDs, (iteration = 100) as shown in simulation results.

(t,k,n) Multi-Blind Proxy Signature Scheme on Elliptic Curve

2011 ◽  
Vol 130-134 ◽  
pp. 291-294
Author(s):  
Guang Liang Liu ◽  
Sheng Xian Xie ◽  
Wei Fu
Keyword(s):  
Elliptic Curve ◽  
Secret Sharing ◽  
Proxy Signature ◽  
Elliptic Curve Cryptosystem ◽  
Secret Sharing Scheme ◽  
Signature Scheme ◽  
Forgery Attack ◽  
Threshold Secret Sharing ◽  
Sharing Scheme ◽  
Security Properties

On the elliptic curve cryptosystem proposed a new multi-proxy signature scheme - (t, k, n) threshold blind proxy signature scheme.In new program blind proxy signature and (t,k,n) threshold secret sharing scheme will be combined, and will not over-concentration of the rights of the blind proxy signer .Computation of the program is small, security is high, the achieve efficiency and the utility is better .can prevent a malicious user's forgery attack and have the security properties of proxy signature.

Threshold Secret Sharing Through Multivariate Birkhoff Interpolation

2015 ◽  
pp. 331-350
Author(s):  
Vasileios E. Markoutis ◽  
Gerasimos C. Meletiou ◽  
Aphrodite N. Veneti ◽  
Michael N. Vrahatis
Keyword(s):  
Secret Sharing ◽  
Birkhoff Interpolation ◽  
Threshold Secret Sharing
Sign in / Sign up

Export Citation Format

Share Document