There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that o...
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
Many business transactions on the Internet occur between strangers, that is, between entities with no prior relationship and no common security domain. Traditional security approa...
Adam Hess, Jared Jacobson, Hyrum Mills, Ryan Wamsl...
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Emerging applications in electronic commerce often involve very low-cost transactions, which execute in the context of ongoing, extended clientserver relationships. For example, c...
Yossi Matias, Alain J. Mayer, Abraham Silberschatz