2846 search results - page 14 / 570 » Not one click for security |
137
Voted
EUROCRYPT
2010
Springer
15 years 8 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
133
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
148
Voted
JNW
2006
15 years 3 months ago
2006
Mobile ad hoc network (MANET) has been generally regarded as an ideal network model for group communications because of its specialty of instant establishment. However, the securit...
103
click to vote
FSE
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC req...
116
click to vote
ACSAC
2002
IEEE
15 years 8 months ago
2002
IEEE
The blooming e-commerce is demanding better methods to protect online users' privacy, especially the credit card information that is widely used in online shopping. Holding a...