Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Robust Distributed Multiplication without Interaction

Masayuki Abe

Published Jan 1, 1999• 35 citations
Publisher
DOI
10.1007/3-540-48405-1_9

Related papers

Wasserstein Distributionally Robust Secrecy Rate Maximization for MISO Systems with Multiple Eavesdroppers

Hala Amer, Mahmoud H. Ismail, Mohamed S. Hassan

This paper investigates the problem of secrecy rate maximization in a multiple-input single-output (MISO) system in the presence of multiple passive eavesdroppers with uncertain channel state information (CSI). Unlike conventional robust or stochastic approaches that rely on deterministic uncertainty sets or assumed parametric distributions, we adopt a Wasserstein distributionally robust optimization (DRO) framework to model the uncertainty in the eavesdropper channels. We formulate the secrecy rate maximization problem with artificial noise and derive a tractable semidefinite programming (SDP) reformulation. Simulation results demonstrate that the proposed method improves secrecy reliability compared to non-robust designs and norm-bounded worst-case approaches. In particular, the proposed framework yields superior average secrecy rates, lower outage probabilities, and improved lower-tail performance under eavesdropper CSI uncertainty.

International Conference on Communications, Signal Processing, and their Applications (ICCSPA)•Jun 15, 2026•0 citations

Robust physics from random interactions

David J. Dean

Nuclear Physics A•Feb 1, 2001•3 citations

Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci +1 more

Lecture notes in computer science•Jan 1, 2022•7 citations

Intercept probability-constrained secure MIMO AF relaying with arbitrarily distributed ECSI errors

Jiaxin Yang, Qiang Li, Hao Li +1 more

In this paper, we study the problem of joint multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying and artificial noise (AN) optimization for secure communication between a source-destination pair in the presence of multiple eavesdroppers (eves). The eves' channel state information (ECSI) is subject to arbitrarily distributed random errors. Assuming that only the first and second moments of the ECSI errors are known, we introduce a probabilistically robust design method, which aims to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination while satisfying a set of robust intercept probability constraints. Since the resultant optimization problem is non-convex, we propose a solution approach by resorting to a duality-based method along with the semidefinite relaxation (SDR) technique, where a global optimal solution to our design problem can be found. Our simulation results demonstrate the improved secrecy of the proposed robust relaying design against eavesdropping and its robustness against the channel uncertainties.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2016•1 citation

Multi-Party Cryptographic Key Distribution Protocol over a Public Network Based on a Quick-Response Code

Wen-Kai Yu, Ying Yang, Yaxin Li +2 more

In existing cryptographic key distribution (CKD) protocols based on computational ghost imaging (CGI), the interaction among multiple legitimate users is generally neglected, and the channel noise has a serious impact on the performance. To overcome these shortcomings, we propose a multi-party interactive CKD protocol over a public network, which takes advantage of the cascade ablation of fragment patterns (FPs). The server splits a quick-response (QR) code image into multiple FPs and embeds different "watermark" labels into these FPs. By using a CGI setup, the server will acquire a series of bucket value sequences with respect to different FPs and send them to multiple legitimate users through a public network. The users reconstruct the FPs and determine whether there is an attack in the public channel according to the content of the recovered "watermark" labels, so as to complete the self-authentication. Finally, these users can extract their cryptographic keys by scanning the QR code (the cascade ablation result of FPs) returned by an intermediary. Both simulation and experimental results have verified the feasibility of this protocol. The impacts of different attacks and the noise robustness have also been investigated.

Sensors•May 25, 2022•7 citations

Secure Computation with Constant Communication Overhead Using Multiplication Embeddings

Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen

Lecture notes in computer science•Jan 1, 2018•16 citations
This paper investigates the problem of secrecy rate maximization in a multiple-input single-output (MISO) system in the presence of multiple passive eavesdroppers with uncertain channel state information (CSI). Unlike conventional robust or stochastic approaches that rely on deterministic uncertainty sets or assumed parametric distributions, we adopt a Wasserstein distributionally robust optimization (DRO) framework to model the uncertainty in the eavesdropper channels. We formulate the secrecy rate maximization problem with artificial noise and derive a tractable semidefinite programming (SDP) reformulation. Simulation results demonstrate that the proposed method improves secrecy reliability compared to non-robust designs and norm-bounded worst-case approaches. In particular, the proposed framework yields superior average secrecy rates, lower outage probabilities, and improved lower-tail performance under eavesdropper CSI uncertainty.
In this paper, we study the problem of joint multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying and artificial noise (AN) optimization for secure communication between a source-destination pair in the presence of multiple eavesdroppers (eves). The eves' channel state information (ECSI) is subject to arbitrarily distributed random errors. Assuming that only the first and second moments of the ECSI errors are known, we introduce a probabilistically robust design method, which aims to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination while satisfying a set of robust intercept probability constraints. Since the resultant optimization problem is non-convex, we propose a solution approach by resorting to a duality-based method along with the semidefinite relaxation (SDR) technique, where a global optimal solution to our design problem can be found. Our simulation results demonstrate the improved secrecy of the proposed robust relaying design against eavesdropping and its robustness against the channel uncertainties.
In existing cryptographic key distribution (CKD) protocols based on computational ghost imaging (CGI), the interaction among multiple legitimate users is generally neglected, and the channel noise has a serious impact on the performance. To overcome these shortcomings, we propose a multi-party interactive CKD protocol over a public network, which takes advantage of the cascade ablation of fragment patterns (FPs). The server splits a quick-response (QR) code image into multiple FPs and embeds different "watermark" labels into these FPs. By using a CGI setup, the server will acquire a series of bucket value sequences with respect to different FPs and send them to multiple legitimate users through a public network. The users reconstruct the FPs and determine whether there is an attack in the public channel according to the content of the recovered "watermark" labels, so as to complete the self-authentication. Finally, these users can extract their cryptographic keys by scanning the QR code (the cascade ablation result of FPs) returned by an intermediary. Both simulation and experimental results have verified the feasibility of this protocol. The impacts of different attacks and the noise robustness have also been investigated.