Sciweavers

227 search results - page 40 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
WISEC
2010
ACM
14 years 2 months ago
On the reliability of wireless fingerprinting using clock skews
Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. B...
Chrisil Arackaparambil, Sergey Bratus, Anna Shubin...
EUROCRYPT
2008
Springer
13 years 9 months ago
Towards Key-Dependent Message Security in the Standard Model
Standard security notions for encryption schemes do not guarantee any security if the encrypted messages depend on the secret key. Yet it is exactly the stronger notion of security...
Dennis Hofheinz, Dominique Unruh
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 26 days ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
FC
2006
Springer
145views Cryptology» more  FC 2006»
13 years 11 months ago
Efficient Correlated Action Selection
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...
CSFW
2002
IEEE
14 years 13 days ago
Capturing Parallel Attacks within the Data Independence Framework
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
Philippa J. Broadfoot, A. W. Roscoe