Sciweavers

35 search results - page 1 / 7
» Oblivious Transfer and Polynomial Evaluation
Sort
View
STOC
1999
ACM
122views Algorithms» more  STOC 1999»
14 years 3 months ago
Oblivious Transfer and Polynomial Evaluation
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol t...
Moni Naor, Benny Pinkas
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
14 years 11 hour 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
TCC
2004
Springer
101views Cryptology» more  TCC 2004»
14 years 4 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
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
14 years 2 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...