Sciweavers

196 search results - page 39 / 40
» Formally Analysing a Security Protocol for Replay Attacks
Sort
View
100
Voted
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 10 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
ICNP
2007
IEEE
15 years 3 months ago
Location Privacy in Sensor Networks Against a Global Eavesdropper
— While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such information can be c...
K. Mehta, Donggang Liu, Matthew Wright
CCS
2009
ACM
15 years 4 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
CCS
2005
ACM
15 years 3 months ago
On deriving unknown vulnerabilities from zero-day polymorphic and metamorphic worm exploits
Vulnerabilities that allow worms to hijack the control flow of each host that they spread to are typically discovered months before the worm outbreak, but are also typically disc...
Jedidiah R. Crandall, Zhendong Su, Shyhtsun Felix ...
ICALP
2010
Springer
15 years 2 months ago
Concurrent Knowledge Extraction in the Public-Key Model
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
Andrew C. Yao, Moti Yung, Yunlei Zhao