Results 191 to 200 of about 2,689 (221)
Some of the next articles are maybe not open access.
Flexible Quantum Oblivious Transfer
International Journal of Theoretical Physics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Guang Yang, Xiu-Bo Chen, Yang Rui
exaly +3 more sources
On oblivious transfer capacity
2009 IEEE Information Theory Workshop on Networking and Information Theory, 2007The concept of oblivious transfer capacity has been recently introduced by Nascimento and Winter. We give an upper bound to this capacity, both for source and channel models, and prove that it is tight for a class of channels. For other cases, lower bounds are provided.
Rudolf Ahlswede, Imre Csiszár
openaire +1 more source
On the Oblivious-Transfer Capacity of Noisy Resources
IEEE Transactions on Information Theory, 2008 In this paper, we deal with the task of obtaining oblivious transfer (OT) from noisy resources. We characterize which noisy channels/distributions are useful for obtaining OT.
Anderson C A Nascimento, Andreas Winter
exaly +2 more sources
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019
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. In this work, we consider a simulation based security notion that we call endemic security.
Daniel Masny, Peter Rindal
openaire +2 more sources
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. In this work, we consider a simulation based security notion that we call endemic security.
Daniel Masny, Peter Rindal
openaire +2 more sources
Proceedings 41st Annual Symposium on Foundations of Computer Science, 2002
We consider the problem of designing an efficient oblivious transfer (OT) protocol that is provably secure in a concurrent setting, i.e., where many OT sessions may be running concurrently with their messages interleaved arbitrarily. Known OT protocols use zero-knowledge proofs, and no concurrent zero-knowledge proofs are known that use less than a ...
Juan A. Garay 0001, Philip D. MacKenzie
openaire +1 more source
We consider the problem of designing an efficient oblivious transfer (OT) protocol that is provably secure in a concurrent setting, i.e., where many OT sessions may be running concurrently with their messages interleaved arbitrarily. Known OT protocols use zero-knowledge proofs, and no concurrent zero-knowledge proofs are known that use less than a ...
Juan A. Garay 0001, Philip D. MacKenzie
openaire +1 more source
Oblivious Transfers and Privacy Amplification
Journal of Cryptology, 2003One-of-the-two \(k\)-bits string oblivious transfer (OT) is an important cryptographic primitive, and it is already known that string OT may be directly reduced to one-of-two bits OT. In the paper a new approach to the reduction problem is presented.
Gilles Brassard +2 more
openaire +1 more source
Oblivious transfers and intersecting codes
IEEE Transactions on Information Theory, 1996Summary: Assume \({\mathcal A}\) owns \(t\) secret \(k\)-bit strings. She is willing to disclose one of them to \({\mathcal B}\), at his choosing, provided he does not learn anything about the other strings. Conversely, \({\mathcal B}\) does not want \({\mathcal A}\) to learn which secret he chose to learn.
Gilles Brassard +2 more
openaire +3 more sources
Robust non-interactive oblivious transfer
IEEE Communications Letters, 2003 We present a novel scheme of noninteractive m out of n oblivious transfer, which demonstrates significant improvement over the existing schemes in terms of completeness, robustness and flexibility.
Yi Mu, V Varadharajan, Yan−Xia Lin
exaly +1 more source
Oblivious transfer with access control
Proceedings of the 16th ACM conference on Computer and communications security, 2009We present a protocol for anonymous access to a database where the different records have different access control permissions. These permissions could be attributes, roles, or rights that the user needs to have in order to access the record. Our protocol offers maximal security guarantees for both the database and the user, namely (1) only authorized ...
Jan Camenisch +2 more
openaire +3 more sources
2016
Motivated by the goal of improving the concrete efficiency of secure multiparty computation MPC, we study the possibility of implementing an infrastructure for MPC. We propose an infrastructure based on oblivious transfer OT, which would consist of OT channels between some pairs of parties in the network.
Ranjit Kumaresan +2 more
openaire +2 more sources
Motivated by the goal of improving the concrete efficiency of secure multiparty computation MPC, we study the possibility of implementing an infrastructure for MPC. We propose an infrastructure based on oblivious transfer OT, which would consist of OT channels between some pairs of parties in the network.
Ranjit Kumaresan +2 more
openaire +2 more sources