977 search results - page 6 / 196 » Secure Computation with Fixed-Point Numbers |
111
click to vote
SACRYPT
1998
Springer
15 years 6 months ago
1998
Springer
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
112
Voted
RTA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
126
Voted
ACSAC
2003
IEEE
15 years 8 months ago
2003
IEEE
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
126
click to vote
CRYPTO
2001
Springer
15 years 7 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
116
click to vote
CISC
2009
Springer
15 years 13 days ago
2009
Springer
Abstract. ESSENCE is a family of cryptographic hash functions, accepted to the first round of NIST's SHA-3 competition. This paper presents the first known attacks on ESSENCE....