Irene Giacomelli

According to our database1, Irene Giacomelli authored at least 16 papers between 2013 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Overfitting, robustness, and malicious algorithms: A study of potential causes of privacy risk in machine learning.
J. Comput. Secur., 2020

Exploring Connections Between Active Learning and Model Extraction.
Proceedings of the 29th USENIX Security Symposium, 2020

Mon$\mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $\mathbb {Z}_{2^{k}}$.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

2019
Monℤ<sub>2<sup>k</sup></sub>a: Fast Maliciously Secure Two Party Computation on ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2019

2018
Efficient UC Commitment Extension with Homomorphism for Free (and Applications).
IACR Cryptol. ePrint Arch., 2018

Privacy-Preserving Collaborative Prediction using Random Forests.
CoRR, 2018

Model Extraction and Active Learning.
CoRR, 2018

Privacy Risk in Machine Learning: Analyzing the Connection to Overfitting.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017
Privacy-Preserving Ridge Regression on Distributed Data.
IACR Cryptol. ePrint Arch., 2017

Privacy-Preserving Ridge Regression with only Linearly-Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2017

2016
ZKBoo: Faster Zero-Knowledge for Boolean Circuits.
IACR Cryptol. ePrint Arch., 2016

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model.
IACR Cryptol. ePrint Arch., 2016

2015
Security of Linear Secret-Sharing Schemes against Mass Surveillance.
IACR Cryptol. ePrint Arch., 2015

2014
Compact VSS and Efficient Homomorphic UC Commitments.
IACR Cryptol. ePrint Arch., 2014

Additively Homomorphic UC commitments with Optimal Amortized Overhead.
IACR Cryptol. ePrint Arch., 2014

2013
Improved Decoding Algorithms for Reed-Solomon Codes.
CoRR, 2013


  Loading...