Results 21 to 30 of about 2,689 (221)
Quantum and classical oblivious transfer: A comparative analysis
IET Quantum Communication, 2021 Secure multiparty computation has the potential to be a disruptive technique in the realm of data analysis and computation. It enables several parties to compute virtually any function while preserving the privacy of their inputs.
Manuel B. Santos +2 more
doaj +1 more source
Information-Theoretically Secure String Commitments Based on Packet Reordering Channels
IEEE Access, 2021 Realizing fundamental cryptographic primitives with unconditional security is a central topic in information-theoretic cryptography. These primitives can be realized based on physical assumptions, such as the existence of noisy channels, an upper bound ...
Vinicius de Morais Alves +3 more
doaj +1 more source
FATE Federated Transfer Learning Scheme Based on Oblivious Transfer Protocol [PDF]
Jisuanji gongcheng, 2023 Machine learning models can be trained on a large amount of data collected from different sources, thereby improving the prediction accuracy.However, data collection between different organizations causes privacy issues.
ZHENG Yuntao, YE Jiawei
doaj +1 more source
All-or-nothing oblivious transfer based on the quantum one-way function
Frontiers in Physics, 2022 Oblivious transfer (OT) is one of the keystones of secure multi-party computation. It is generally believed that unconditionally secure OT is impossible.
Ping Wang +4 more
doaj +1 more source
Unconditionally Secure Oblivious Transfer Based on Channel Delays [PDF]
, 2011 Without the use of computational assumptions, unconditionally secure oblivious transfer (OT) is impossible in the standard model where the parties are using a clear channel. Such impossibilities can be overcome by using a noisy channel.
Atsuko Miyaji +3 more
core +1 more source
Quantum Universally Composable Oblivious Linear Evaluation [PDF]
QuantumOblivious linear evaluation is a generalization of oblivious transfer, whereby two distrustful parties obliviously compute a linear function, $f (x) = ax + b$, i.e., each one provides their inputs that remain unknown to the other, in order to compute the
Manuel B. Santos +2 more
doaj +1 more source
IEEE Transactions on Information Theory, 2017 In this paper, we study the problem of obtaining $1$-of-$2$ string oblivious transfer (OT) between users Alice and Bob, in the presence of a passive eavesdropper Eve. The resource enabling OT in our setup is a noisy broadcast channel from Alice to Bob and Eve.
Manoj Mishra +3 more
openaire +4 more sources
Lightweight Heterogeneous Secure Function Computing Acceleration Framework [PDF]
Jisuanji kexueCurrently,data has become a crucial strategic resource,and data mining and analysis technologies play an important role in various industries.However,there are risks of data leakage in the process of data mining and analysis.Secure function evaluation ...
ZHAO Chuan, HE Zhangzhao, WANG Hao, KONG Fanxing, ZHAO Shengnan, JING Shan
doaj +1 more source
Endemic Oblivious Transfer [PDF]
, 2021 Oblivious Transfer has played a crucial role in the design of secure multi party computation. Nevertheless, there are not many practical solutions that achieve simulation based security and at the same time instantiable based on different assumptions ...
Peter Rindal, Daniel Masny
core
On unconditionally secure distributed oblivious transfer
, 2002 This work is about distributed protocols for oblivious transfer, proposed by Naor and Pinkas, and recently generalized by Blundo et. al. In this settings a Sender has n secrets and a Receiver is interested in one of them.
Vandewalle, J. +5 more
core +3 more sources