Sciweavers

12 search results - page 1 / 3
» Reducing Complexity Assumptions for Oblivious Transfer
Sort
View
IWSEC
2009
Springer
13 years 11 months ago
Reducing Complexity Assumptions for Oblivious Transfer
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important and interesting task in theoretical cryptography. Oblivious Transfer, one of ...
K. Y. Cheong, Takeshi Koshiba
SCN
2010
Springer
124views Communications» more  SCN 2010»
13 years 2 months ago
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
At Asiacrypt 2009, Kurosawa and Nojima showed a fully simulatable adaptive oblivious transfer (OT) protocol under the DDH assumption in the standard model. However, Green and Hohen...
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
ICISC
2008
126views Cryptology» more  ICISC 2008»
13 years 6 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
TCC
2009
Springer
112views Cryptology» more  TCC 2009»
14 years 5 months ago
Oblivious Transfer from Weak Noisy Channels
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because i...
Jürg Wullschleger
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
13 years 8 months ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin