Improved Decoding Algorithms for Reed-Solomon Codes. - Irene Giacomelli (CoRR, 2013)

Additively Homomorphic UC commitments with Optimal Amortized Overhead. - Ignacio Cascudo; Ivan Damgård; Bernardo David; Irene Giacomelli; Jesper Buus Nielsen; Roberto Trifiletti (IACR Cryptol. ePrint Arch., 2014)

Compact VSS and Efficient Homomorphic UC Commitments. - Ivan Damgård; Bernardo David; Irene Giacomelli; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2014)

Security of Linear Secret-Sharing Schemes against Mass Surveillance. - Irene Giacomelli; Ruxandra F. Olimid; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2015)

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. - Ronald Cramer; Ivan Damgård; Nico Döttling; Irene Giacomelli; Chaoping Xing (IACR Cryptol. ePrint Arch., 2016)

ZKBoo: Faster Zero-Knowledge for Boolean Circuits. - Irene Giacomelli; Jesper Madsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2016)

Privacy-Preserving Ridge Regression with only Linearly-Homomorphic Encryption. - Irene Giacomelli; Somesh Jha; Marc Joye; C. David Page; Kyonghwan Yoon (IACR Cryptol. ePrint Arch., 2017)

Privacy-Preserving Ridge Regression on Distributed Data. - Irene Giacomelli; Somesh Jha; C. David Page; Kyonghwan Yoon (IACR Cryptol. ePrint Arch., 2017)

Privacy Risk in Machine Learning: Analyzing the Connection to Overfitting. - Samuel Yeom; Irene Giacomelli; Matt Fredrikson; Somesh Jha (CSF, 2018)

Model Extraction and Active Learning. - Varun Chandrasekaran; Kamalika Chaudhuri; Irene Giacomelli; Somesh Jha; Songbai Yan (CoRR, 2018)

Privacy-Preserving Collaborative Prediction using Random Forests. - Irene Giacomelli; Somesh Jha; Ross Kleiman; David Page; Kyonghwan Yoon (CoRR, 2018)

Efficient UC Commitment Extension with Homomorphism for Free (and Applications). - Ignacio Cascudo; Ivan Damgård; Bernardo David; Nico Döttling; Rafael Dowsley; Irene Giacomelli (IACR Cryptol. ePrint Arch., 2018)

Monℤ2ka: Fast Maliciously Secure Two Party Computation on ℤ2k. - Dario Catalano; Mario Di Raimondo; Dario Fiore 001; Irene Giacomelli (IACR Cryptol. ePrint Arch., 2019)

Mon$ mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $ mathbb {Z}_{2^{k}}$. - Dario Catalano; Mario Di Raimondo; Dario Fiore 001; Irene Giacomelli (Public Key Cryptography (2), 2020)

Exploring Connections Between Active Learning and Model Extraction. - Varun Chandrasekaran; Kamalika Chaudhuri; Irene Giacomelli; Somesh Jha; Songbai Yan (USENIX Security Symposium, 2020)

Overfitting, robustness, and malicious algorithms: A study of potential causes of privacy risk in machine learning. - Samuel Yeom; Irene Giacomelli; Alan Menaged; Matt Fredrikson; Somesh Jha (J. Comput. Secur., 2020)