Sciweavers

469 search results - page 62 / 94
» On Adversary Models and Compositional Security
Sort
View
ASIACRYPT
2005
Springer
14 years 1 months ago
Spreading Alerts Quietly and the Subgroup Escape Problem
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
James Aspnes, Zoë Diamadi, Kristian Gjø...
CHI
2011
ACM
12 years 11 months ago
Of passwords and people: measuring the effect of password-composition policies
Text-based passwords are the most common mechanism for authenticating humans to computer systems. To prevent users from picking passwords that are too easy for an adversary to gue...
Saranga Komanduri, Richard Shay, Patrick Gage Kell...
ICALP
2007
Springer
14 years 1 months ago
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...
Tal Moran, Moni Naor, Gil Segev
PET
2005
Springer
14 years 1 months ago
An Analysis of Parallel Mixing with Attacker-Controlled Inputs
Parallel mixing [7] is a technique for optimizing the latency of a synchronous re-encryption mix network. We analyze the anonymity of this technique when an adversary can learn the...
Nikita Borisov
CCS
2009
ACM
14 years 2 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal