Anton Stiglic

We discuss problems and trade-offs with systems providing anonymity for web browsing (or more generally any communication system that requires low latency interaction). We focus on two main systems: the Freedom network [12] and PipeNet [8]. Although Freedom is efficient and reasonably secure against denial of service attacks, it is vulnerable to so...

Diffie-Hellman key agreement protocol [20] implementations have been plagued by serious security flaws. The attacks can be very subtle and, more often than not, have not been taken into account by protocol designers. In this summary we discuss both theoretical attacks against the Diffie-Hellman key agreement protocol and attacks based on implementa...

This document provides a short description of practical protocols for private credential systems. 1 We explain the basic concepts and mechanisms behind issuing and showing of private credentials and e-cash. The goal is to describe concisely how practical private credential systems can be achieved and not to provide intuition or motivation for the t...

A deck of cards can be used as a cryptographic tool (Advances in cryptology : CRYPTO’93, Lecture notes in Computer Science, Vol. 773, Springer, Berlin, 1994, pp. 319–330 [3]; Theoret. Comput. Sci. 191(1–2) (1998) 173–193 [6]). Using a protocol that securely computes the Boolean AND function, one can construct a protocol for securely computing any B...

We discuss problems and trade-offs with systems providing anonymity for web browsing (or more generally any communication system that requires low latency interaction). We focus on two main systems: the Freedom network [12] and PipeNet [8]. Although Freedom is efficient and reasonably secure against denial of service attacks, it is vulnerable to so...

Diffie-Hellman key agreement protocol [25] implementations have been plagued by serious security aws. The attacks can be very subtle and, more often than not, haven't been taken into account by protocol designers. In this summary we discuss both theoretical attacks against the Diffie-Hellman key agreement protocol and attacks based on implmentation...

We present here a generalization of the work done by Rabin and Ben-Or in [RB89]. We give a protocol for multiparty computation which tolerates any Q² active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structu...