15 search results - page 2 / 3 » Lower Bounds for Oblivious Transfer Reductions |
103
click to vote
CORR
2007
Springer
15 years 11 days 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...
112
Voted
ASIACRYPT
2005
Springer
15 years 6 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
104
click to vote
EUROCRYPT
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present an asymptotically optimal reduction of one-outof-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunctio...
126
click to vote
JOC
2007
15 years 8 days ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
90
Voted
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...