Sciweavers

239 search results - page 46 / 48
» Approaches to Formal Verification of Security Protocols
Sort
View
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
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
TMC
2012
12 years 12 months ago
Protecting 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...
Kiran Mehta, Donggang Liu, Matthew Wright
WOSP
2005
ACM
15 years 3 months ago
From UML to LQN by XML algebra-based model transformations
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Gordon Ping Gu, Dorina C. Petriu
JAR
2000
145views more  JAR 2000»
14 years 9 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro