Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
An Oblivious Transfer Protocol with Log-Squared Communication
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose a one-round 1-out-of-
n
computationally-private information retrieval protocol for ℓ-bit strings with low-degree polylogarithmic receiver-computation, linear sender-computation and communication Θ(
k
log
2
n
+ℓ
log
n
), where
k
is a possibly non-constant security parameter. The new protocol is receiver-private if the underlying length-flexible additively homomorphic public-key cryptosystem is IND-CPA secure. It can be transformed to a one-round computationally receiver-private and information-theoretically sender-private 1-out-of-
n
oblivious-transfer protocol for ℓ-bit strings, that has the same asymptotic communication and is private in the standard complexity-theoretic model.