2237 search results - page 35 / 448 » On the Security of Random Sources |
CHES
1999
Springer
15 years 2 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
PROVSEC
2007
Springer
15 years 3 months ago
2007
Springer
We propose a secure threshold signature scheme without trusted dealer. Our construction is based on the recently proposed signature scheme of Waters in EUROCRYPT’05. The new thre...
87
Voted
TIT
2010
14 years 4 months ago
2010
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
ISPEC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
MOBISYS
2005
ACM
15 years 9 months ago
2005
ACM
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...