Sciweavers

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

20

IACR
2016

favoriteEmaildiscussreport

37views Biometrics» more IACR 2016»

Randomness Complexity of Private Circuits for Multiplication

8 years 7 months ago

Randomness Complexity of Private Circuits for Multiplication

Download eprint.iacr.org

Sonia Belaïd, Fabrice Benhamouda, Alain Passe

Real-time Traffic

Biometrics | IACR 2016 |

claim paper

Related Content

» Characterizing Linear Size Circuits in Terms of Privacy

» Automated mechanism design complexity results stemming from the singleagent setting

» NearLinear UnconditionallySecure Multiparty Computation with a Dishonest Minority

» Secure Computation with Sublinear Amortized Work

» Sign Modules in Secure Arithmetic Circuits

» Graph Entropy Network Coding and Guessing games

» On distributing symmetric streaming computations

» On the system level prediction of joint time frequency spreading systems with carrier phas...

Post Info
More Details (n/a)

Added	03 Apr 2016
Updated	03 Apr 2016
Type	Journal
Year	2016
Where	IACR
Authors	Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud

Comments (0)