Sciweavers

31 search results - page 4 / 7
» Efficient Fully-Simulatable Oblivious Transfer
Sort
View
116
Voted
FC
2008
Springer
134views Cryptology» more  FC 2008»
15 years 2 months ago
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
Vandana Gunupudi, Stephen R. Tate
107
Voted
ASIACRYPT
2008
Springer
15 years 2 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
102
Voted
EUROCRYPT
2006
Springer
15 years 3 months ago
Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
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...
Claude Crépeau, George Savvides
EUROCRYPT
1997
Springer
15 years 3 months ago
Oblivious Transfers and Privacy Amplification
Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two string OT, a sender offers two strings, one of which the other party, called the receive...
Gilles Brassard, Claude Crépeau
86
Voted
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
15 years 1 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