6 problems
- 0 votes0 replies0 views
The conjecture that multi-antenna receivers are harder to attack under shared obfuscation
A single-antenna transmitter obfuscates its transmitted signal with an obfuscation sequence. A multi-antenna receiver has multiple antenna elements, all of which observe the same o…
- 0 votes0 replies1 view
Conjecture on sum-rate maximization with a small degrees-of-freedom margin
In a finite-blocklength secure communication system, let the degrees-of-freedom margin be small compared to the number of legitimate users. The sum-rate tradeoff conjecture. Focusi…
- 0 votes0 replies0 views
The polynomial-time hardness conjecture for GapSVP in dimension
GapSVP hardness conjecture. No polynomial-time algorithm exists for in dimension . Consequently, under this conjecture and the hardnes…
- 0 votes0 replies1 view
The conjecture that GapSVP has no polynomial-time algorithm in dimension
Let be the number of transmit antennas, and let denote the approximate shortest vector problem on lattices of dimension with appr…
- 0 votes0 replies0 views
Exponential convergence of the secrecy-rate gap with feedback bits
Let denote the number of quantized channel-feedback bits, and let the rate gap be the loss in secrecy rate due to quantization for fixed SNR and antenna configuration. Expone…
- 0 votes0 replies0 views
Conjecture that stronger malicious users reduce the secure capacity region
Stronger-security capacity conjecture. Under this stronger security definition, the capacity region is in general smaller than the capacity region derived under the original securi…