2967 search results - page 217 / 594 » Cryptology |
199
click to vote
CODCRY
2009
Springer
16 years 1 months ago
2009
Springer
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
194
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
174
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
We suggest practical sub-linear size zero-knowledge arguments for statements involving linear algebra. Given commitments to matrices over a finite field, we give a sub-linear siz...
199
click to vote
INDOCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
This paper applies generalized birthday attacks to the FSB compression function, and shows how to adapt the attacks so that they run in far less memory. In particular, this paper p...
201
click to vote
INDOCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Contrary to conventional cryptographic wisdom, the NIST SP 800-56A standard explicitly allows the use of a static key pair in more than one of the key establishment proto...