Sciweavers

5475 search results - page 611 / 1095
» Model Driven Security
Sort
View
CAI
2007
Springer
15 years 6 months ago
On High-Rate Cryptographic Compression Functions
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...
Richard Ostertág, Martin Stanek
SOUPS
2005
ACM
16 years 12 days ago
Johnny 2: a user test of key continuity management with S/MIME and Outlook Express
Secure email has struggled with signifcant obstacles to adoption, among them the low usability of encryption software and the cost and overhead of obtaining public key certificat...
Simson L. Garfinkel, Robert C. Miller
174
Voted
IEICET
2006
108views more  IEICET 2006»
15 years 6 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
240
Voted
CCS
2011
ACM
14 years 6 months ago
Automatic error finding in access-control policies
Verifying that access-control systems maintain desired security properties is recognized as an important problem in security. Enterprise access-control systems have grown to prote...
Karthick Jayaraman, Vijay Ganesh, Mahesh V. Tripun...
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 7 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin