default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThijs Veugen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Bart Veldhuizen, Gabriele Spini, Thijs Veugen, Lisa Kohl:
Extending the Security of SPDZ with Fairness. Proc. Priv. Enhancing Technol. 2024(2): 330-350 (2024)- [c23]Sjoerd Berning
, Vincent Dunning, Dayana Spagnuelo, Thijs Veugen, Jasper van der Waa:
The Trade-off Between Privacy & Quality for Counterfactual Explanations. ARES 2024: 179:1-179:9 - [i13]Thijs Veugen, Vincent Dunning, Michiel Marcus, Bart Kamphorst:
Secure Latent Dirichlet Allocation. IACR Cryptol. ePrint Arch. 2024: 659 (2024) - 2022
- [j16]Thijs Veugen, Bart Kamphorst, Michiel Marcus:
Privacy-Preserving Contrastive Explanations with Local Foil Trees. Cryptogr. 6(4): 54 (2022) - [j15]Gabriele Spini, Emiliano Mancini, Thomas Attema, Mark Abspoel, Jan de Gier, Serge Fehr, Thijs Veugen, Maran van Heesch, Daniël Worm, Andrea De Luca, Ronald Cramer, Peter M. A. Sloot:
New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment. J. Medical Syst. 46(12): 84 (2022) - [j14]Bart Kamphorst, Thomas Rooijakkers, Thijs Veugen, Matteo Cellamare, Daan Knoors:
Accurate training of the Cox proportional hazards model on vertically-partitioned data while preserving privacy. BMC Medical Informatics Decis. Mak. 22(1): 49 (2022) - [c22]Thijs Veugen, Bart Kamphorst, Michiel Marcus:
Privacy-Preserving Contrastive Explanations with Local Foil Trees. CSCML 2022: 88-98 - [c21]Thijs Veugen:
Secure Multi-party Computation and Its Applications. I4CS 2022: 3-5 - [i12]Thijs Veugen:
Lightweight Secure Integer Comparison. IACR Cryptol. ePrint Arch. 2022: 79 (2022) - [i11]Thijs Veugen, Bart Kamphorst, Michiel Marcus:
Privacy-Preserving Contrastive Explanations with Local Foil Trees. IACR Cryptol. ePrint Arch. 2022: 360 (2022) - 2021
- [j13]Marie Beth van Egmond, Gabriele Spini, Onno van der Galiën, Arne IJpma, Thijs Veugen, Wessel Kraaij, Alex Sangers, Thomas Rooijakkers, Peter Langenkamp, Bart Kamphorst, Natasja van de L'Isle, Milena Kooij-Janic:
Privacy-preserving dataset combination and Lasso regression for healthcare predictions. BMC Medical Informatics Decis. Mak. 21(1): 266 (2021) - [j12]Thijs Veugen, Mark Abspoel:
Secure integer division with a private divisor. Proc. Priv. Enhancing Technol. 2021(4): 339-349 (2021) - [c20]Thijs Veugen, Bart Kamphorst, Natasja van de L'Isle, Marie Beth van Egmond:
Privacy-Preserving Coupling of Vertically-Partitioned Databases and Subsequent Training with Gradient Descent. CSCML 2021: 38-51 - [i10]Rudolf Mayer, Thijs Veugen:
Privacy Preserving Computation - Introduction to the Special Theme. ERCIM News 2021(126) (2021) - 2020
- [j11]Thijs Veugen:
Efficient coding for secure computing with additively-homomorphic encrypted data. Int. J. Appl. Cryptogr. 4(1): 1-15 (2020) - [j10]Gabriele Spini, Maran van Heesch, Thijs Veugen, Supriyo Chatterjea:
Private Hospital Workflow Optimization via Secure k-Means Clustering. J. Medical Syst. 44(1): 8:1-8:12 (2020)
2010 – 2019
- 2019
- [c19]Lisa Steverink, Thijs Veugen, Martin B. van Gijzen:
Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering. ENUMATH 2019: 1129-1136 - [c18]Alex Sangers, Maran van Heesch, Thomas Attema, Thijs Veugen, Mark Wiggerman, Jan Veldsink, Oscar Bloemen, Daniël Worm:
Secure Multiparty PageRank Algorithm for Collaborative Fraud Detection. Financial Cryptography 2019: 605-623 - [i9]Thijs Veugen:
Efficient coding for secure computing with additively-homomorphic encrypted data. IACR Cryptol. ePrint Arch. 2019: 437 (2019) - [i8]Thijs Veugen, Thomas Attema, Gabriele Spini:
An implementation of the Paillier crypto system with threshold decryption without a trusted dealer. IACR Cryptol. ePrint Arch. 2019: 1136 (2019) - [i7]Maran van Heesch, Niels L. M. van Adrichem, Thomas Attema, Thijs Veugen:
Towards Quantum-Safe VPNs and Internet. IACR Cryptol. ePrint Arch. 2019: 1277 (2019) - 2018
- [c17]Majid Nateghizad, Thijs Veugen, Zekeriya Erkin, Reginald L. Lagendijk:
Secure Equality Testing Protocols in the Two-Party Setting. ARES 2018: 3:1-3:10 - [c16]Meilof Veeningen, Supriyo Chatterjea, Anna Zsófia Horváth, Gerald Spindler, Eric Boersma, Peter J. van der Spek, Onno van der Galiën, Job Gutteling, Wessel Kraaij, Thijs Veugen:
Enabling Analytics on Sensitive Medical Data with Secure Multi-Party Computation. MIE 2018: 76-80 - [i6]Thomas Attema, Emiliano Mancini, Gabriele Spini, Mark Abspoel, Jan de Gier, Serge Fehr, Thijs Veugen, Maran van Heesch, Daniël Worm, Andrea De Luca, Ronald Cramer, Peter M. A. Sloot:
A New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment. CoRR abs/1810.01107 (2018) - [i5]Thijs Veugen, Thomas Attema, Maran van Heesch, Léo Ducas:
Preparing Ourselves for the Threats of the Post-Quantum Era. ERCIM News 2018(112) (2018) - [i4]Alex Sangers, Maran van Heesch, Thomas Attema, Thijs Veugen, Mark Wiggerman, Jan Veldsink, Oscar Bloemen, Daniël Worm:
Secure multiparty PageRank algorithm for collaborative fraud detection. IACR Cryptol. ePrint Arch. 2018: 917 (2018) - [i3]Thijs Veugen:
Correction to "Improving the DGK comparison protocol". IACR Cryptol. ePrint Arch. 2018: 1100 (2018) - 2017
- [j9]Thijs Veugen, Jeroen Doumen, Zekeriya Erkin, Gaetano Pellegrino, Sicco Verwer, Jos H. Weber:
Improved privacy of dynamic group services. EURASIP J. Inf. Secur. 2017: 3 (2017) - [c15]Finn de Ridder, Niels Neumann, Thijs Veugen, Robert E. Kooij:
A Quantum Algorithm for Minimising the Effective Graph Resistance upon Edge Addition. QTOP@NetSys 2017: 63-73 - 2016
- [c14]Archana Bindu Sunil, Zekeriya Erkin, Thijs Veugen:
Secure matching of dutch car license plates. EUSIPCO 2016: 2116-2120 - [i2]Thijs Veugen:
Client-Server Framework for Securely Outsourcing Computations. ERCIM News 2016(106) (2016) - 2015
- [j8]Thijs Veugen, Frank Blom, Sebastiaan J. A. de Hoogh, Zekeriya Erkin:
Secure Comparison Protocols in the Semi-Honest Model. IEEE J. Sel. Top. Signal Process. 9(7): 1217-1228 (2015) - [j7]Thijs Veugen, Robbert de Haan, Ronald Cramer, Frank Muller:
A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations. IEEE Trans. Inf. Forensics Secur. 10(3): 445-457 (2015) - [j6]Thijs Veugen:
Linear Round Bit-Decomposition of Secret-Shared Values. IEEE Trans. Inf. Forensics Secur. 10(3): 498-506 (2015) - [c13]Thijs Veugen, Zekeriya Erkin:
Content-based recommendations with approximate integer division. ICASSP 2015: 1802-1806 - 2014
- [j5]Thijs Veugen:
Encrypted integer division and secure comparison. Int. J. Appl. Cryptogr. 3(2): 166-180 (2014) - [c12]Zekeriya Erkin, Thijs Veugen:
Privacy Enhanced Personal Services for Smart Grids. SEGS@CCS 2014: 7-12 - 2013
- [j4]Zekeriya Erkin, Thijs Veugen, Tomas Toft, Reginald L. Lagendijk:
Privacy-preserving distributed clustering. EURASIP J. Inf. Secur. 2013: 4 (2013) - [c11]Milena Janic, Jan Pieter Wijbenga, Thijs Veugen:
Transparency Enhancing Tools (TETs): An Overview. STAST 2013: 18-25 - [c10]Zekeriya Erkin, Thijs Veugen, Reginald L. Lagendijk:
Privacy-preserving recommender systems in dynamic environments. WIFS 2013: 61-66 - 2012
- [j3]Zekeriya Erkin, Thijs Veugen, Tomas Toft, Reginald L. Lagendijk:
Generating Private Recommendations Efficiently Using Homomorphic Encryption and Data Packing. IEEE Trans. Inf. Forensics Secur. 7(3): 1053-1066 (2012) - [c9]Zekeriya Erkin, Michael Beye, Thijs Veugen, Reginald L. Lagendijk:
Privacy-preserving content-based recommender system. MM&Sec 2012: 77-84 - [c8]Thijs Veugen, Michael Beye:
Improved Anonymity for Key-Trees. RFIDSec 2012: 31-47 - [c7]Thijs Veugen:
Improving the DGK comparison protocol. WIFS 2012: 49-54 - 2011
- [j2]Thijs Veugen:
Recurrent Multiple-Repetition Coding for Channels With Feedback. IEEE Trans. Inf. Theory 57(9): 5983-5990 (2011) - [c6]Zekeriya Erkin, Thijs Veugen, Reginald L. Lagendijk:
Generating private recommendations in a social trust network. CASoN 2011: 82-87 - [c5]Zekeriya Erkin, Michael Beye, Thijs Veugen, Reginald L. Lagendijk:
Efficiently computing private recommendations. ICASSP 2011: 5864-5867 - [c4]Michael Beye, Thijs Veugen:
Anonymity for Key-Trees with Adaptive Adversaries. SecureComm 2011: 409-425 - [i1]Michael Beye, Thijs Veugen:
Improved Anonymity for Key-Trees. IACR Cryptol. ePrint Arch. 2011: 395 (2011) - 2010
- [c3]Thijs Veugen:
Encrypted integer division. WIFS 2010: 1-6
2000 – 2009
- 2009
- [c2]Zekeriya Erkin, Thijs Veugen, Tomas Toft, Reginald L. Lagendijk:
Privacy-preserving user clustering in a social network. WIFS 2009: 96-100 - [c1]Tiziano Bianchi, Thijs Veugen, Alessandro Piva, Mauro Barni:
Processing in the encrypted domain using a composite signal representation: Pros and cons. WIFS 2009: 176-180 - 2007
- [j1]Thijs Veugen:
Information Theory Choosing the parameters of multiple-repetition strategies. Eur. Trans. Telecommun. 18(3): 245-252 (2007)
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 2025-01-21 00:04 CET 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:
