33 search results - page 3 / 7 » Public-Key Encryption with Lazy Parties |
EUROCRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...
ASIACRYPT
2007
Springer
14 years 4 months ago
2007
Springer
We consider a new model for online secure computation on encrypted inputs in the presence of malicious adversaries. The inputs are independent of the circuit computed in the sense ...
IACR
2011
12 years 9 months ago
2011
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not...
IACR
2011
12 years 9 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
ASIACRYPT
2004
Springer
14 years 3 months ago
2004
Springer
Secret handshakes were recently introduced [BDS+ 03] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member ca...