Sciweavers

1562 search results - page 62 / 313
» Mathematics, Cryptology, Security
Sort
View
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Forward-Secure Signatures with Optimal Signing and Verifying
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
Gene Itkis, Leonid Reyzin
ASIACRYPT
2000
Springer
15 years 2 months ago
A Note on Security Proofs in the Generic Model
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
Marc Fischlin
FSE
1999
Springer
83views Cryptology» more  FSE 1999»
15 years 2 months ago
On the Security of Double and 2-Key Triple Modes of Operation
The DES has reached the end of its lifetime due to its too short key length and block length (56 and 64 bits respectively). As we are awaiting the new AES, triple (and double) encr...
Helena Handschuh, Bart Preneel
PKC
1999
Springer
83views Cryptology» more  PKC 1999»
15 years 2 months ago
On the Security of Random Sources
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
Jean-Sébastien Coron
ASIACRYPT
2006
Springer
15 years 1 months ago
Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...
Satoshi Obana, Toshinori Araki