Sciweavers

141 search results - page 1 / 29
» Oblivious Transfer and Linear Functions
Sort
View
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
EUROCRYPT
2006
Springer
13 years 8 months ago
Oblivious Transfer Is Symmetric
We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious tran...
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
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
13 years 6 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
JIPS
2007
131views more  JIPS 2007»
13 years 4 months ago
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
Ju-Sung Kang, Dowon Hong