default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Attema
Person information
- affiliation: CWI, Amsterdam, The Netherlands
- affiliation: Leiden University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Thomas Attema, Aron van Baarsen, Stefan van den Berg, Pedro Capitão, Vincent Dunning, Lisa Kohl:
Communication-Efficient Multi-Party Computation for RMS Programs. IACR Commun. Cryptol. 1(2): 10 (2024)- [i20]Thomas Attema, Aron van Baarsen, Stefan van den Berg, Pedro Capitão, Vincent Dunning, Lisa Kohl:
Communication-Efficient Multi-Party Computation for RMS Programs. IACR Cryptol. ePrint Arch. 2024: 568 (2024) - 2023
- [j4]Thomas Attema
, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-Round Interactive Proofs (Extended Version). J. Cryptol. 36(4): 36 (2023) - [c16]Thomas Attema, Pedro Capitão, Lisa Kohl:
On Homomorphic Secret Sharing from Polynomial-Modulus LWE. Public Key Cryptography (2) 2023: 3-32 - [c15]Thomas Attema, Serge Fehr, Nicolas Resch:
Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. TCC (3) 2023: 424-454 - [i19]Thomas Attema, Pedro Capitão, Lisa Kohl:
On Homomorphic Secret Sharing from Polynomial-Modulus LWE. IACR Cryptol. ePrint Arch. 2023: 382 (2023) - [i18]Thomas Attema, Serge Fehr, Nicolas Resch:
A Generalized Special-Soundness Notion and its Knowledge Extractors. IACR Cryptol. ePrint Arch. 2023: 818 (2023) - [i17]Thomas Attema, Serge Fehr, Michael Klooß, Nicolas Resch:
The Fiat-Shamir Transformation of (Γ1,đots,Γμ)-Special-Sound Interactive Proofs. IACR Cryptol. ePrint Arch. 2023: 1945 (2023) - 2022
- [j3]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) - [c14]Thomas Attema, Vincent Dunning, Maarten H. Everts, Peter Langenkamp:
Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC. ACNS 2022: 663-683 - [c13]Thomas Attema, Serge Fehr:
Parallel Repetition of (k1, đots , kμ )-Special-Sound Multi-round Interactive Proofs. CRYPTO (1) 2022: 415-443 - [c12]Thomas Attema, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-round Interactive Proofs. TCC (1) 2022: 113-142 - [c11]Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Damgård, Daniel Escudero:
Vector Commitments over Rings and Compressed $\varSigma $-Protocols. TCC (1) 2022: 173-202 - [i16]Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Bjerre Damgård, Daniel Escudero:
Vector Commitments over Rings and Compressed Σ-Protocols. IACR Cryptol. ePrint Arch. 2022: 181 (2022) - [i15]Thomas Attema, Vincent Dunning, Maarten H. Everts, Peter Langenkamp:
Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC. IACR Cryptol. ePrint Arch. 2022: 454 (2022) - 2021
- [j2]Thomas Attema, Joost W. Bosman, Niels M. P. Neumann:
Optimizing the decoy-state BB84 QKD protocol parameters. Quantum Inf. Process. 20(4): 154 (2021) - [c10]Thomas Attema, Ronald Cramer, Matthieu Rambaud:
Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures. ASIACRYPT (4) 2021: 526-556 - [c9]Thomas Attema, Ronald Cramer, Serge Fehr:
Compressing Proofs of k-Out-Of-n Partial Knowledge. CRYPTO (4) 2021: 65-91 - [c8]Thomas Attema, Ronald Cramer, Lisa Kohl:
A Compressed $\varSigma $-Protocol Theory for Lattices. CRYPTO (2) 2021: 549-579 - [c7]Mark Abspoel, Thomas Attema, Matthieu Rambaud:
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. PODC 2021: 195-198 - [i14]Thomas Attema, Ronald Cramer, Lisa Kohl:
A Compressed Σ-Protocol Theory for Lattices. IACR Cryptol. ePrint Arch. 2021: 307 (2021) - [i13]Thomas Attema, Nicole Gervasoni, Michiel Marcus, Gabriele Spini:
Post-Quantum Cryptography: Computational-Hardness Assumptions and Beyond. IACR Cryptol. ePrint Arch. 2021: 571 (2021) - [i12]Thomas Attema, Serge Fehr:
Parallel Repetition of (k1, đots, kμ)-Special-Sound Multi-Round Interactive Proofs. IACR Cryptol. ePrint Arch. 2021: 1259 (2021) - [i11]Thomas Attema, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-Round Interactive Proofs. IACR Cryptol. ePrint Arch. 2021: 1377 (2021) - 2020
- [j1]Roy van Houte, Jesse Mulderij, Thomas Attema, Irina Chiscop, Frank Phillipson:
Mathematical formulation of quantum circuit design problems in networks of quantum computers. Quantum Inf. Process. 19(5): 141 (2020) - [c6]Thomas Attema, Vadim Lyubashevsky, Gregor Seiler:
Practical Product Proofs for Lattice Commitments. CRYPTO (2) 2020: 470-499 - [c5]Thomas Attema, Ronald Cramer:
Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. CRYPTO (3) 2020: 513-543 - [c4]Niels M. P. Neumann, Roy van Houte, Thomas Attema:
Imperfect Distributed Quantum Phase Estimation. ICCS (6) 2020: 605-615 - [i10]Thomas Attema, Ronald Cramer:
Compressed Σ-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. IACR Cryptol. ePrint Arch. 2020: 152 (2020) - [i9]Thomas Attema, Vadim Lyubashevsky, Gregor Seiler:
Practical Product Proofs for Lattice Commitments. IACR Cryptol. ePrint Arch. 2020: 517 (2020) - [i8]Thomas Attema, Ronald Cramer, Serge Fehr:
Compressing Proofs of k-Out-Of-n Partial Knowledge. IACR Cryptol. ePrint Arch. 2020: 753 (2020) - [i7]Thomas Attema, Ronald Cramer, Matthieu Rambaud:
Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes. IACR Cryptol. ePrint Arch. 2020: 1447 (2020)
2010 – 2019
- 2019
- [c3]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 - [i6]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) - [i5]Thomas Attema, Ronald Cramer, Chaoping Xing:
A note on short invertible ring elements and applications to cyclotomic and trinomials number fields. IACR Cryptol. ePrint Arch. 2019: 1200 (2019) - [i4]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
- [i3]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) - [i2]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) - [i1]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) - 2017
- [c2]Wietze J. B. Beukema, Thomas Attema, Harm A. Schotanus:
Internal Network Monitoring and Anomaly Detection through Host Clustering. ICISSP 2017: 694-703 - 2015
- [c1]Thomas Attema, Peter-Paul van Maanen, Erik Meeuwissen:
Development and Evaluation of Multi-Agent Models Predicting Twitter Trends in Multiple Domains. ASONAM 2015: 1133-1140
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 22:23 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:
