Sciweavers

45 search results - page 3 / 9
» (Unconditional) Secure Multiparty Computation with Man-in-th...
Sort
View
FOCS
2006
IEEE
13 years 11 months ago
Cryptography from Anonymity
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...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
CTRSA
2006
Springer
118views Cryptology» more  CTRSA 2006»
13 years 9 months ago
Stand-Alone and Setup-Free Verifiably Committed Signatures
Abstract. In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signat...
Huafei Zhu, Feng Bao
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 5 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
11 years 8 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
JOC
2000
95views more  JOC 2000»
13 years 5 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer