Sciweavers

1597 search results - page 51 / 320
» Mental Models of Computer Security
Sort
View
ASIACRYPT
2004
Springer
15 years 7 months ago
Strong Conditional Oblivious Transfer and Computing on Intervals
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
Ian F. Blake, Vladimir Kolesnikov
CCS
2008
ACM
15 years 3 months ago
Stale-safe security properties for group-based secure information sharing
Attribute staleness arises due to the physical distribution of authorization information, decision and enforcement points. This is a fundamental problem in virtually any secure di...
Ram Krishnan, Jianwei Niu, Ravi S. Sandhu, William...
CSFW
2007
IEEE
15 years 8 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
15 years 7 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
CHI
2008
ACM
16 years 2 months ago
Security practitioners in context: their activities and interactions
This study investigates the context of interactions of IT security practitioners, based on a qualitative analysis of 30 interviews and participatory observation. We identify nine ...
Rodrigo Werlinger, Kirstie Hawkey, Konstantin Bezn...