8 research outputs found
On the Composability of Statistically Secure Random Oblivious Transfer
We show that random oblivious transfer protocols that are statistically secure according to a definition based on a list of information-theoretical properties are also statistically universally composable. That is, they are simulatable secure with an unlimited adversary, an unlimited simulator, and an unlimited environment machine. Our result implies that several previous oblivious transfer protocols in the literature that were proven secure under weaker, non-composable definitions of security can actually be used in arbitrary statistically secure applications without lowering the security
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a
number of applications, in particular, as an essential building block for
two-party and multi-party computation. We construct a round-optimal (2 rounds)
universally composable (UC) protocol for oblivious transfer secure against
active adaptive adversaries from any OW-CPA secure public-key encryption scheme
with certain properties in the random oracle model (ROM). In terms of
computation, our protocol only requires the generation of a public/secret-key
pair, two encryption operations and one decryption operation, apart from a few
calls to the random oracle. In~terms of communication, our protocol only
requires the transfer of one public-key, two ciphertexts, and three binary
strings of roughly the same size as the message. Next, we show how to
instantiate our construction under the low noise LPN, McEliece, QC-MDPC, LWE,
and CDH assumptions. Our instantiations based on the low noise LPN, McEliece,
and QC-MDPC assumptions are the first UC-secure OT protocols based on coding
assumptions to achieve: 1) adaptive security, 2) optimal round complexity, 3)
low communication and computational complexities. Previous results in this
setting only achieved static security and used costly cut-and-choose
techniques.Our instantiation based on CDH achieves adaptive security at the
small cost of communicating only two more group elements as compared to the
gap-DH based Simplest OT protocol of Chou and Orlandi (Latincrypt 15), which
only achieves static security in the ROM
Round-efficient Oblivious Database Manipulation
Most of the multi-party computation frameworks can be viewed as
oblivious databases where data is stored and processed in a
secret-shared form. However, data manipulation in such databases can
be slow and cumbersome without dedicated protocols for certain
database operations. In this paper, we provide efficient protocols
for oblivious selection, filtering and shuffle---essential tools in
privacy-preserving data analysis. As the first contribution, we
present a -out-of- oblivious transfer protocol with
rounds, which achieves optimal communication and
time complexity and works over any ring . Secondly, we show
that the round complexity of a bit decomposition protocol can
be almost matched with oblivious transfer, and that there exists an
oblivious transfer protocol with rounds. Finally,
we also show how to construct round-efficient shuffle protocols with
optimal asymptotic computation complexity and provide several
optimizations
Oblivious and Fair Server-Aided Two-Party Computation
We show efficient, practical (server-aided) secure
two-party computation protocols ensuring privacy, correctness
and fairness in the presence of malicious (Byzantine) faults. Our
requirements from the server are modest: to ensure privacy
and correctness, we only assume offline set-up prior to protocol
execution; and to also ensure fairness, we further assume a
trusted-decryption service, providing decryption service using
known public key. The fairness-ensuring protocol is optimistic,
i.e., the decryption service is invoked only in case of faults. Both
assumptions are feasible in practice and formally presented in
the hybrid model. The resulting protocols may be sufficiently
efficient, to allow deployment, in particular for financial applications
Efficient and Universally Composable Committed Oblivious Transfer and Applications
Committed Oblivious Transfer (COT) is a useful cryptographic primitive that combines the functionalities of bit commitment and oblivious transfer. In this paper, we introduce an extended version of COT (ECOT) which additionally allows proofs of relations among committed bits, and we construct an efficient protocol that securely realizes an ECOT functionality in the universal-composability (UC) framework in the common reference string (CRS) model. Our construction is more efficient than previous (non-UC) constructions of COT, involving only a constant number of exponentiations and communication rounds. Using the ECOT functionality as a building block, we construct efficient UC protocols for general two-party and multi-party functionalities (in the CRS model), each gate requiring a constant number of ECOT's