Sciweavers

ASIACRYPT
2000
Springer
13 years 8 months ago
Distributed Oblivious Transfer
The mobile agent is a fundamental building block of the mobile computing paradigm. In mobile agent security, oblivious transfer (OT) from a trusted party can be used to protect th...
Moni Naor, Benny Pinkas
TCC
2004
Springer
101views Cryptology» more  TCC 2004»
13 years 10 months ago
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
Abstract. Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including...
Iftach Haitner
CIS
2004
Springer
13 years 10 months ago
General Public Key m-Out-of-n Oblivious Transfer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
Zhide Chen, Hong Zhu
ASIACRYPT
2004
Springer
13 years 10 months ago
Strong Conditional Oblivious Transfer and Computing on Intervals
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
Ian F. Blake, Vladimir Kolesnikov
TCC
2005
Springer
95views Cryptology» more  TCC 2005»
13 years 10 months ago
Keyword Search and Oblivious Pseudorandom Functions
We study the problem of privacy-preserving access to a database. Particularly, we consider the problem of privacy-preserving keyword search (KS), where records in the database are ...
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Om...
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger
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