CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly availab...
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators. Such combination generators ha...
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
In order to avoid birthday attacks on message authentication schemes, it has been suggested that one add randomness to the scheme. One must be careful about how randomness is added...
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
Traceability schemes allow detection of at least one traitor when a group of colluders attempt to construct a pirate decoder and gain illegal access to digital content. Fiat and Ta...
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of...