9 search results - page 1 / 2 » A Framework for Efficient and Composable Oblivious Transfer |
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
CTRSA
2006
Springer
13 years 9 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
ASIACRYPT
2008
Springer
13 years 7 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...