default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrene Giacomelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j1]Samuel Yeom, Irene Giacomelli, Alan Menaged, Matt Fredrikson
, Somesh Jha:
Overfitting, robustness, and malicious algorithms: A study of potential causes of privacy risk in machine learning. J. Comput. Secur. 28(1): 35-70 (2020)- [c10]Dario Catalano, Mario Di Raimondo, Dario Fiore, Irene Giacomelli:
Mon$\mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $\mathbb {Z}_{2^{k}}$. Public Key Cryptography (2) 2020: 357-386 - [c9]Varun Chandrasekaran, Kamalika Chaudhuri, Irene Giacomelli, Somesh Jha, Songbai Yan:
Exploring Connections Between Active Learning and Model Extraction. USENIX Security Symposium 2020: 1309-1326
2010 – 2019
- 2019
- [c8]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli:
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). ASIACRYPT (2) 2019: 606-635 - [i12]Dario Catalano, Mario Di Raimondo, Dario Fiore, Irene Giacomelli:
Monℤ2ka: Fast Maliciously Secure Two Party Computation on ℤ2k. IACR Cryptol. ePrint Arch. 2019: 211 (2019) - 2018
- [c7]Irene Giacomelli, Somesh Jha, Marc Joye, C. David Page, Kyonghwan Yoon:
Privacy-Preserving Ridge Regression with only Linearly-Homomorphic Encryption. ACNS 2018: 243-261 - [c6]Samuel Yeom, Irene Giacomelli, Matt Fredrikson, Somesh Jha:
Privacy Risk in Machine Learning: Analyzing the Connection to Overfitting. CSF 2018: 268-282 - [i11]Varun Chandrasekaran, Kamalika Chaudhuri, Irene Giacomelli, Somesh Jha, Songbai Yan:
Model Extraction and Active Learning. CoRR abs/1811.02054 (2018) - [i10]Irene Giacomelli, Somesh Jha, Ross Kleiman, David Page, Kyonghwan Yoon:
Privacy-Preserving Collaborative Prediction using Random Forests. CoRR abs/1811.08695 (2018) - [i9]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli:
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). IACR Cryptol. ePrint Arch. 2018: 983 (2018) - 2017
- [c5]Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing:
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. ICITS 2017: 1-25 - [i8]Irene Giacomelli, Somesh Jha, C. David Page, Kyonghwan Yoon:
Privacy-Preserving Ridge Regression on Distributed Data. IACR Cryptol. ePrint Arch. 2017: 707 (2017) - [i7]Irene Giacomelli, Somesh Jha, Marc Joye, C. David Page, Kyonghwan Yoon:
Privacy-Preserving Ridge Regression with only Linearly-Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2017: 979 (2017) - 2016
- [c4]Irene Giacomelli, Jesper Madsen, Claudio Orlandi:
ZKBoo: Faster Zero-Knowledge for Boolean Circuits. USENIX Security Symposium 2016: 1069-1083 - [i6]Irene Giacomelli, Jesper Madsen, Claudio Orlandi:
ZKBoo: Faster Zero-Knowledge for Boolean Circuits. IACR Cryptol. ePrint Arch. 2016: 163 (2016) - [i5]Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing:
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. IACR Cryptol. ePrint Arch. 2016: 397 (2016) - 2015
- [c3]Irene Giacomelli, Ruxandra F. Olimid, Samuel Ranellucci:
Security of Linear Secret-Sharing Schemes Against Mass Surveillance. CANS 2015: 43-58 - [c2]Ignacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC Commitments with Optimal Amortized Overhead. Public Key Cryptography 2015: 495-515 - [i4]Irene Giacomelli, Ruxandra F. Olimid, Samuel Ranellucci:
Security of Linear Secret-Sharing Schemes against Mass Surveillance. IACR Cryptol. ePrint Arch. 2015: 683 (2015) - 2014
- [c1]Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen:
Compact VSS and Efficient Homomorphic UC Commitments. ASIACRYPT (2) 2014: 213-232 - [i3]Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen:
Compact VSS and Efficient Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2014: 370 (2014) - [i2]Ignacio Cascudo, Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC commitments with Optimal Amortized Overhead. IACR Cryptol. ePrint Arch. 2014: 829 (2014) - 2013
- [i1]Irene Giacomelli:
Improved Decoding Algorithms for Reed-Solomon Codes. CoRR abs/1310.2473 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
