default search action
Tomas Toft
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j5]Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft, Angelo Agatino Nicolosi:
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. J. Cryptol. 32(2): 265-323 (2019) - 2016
- [c22]Carsten Baum, Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias:
Better Preprocessing for Secure Multiparty Computation. ACNS 2016: 327-345 - [c21]Ivan Damgård, Kasper Damgård, Kurt Nielsen
, Peter Sebastian Nordholt, Tomas Toft:
Confidential Benchmarking Based on Multiparty Computation. Financial Cryptography 2016: 169-187 - [i11]Carsten Baum, Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias:
Better Preprocessing for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2016: 48 (2016) - [i10]Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias:
Fast Multiparty Multiplications from shared bits. IACR Cryptol. ePrint Arch. 2016: 109 (2016) - 2015
- [i9]Ivan Damgård, Kasper Damgård, Kurt Nielsen, Peter Sebastian Nordholt, Tomas Toft:
Confidential Benchmarking based on Multiparty Computation. IACR Cryptol. ePrint Arch. 2015: 1006 (2015) - 2014
- [j4]Carmit Hazay, Tomas Toft:
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. J. Cryptol. 27(2): 358-395 (2014) - [c20]Ivan Damgård, Rasmus Lauritsen, Tomas Toft:
An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation. SCN 2014: 398-415 - [i8]Ivan Damgård, Rasmus Lauritsen, Tomas Toft:
An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation. IACR Cryptol. ePrint Arch. 2014: 289 (2014) - 2013
- [j3]Zekeriya Erkin
Privacy-preserving distributed clustering. EURASIP J. Inf. Secur. 2013: 4 (2013) - [c19]Helger Lipmaa
Secure Equality and Greater-Than Tests with Sublinear Online Complexity. ICALP (2) 2013: 645-656 - [c18]Tomas Toft:
A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation. ICISC 2013: 20-33 - 2012
- [j2]Dan Bogdanov
High-performance secure multi-party computation for data mining applications. Int. J. Inf. Sec. 11(6): 403-418 (2012) - [j1]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) - [c17]Michael Backes, Ian Goldberg, Aniket Kate, Tomas Toft:
Adding query privacy to robust DHTs. AsiaCCS 2012: 30-31 - [c16]Ivan Damgård, Jonas Kölker, Tomas Toft:
Secure Computation, I/O-Efficient Algorithms and Distributed Signatures. CT-RSA 2012: 278-295 - [c15]Carmit Hazay
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. CT-RSA 2012: 313-331 - [c14]Morten Dahl, Chao Ning, Tomas Toft:
On Secure Two-Party Integer Division. Financial Cryptography 2012: 164-178 - [i7]Morten Dahl, Chao Ning, Tomas Toft:
On Secure Two-party Integer Division. IACR Cryptol. ePrint Arch. 2012: 164 (2012) - 2011
- [c13]Tomas Toft:
Sub-linear, Secure Comparison with Two Non-colluding Parties. Public Key Cryptography 2011: 174-191 - [c12]Tomas Toft:
Secure data structures based on multi-party computation. PODC 2011: 291-292 - [i6]Michael Backes, Ian Goldberg, Aniket Kate, Tomas Toft:
Adding Query Privacy to Robust DHTs. CoRR abs/1107.1072 (2011) - [i5]Tomas Toft:
Secure Datastructures based on Multiparty Computation. IACR Cryptol. ePrint Arch. 2011: 81 (2011) - [i4]Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft:
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. IACR Cryptol. ePrint Arch. 2011: 494 (2011) - 2010
- [c11]Carmit Hazay
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. ASIACRYPT 2010: 195-212
2000 – 2009
- 2009
- [c10]Tomas Toft:
Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values. CT-RSA 2009: 357-371 - [c9]Tomas Toft:
Solving Linear Programs Using Multiparty Computation. Financial Cryptography 2009: 90-107 - [c8]Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas P. Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen
Secure Multiparty Computation Goes Live. Financial Cryptography 2009: 325-343 - [c7]Tord Ingolf Reistad, Tomas Toft:
Linear, Constant-Rounds Bit-Decomposition. ICISC 2009: 245-257 - [c6]Zekeriya Erkin
Privacy-Preserving Face Recognition. Privacy Enhancing Technologies 2009: 235-253 - [c5]Zekeriya Erkin, Thijs Veugen, Tomas Toft, Reginald L. Lagendijk:
Privacy-preserving user clustering in a social network. WIFS 2009: 96-100 - 2008
- [i3]Ivan Damgård, Tomas Toft:
Trading Sugar Beet Quotas - Secure Multiparty Computation in Practice. ERCIM News 2008(73) (2008) - [i2]Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas P. Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, Tomas Toft:
Multiparty Computation Goes Live. IACR Cryptol. ePrint Arch. 2008: 68 (2008) - 2007
- [c4]Tord Ingolf Reistad, Tomas Toft:
Secret Sharing Comparison by Transformation and Rotation. ICITS 2007: 169-180 - [c3]Kurt Nielsen, Tomas Toft:
Secure Relative Performance Scheme. WINE 2007: 396-403 - 2006
- [c2]Peter Bogetoft, Ivan Damgård, Thomas P. Jakobsen, Kurt Nielsen
A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. Financial Cryptography 2006: 142-147 - [c1]Ivan Damgård, Matthias Fitzi, Eike Kiltz
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. TCC 2006: 285-304 - 2005
- [i1]Ivan Damgård, Matthias Fitzi, Jesper Buus Nielsen, Tomas Toft:
How to Split a Shared Secret into Shared Bits in Constant-Round. IACR Cryptol. ePrint Arch. 2005: 140 (2005)
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:40 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: