Sciweavers

144 search results - page 28 / 29
» An Efficient Authentication Protocol for GSM
Sort
View
EUROCRYPT
1995
Springer
14 years 1 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
SRDS
1999
IEEE
14 years 2 months ago
On Diffusing Updates in a Byzantine Environment
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
Dahlia Malkhi, Yishay Mansour, Michael K. Reiter
IJFCS
2006
110views more  IJFCS 2006»
13 years 9 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 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
ICON
2007
IEEE
14 years 4 months ago
A Location-aware Key Predistribution Scheme for Distributed Wireless Sensor Networks
Key establishment plays a central role in authentication and encryption in wireless sensor networks, especially when they are mainly deployed in hostile environments. Because of th...
Ngo Trong Canh, Tran Van Phuong, Young-Koo Lee, Su...