Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

101

Voted

SIAMCOMP
2000

66views more SIAMCOMP 2000»

Reducibility and Completeness in Private Computations

15 years 2 months ago

Reducibility and Completeness in Private Computations

Download www.cs.ucla.edu

Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafai

Real-time Traffic

SIAMCOMP 2000 |

claim paper

Related Content

» Reducing the Servers Computation in Private Information Retrieval PIR with Preprocessing

» Dynamic names and private address maps complete selfconfiguration for MANETs

» Private Computation kConnected versus 1Connected Networks

» DeTail reducing the flow completion time tail in datacenter networks

» Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups

» Authorized Private Keyword Search over Encrypted Data in Cloud Computing

» On private computation in incomplete networks

» Improving Practical Performance on Secure and Private Collaborative Linear Programming

» PRISM PrivacyPreserving Search in MapReduce

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	SIAMCOMP
Authors	Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky

Comments (0)