Sciweavers

1064 search results - page 140 / 213
» Cryptography from Anonymity
Sort
View
WS
2006
ACM
14 years 3 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
CRYPTO
2000
Springer
151views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
New Public-Key Cryptosystem Using Braid Groups
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups ca...
Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo...
SPW
2000
Springer
14 years 27 days ago
The Resurrecting Duckling - What Next?
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
Frank Stajano
IEEESP
2006
130views more  IEEESP 2006»
13 years 9 months ago
Securing Embedded Systems
t a single security abstraction layer, but rather is a roblem spanning multiple abstraction levels. We use an embedded biometric authentication device to demonstratethenecessityofa...
David Hwang, Patrick Schaumont, Kris Tiri, Ingrid ...
TCC
2010
Springer
231views Cryptology» more  TCC 2010»
14 years 6 months ago
A Domain Extender for the Ideal Cipher
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
Jean-Sébastien Coron, Yevgeniy Dodis, Avrad...