42 search results - page 6 / 9 » Semi-homomorphic Encryption and Multiparty Computation |
CCS
2009
ACM
14 years 2 months ago
2009
ACM
Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation i...
IJNSEC
2006
13 years 7 months ago
2006
This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumpt...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
CCS
2009
ACM
14 years 8 months ago
2009
ACM
In distributed systems users need the ability to share sensitive content with multiple other recipients based on their ability to satisfy arbitrary policies. One such system is el...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...