The following pages link to Tomas Toft (Q744606):
Displaying 16 items.
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- Secure Computation, I/O-Efficient Algorithms and Distributed Signatures (Q2890013) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation (Q2922672) (← links)
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries (Q3058657) (← links)
- Sub-linear, Secure Comparison with Two Non-colluding Parties (Q3084347) (← links)
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation (Q3193251) (← links)
- A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation (Q3524129) (← links)
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values (Q3623058) (← links)
- Secret Sharing Comparison by Transformation and Rotation (Q3649198) (← links)
- Solving Linear Programs Using Multiparty Computation (Q3655171) (← links)
- Secure Multiparty Computation Goes Live (Q3655178) (← links)
- Secure Equality and Greater-Than Tests with Sublinear Online Complexity (Q5327472) (← links)
- Theory of Cryptography (Q5898360) (← links)
