189 search results - page 2 / 38 » On Unconditionally Secure Computation with Vanishing Communi... |
CRYPTO
2004
Springer
13 years 11 months ago
2004
Springer
Unconditionally secure multi-party computations in general, and broadcast in particular, are impossible if any third of the players can be actively corrupted and if no additional i...
EUROCRYPT
2000
Springer
13 years 9 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
ISCI
2008
13 years 5 months ago
2008
Most modern cryptographic studies design cryptosystems and algorithms using mathematical concepts. In designing and analyzing cryptosystems and protocols, mathematical concepts ar...
JOC
2007
13 years 5 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
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...