Two Quantum Protocols for Oblivious Set-member Decision Problem
نویسندگان
چکیده
منابع مشابه
Two Quantum Protocols for Oblivious Set-member Decision Problem
In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privac...
متن کاملProtocols for Authenticated Oblivious Transfer
Oblivious transfer (OT) is a basic building block in many cryptographic protocols. In this paper, we exploit some well-known authenticated Diffie-Hellman-based key exchange protocols to build three authenticated 1-out-of-2 oblivious transfers. We show that our proposed protocols are secure in the semi-honest model. We also compare our schemes with three similar 1-out-of-2 OT protocols and show ...
متن کاملQuantum oblivious transfer protocols based on EPR states
We describe efficient protocols for quantum oblivious transfer and for one-out-of-two quantum oblivious transfer. These protocols, which can be implemented with present technology, are secure against general attacks as long as the cheater can not store the bit for an arbitrarily long period of time.
متن کاملQuantum oblivious transfer and bit commitment protocols based on two non-orthogonal states coding
Oblivious transfer protocols (R-OT and OT1) are presented based on nonorthogonal states transmission, and the bit commitment protocols on the top of OT1 are constructed. Although these OT protocols are all unconditional secure, the bit commitment protocols based on OT protocols are not secure against attack similar to that presented by no-go theorem.
متن کاملMembership-Oblivious Protocols
Many distributed protocols explicitly depend on membership information, such as the identity or number of sites that are currently part of the system. Given this importance, several mechanisms have been proposed over the past decades to handle membership information, but most of them do not scale well in largeand highlydynamic systems. In this paper we advocate the use of “membership-oblivious”...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2015
ISSN: 2045-2322
DOI: 10.1038/srep15914