Sciweavers

1059 search results - page 98 / 212
» Modeling Security Protocols as Games
Sort
View
ASIACRYPT
2008
Springer
15 years 2 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 16 days ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
EUROCRYPT
2004
Springer
15 years 5 months ago
Public-Key Steganography
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
Luis von Ahn, Nicholas J. Hopper
MOBIHOC
2005
ACM
16 years 2 days ago
A secure ad-hoc routing approach using localized self-healing communities
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
Jiejun Kong, Xiaoyan Hong, Yunjung Yi, Joon-Sang P...
TMC
2012
13 years 2 months ago
Secure Initialization of Multiple Constrained Wireless Devices for an Unaided User
—A number of protocols and mechanisms have been proposed to address the problem of initial secure key deployment in wireless networks. Most existing approaches work either with a...
Toni Perkovic, Mario Cagalj, Toni Mastelic, Nitesh...