Sciweavers

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

80

Voted

COCO
2005
Springer

89views Algorithms» more COCO 2005»

Computationally Private Randomizing Polynomials and Their Applications

15 years 8 months ago

Computationally Private Randomizing Polynomials and Their Applications

Download www.cs.technion.ac.il

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz

Real-time Traffic

COCO 2005 |

claim paper

Related Content

» A Theorem on Sensitivity and Applications in Private Computation

» Fast Computation on Encrypted Polynomials and Applications

» What Can We Learn Privately

» Deniable Encryption

» Practical Private Computation and ZeroKnowledge Tools for PrivacyPreserving Distributed Da...

» Distributed Computing with Imperfect Randomness

» PrivacyPreserving Set Operations

» Security of the Most Significant Bits of the Shamir Message Passing Scheme

» Secure Games with Polynomial Expressions

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	COCO
Authors	Benny Applebaum, Yuval Ishai, Eyal Kushilevitz

Comments (0)