Sciweavers

141 search results - page 3 / 29
» Oblivious Transfer and Linear Functions
Sort
View
IACR
2011
124views more  IACR 2011»
12 years 9 months ago
Generic Fully Simulatable Adaptive Oblivious Transfer
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To t...
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
ISW
2005
Springer
14 years 3 months ago
An Oblivious Transfer Protocol with Log-Squared Communication
Abstract. We propose a one-round 1-out-of-n computationally-private information retrieval protocol for -bit strings with low-degree polylogarithmic receivercomputation, linear send...
Helger Lipmaa
FC
2008
Springer
134views Cryptology» more  FC 2008»
13 years 11 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
CRYPTO
2007
Springer
93views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
Danny Harnik, Yuval Ishai, Eyal Kushilevitz
ICICS
2005
Springer
14 years 3 months ago
Private Itemset Support Counting
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
Sven Laur, Helger Lipmaa, Taneli Mielikäinen