CANS
2008
Springer
13 years 7 months ago
2008
Springer
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
CANS
2008
Springer
13 years 7 months ago
2008
Springer
ded abstract of this paper appeared in Proceedings of the 7th International Conference on Cryptology and Network Security (CANS '08) December 2
CANS
2008
Springer
13 years 7 months ago
2008
Springer
CANS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Ever-growing mobility and ubiquitous wireless Internet access raise the need for secure communication with devices that may be severely constrained in terms of processing...
CANS
2008
Springer
13 years 7 months ago
2008
Springer
Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss, allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into an encryption of the sa...
CANS
2008
Springer
13 years 7 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
CANS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Wireless sensors are low power devices which are highly constrained in terms of computational capabilities, memory, and communication bandwidth. While battery life is the...
CANS
2008
Springer
13 years 7 months ago
2008
Springer
We propose a message recognition protocol which is suitable for ad hoc pervasive networks without the use of hash chains. Hence, we no longer require the devices to save values of ...
CANS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The main contribution of this paper is a new iterated secretkey block cipher called 3D, inspired by the AES cipher. The 3D cipher has an SPN design, operates on 512-bit b...