53 search results - page 9 / 11 » The Exact Round Complexity of Secure Computation |
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
IWSEC
2009
Springer
13 years 12 months ago
2009
Springer
Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differ...
ICARCV
2008
IEEE
13 years 11 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
LISA
1994
13 years 6 months ago
1994
Managing large scale UNIX networks so that users can use resources on multiple systems is traditionally performed using NIS, NFS, and DNS. Proper use of these tools requires exact...
ACNS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Statistical Saturation Attacks have been introduced and applied to the block cipher PRESENT at CT-RSA 2009. In this paper, we consider their natural extensions. First, we...