DeepAI AI Chat
Log In Sign Up

On the Composability of Statistically Secure Random Oblivious Transfer

08/30/2018
by   Rafael Dowsley, et al.
KIT
Aarhus Universitet
0

We show that stand-alone statistically secure random oblivious transfer protocols based on two-party stateless primitives are statistically universally composable. I.e. 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 which were proven secure under weaker, non-composable definitions of security can actually be used in arbitrary statistically secure applications without lowering the security.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/26/2022

Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries

In this paper, we design secure multi-party computation (MPC) protocols ...
04/11/2019

Privacy protocols

Security protocols enable secure communication over insecure channels. P...
03/15/2023

Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority

Secure multi-party computation (SMPC) protocols allow several parties th...
05/31/2019

Secure Memory Erasure in the Presence of Man-in-the-Middle Attackers

Memory erasure protocols serve to clean up a device's memory before the ...
10/18/2019

Universal Composability is Secure Compilation

Universal composability is a framework for the specification and analysi...
04/20/2018

Securing Email

Email is the most ubiquitous and interoperable form of online communicat...
08/09/2019

Composable and Finite Computational Security of Quantum Message Transmission

Recent research in quantum cryptography has led to the development of sc...