213 search results - page 38 / 43 » Can Homomorphic Encryption be Practical |
HASE
2008
IEEE
14 years 1 months ago
2008
IEEE
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
CSFW
2010
IEEE
13 years 10 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
CARDIS
2006
Springer
13 years 10 months ago
2006
Springer
Massively deploying RFID systems while preserving people's privacy and data integrity is a major security challenge of the coming years. Up to now, it was commonly believed th...
FC
2000
Springer
13 years 10 months ago
2000
Springer
For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
CCS
2010
ACM
13 years 6 months ago
2010
ACM
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...