70 search results - page 12 / 14 » An Improved Security Bound for HCTR |
OOPSLA
2007
Springer
15 years 3 months ago
2007
Springer
We present a new technique, early phase termination, for eliminating idle processors in parallel computations that use barrier synchronization. This technique simply terminates ea...
82
Voted
CCS
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we propose a new practical identity-based encryption scheme which is suitable for wireless sensor network (WSN). We call it Receiver-Bounded Online/Offline Identity...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
102
click to vote
STOC
2009
ACM
15 years 10 months ago
2009
ACM
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...