42 search results - page 3 / 9 » Semi-homomorphic Encryption and Multiparty Computation |
CTRSA
2006
Springer
13 years 9 months ago
2006
Springer
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...
ASIACRYPT
2009
Springer
13 years 12 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
ASIACRYPT
2009
Springer
13 years 12 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
CRYPTO
1997
Springer
13 years 9 months ago
1997
Springer
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
Standard multi-party computation models assume semi-honest behavior, where the majority of participants implement protocols according to specification, an assumption not always pl...