• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

DMCA

An Oblivious Transfer Protocol with Log-Squared Communication (2004)

Cached

  • Download as a PDF

Download Links

  • [eprint.iacr.org]
  • [www.cs.umd.edu]
  • [cgis.cs.umd.edu]
  • [www.cs.umd.edu]
  • [eprint.iacr.org]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [cgis.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [cgis.cs.umd.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Helger Lipmaa
Citations:107 - 12 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Lipmaa04anoblivious,
    author = {Helger Lipmaa},
    title = {An Oblivious Transfer Protocol with Log-Squared Communication},
    year = {2004}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We propose a -computationally-private information retrieval protocol (CPIR), based on the Damgard-Jurik public-key cryptosystem from PKC 2001, with total communication (log N) k. We show how to extend it to a four-round N)k. These protocols are, respectively, the first -CPIR and -OT protocols with logarithmic sender-side and polylogarithmic client-side communication. We show that there is no straightforward methodology to improve the asymptotic communication of our protocols.

Keyphrases

oblivious transfer protocol    log-squared communication    first cpir    asymptotic communication    computationally-private information retrieval protocol    ot protocol    total communication    polylogarithmic client-side communication    damgard-jurik public-key cryptosystem    straightforward methodology   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University