default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilko Henecka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c12]Richard Nock, Stephen Hardy, Wilko Henecka, Hamish Ivey-Law, Jakub Nabaglo, Giorgio Patrini, Guillaume Smith, Brian Thorne:
The Impact of Record Linkage on Learning from Feature Partitioned Data. ICML 2021: 8216-8226- 2020
- [c11]Ian J. Oppermann
, Jakub Nabaglo, Wilko Henecka:
A Measure of Personal Information in Mobile Data. 6G SUMMIT 2020: 1-6 - [c10]Dinusha Vatsalan, Joyce Yu, Wilko Henecka, Brian Thorne:
Fairness-Aware Privacy-Preserving Record Linkage. DPM/CBT@ESORICS 2020: 3-18 - [c9]Dinusha Vatsalan, Joyce Yu, Brian Thorne, Wilko Henecka:
P-Signature-Based Blocking to Improve the Scalability of Privacy-Preserving Record Linkage. DPM/CBT@ESORICS 2020: 35-51 - [c8]Joyce Yu, Jakub Nabaglo, Dinusha Vatsalan, Wilko Henecka, Brian Thorne:
Hyper-Parameter Optimization for Privacy-Preserving Record Linkage. PKDD/ECML Workshops 2020: 281-296 - [i4]Richard Nock, Wilko Henecka:
Boosted and Differentially Private Ensembles of Decision Trees. CoRR abs/2001.09384 (2020)
2010 – 2019
- 2018
- [i3]Richard Nock, Stephen Hardy, Wilko Henecka, Hamish Ivey-Law, Giorgio Patrini, Guillaume Smith, Brian Thorne:
Entity Resolution and Federated Learning get a Federated Resolution. CoRR abs/1803.04035 (2018) - 2017
- [i2]Stephen Hardy, Wilko Henecka, Hamish Ivey-Law, Richard Nock, Giorgio Patrini, Guillaume Smith, Brian Thorne:
Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption. CoRR abs/1711.10677 (2017) - 2015
- [j1]Wilko Henecka, Matthew Roughan:
Privacy-Preserving Fraud Detection Across Multiple Phone Record Databases. IEEE Trans. Dependable Secur. Comput. 12(6): 640-651 (2015) - [c7]Wilko Henecka, Matthew Roughan:
Lossy Compression of Dynamic, Weighted Graphs. FiCloud 2015: 427-434 - 2013
- [c6]Wilko Henecka, Thomas Schneider:
Faster secure two-party computation with less memory. AsiaCCS 2013: 437-446 - [c5]Wilko Henecka, Matthew Roughan:
STRIP: Privacy-preserving vector-based routing. ICNP 2013: 1-10 - 2012
- [c4]Wilko Henecka, Nigel G. Bean, Matthew Roughan:
Conversion of Real-Numbered Privacy-Preserving Problems into the Integer Domain. ICICS 2012: 131-141 - 2010
- [c3]Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadeghi, Thomas Schneider, Immo Wehrenberg:
TASTY: tool for automating secure two-party computations. CCS 2010: 451-462 - [c2]Wilko Henecka, Alexander May, Alexander Meurer:
Correcting Errors in RSA Private Keys. CRYPTO 2010: 351-369 - [i1]Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadeghi, Thomas Schneider, Immo Wehrenberg:
TASTY: Tool for Automating Secure Two-partY computations. IACR Cryptol. ePrint Arch. 2010: 365 (2010)
2000 – 2009
- 2009
- [c1]Endre Bangerter, Thomas Briner, Wilko Henecka, Stephan Krenn, Ahmad-Reza Sadeghi, Thomas Schneider:
Automatic Generation of Sigma-Protocols. EuroPKI 2009: 67-82
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-04-25 05:49 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:
