1564 search results - page 213 / 313 » Security in Practice - Security-Usability Chasm |
IFIP
2009
Springer
14 years 7 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
DATE
2010
IEEE
15 years 3 months ago
2010
IEEE
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
PAISI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
EUROCRYPT
2009
Springer
15 years 10 months ago
2009
Springer
The fair evaluation and comparison of side-channel attacks and countermeasures has been a long standing open question, limiting further developments in the field. Motivated by this...