Tomas Toft

According to our database1, Tomas Toft authored at least 31 papers between 2005 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
J. Cryptol., 2019

2016
Fast Multiparty Multiplications from shared bits.
IACR Cryptol. ePrint Arch., 2016

Better Preprocessing for Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2016

2015
Confidential Benchmarking based on Multiparty Computation.
IACR Cryptol. ePrint Arch., 2015

2014
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries.
J. Cryptol., 2014

An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation.
IACR Cryptol. ePrint Arch., 2014

2013
Privacy-preserving distributed clustering.
EURASIP J. Inf. Secur., 2013

A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation.
Proceedings of the Information Security and Cryptology - ICISC 2013, 2013

Secure Equality and Greater-Than Tests with Sublinear Online Complexity.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Generating Private Recommendations Efficiently Using Homomorphic Encryption and Data Packing.
IEEE Trans. Inf. Forensics Secur., 2012

High-performance secure multi-party computation for data mining applications.
Int. J. Inf. Sec., 2012

On Secure Two-party Integer Division.
IACR Cryptol. ePrint Arch., 2012

Secure Computation, I/O-Efficient Algorithms and Distributed Signatures.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

Adding query privacy to robust DHTs.
Proceedings of the 7th ACM Symposium on Information, Compuer and Communications Security, 2012

2011
Secure Datastructures based on Multiparty Computation.
IACR Cryptol. ePrint Arch., 2011

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
IACR Cryptol. ePrint Arch., 2011

Secure data structures based on multi-party computation.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Sub-linear, Secure Comparison with Two Non-colluding Parties.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

2009
Privacy-preserving user clustering in a social network.
Proceedings of the First IEEE International Workshop on Information Forensics and Security, 2009

Privacy-Preserving Face Recognition.
Proceedings of the Privacy Enhancing Technologies, 9th International Symposium, 2009

Linear, Constant-Rounds Bit-Decomposition.
Proceedings of the Information, Security and Cryptology, 2009

Solving Linear Programs Using Multiparty Computation.
Proceedings of the Financial Cryptography and Data Security, 2009


Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values.
Proceedings of the Topics in Cryptology, 2009

2008
Multiparty Computation Goes Live.
IACR Cryptol. ePrint Arch., 2008

Trading Sugar Beet Quotas - Secure Multiparty Computation in Practice.
ERCIM News, 2008

2007
Secure Relative Performance Scheme.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Secret Sharing Comparison by Transformation and Rotation.
Proceedings of the Information Theoretic Security - Second International Conference, 2007

2006
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation.
Proceedings of the Financial Cryptography and Data Security, 2006

2005
How to Split a Shared Secret into Shared Bits in Constant-Round.
IACR Cryptol. ePrint Arch., 2005


  Loading...