146 search results - page 14 / 30 » Homomorphic encryption from codes |
CCS
2010
ACM
13 years 7 months ago
2010
ACM
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
Compression of encrypted data can be achieved by employing Slepian-Wolf coding (SWC). However, how to efficiently exploit the source dependency in an encrypted colored signal such...
EUROCRYPT
2010
Springer
14 years 12 days ago
2010
Springer
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
XML Encryption was standardized by W3C in 2002, and is implemented in XML frameworks of major commercial and open-source organizations like Apache, redhat, IBM, and Microsoft. It ...
FC
2006
Springer
13 years 11 months ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...