Secure Non-interactive Simulation: Feasibility & Rate

Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen

Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen

Stefan Hillmich, Robert Wille

Deepesh Data, Gowtham R. Kurri, Jithin Ravi +1 more

We consider interactive computation of randomized functions between two users with the following privacy requirement: the interaction should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings. We also study perfectly secure non-interactive computation when only one of the users computes a randomized function based on a single transmission from the other user. We characterize randomized functions which can be perfectly securely computed in this model and obtain tight bounds on the optimal message lengths in all the privacy settings.

Tasneem Assaf, Arafat Al‐Dweik, Youssef Iraqi

This paper presents a novel physical layer security (PLS) scheme for non-orthogonal multiple access (NOMA) systems that jointly enhances secrecy and bit error rate (BER). The proposed approach leverages power hopping (PH), wherein users’ power coefficients are dynamically allocated to obscure both the decoding order and actual power allocation from potential eavesdroppers. This uncertainty significantly reduces the feasibility of successful interception. Analytical expressions for the BER and secrecy outage probability (SOP) are derived under diverse channel conditions and eavesdropping scenarios. The theoretical findings, validated through Monte Carlo simulations, confirm that the proposed scheme robustly preserves the secrecy of legitimate users regardless of the eavesdropper’s channel quality. Moreover, the approach yields substantial improvements in both BER and SOP, particularly for the near user.

Sebastian Philipp Neumann, Siddarth Koduru Joshi, Matthias Fink +8 more

Satellites are the most efficient way to achieve global scale quantum communication (Q.Com) because unavoidable losses restrict fiber based Q.Com to a few hundred kilometers. We demonstrate the feasibility of establishing a Q.Com uplink with a 3U CubeSat, measuring only 10 × 10 × 34 cm 3 , using commercial off-the-shelf components, the majority of which have space heritage. We demonstrate how to leverage the latest advancements in nano-satellite body-pointing to show that our 4 kg CubeSat can generate a quantum-secure key, which has so far only been shown by a much larger 600 kg satellite mission. A comprehensive link budget and simulation was performed to calculate the secure key rates. We discuss design choices and trade-offs to maximize the key rate while minimizing the cost and development needed. Our detailed design and feasibility study can be readily used as a template for global scale Q.Com.