Much of the debate on cryptography has assumed that the real tension is between the state’s desire for effective policing and the privacy of the individual. We argue that this i...
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
Existing software proposals for electronic payments can be divided into "on-line" schemes that require participation of a trusted party (the bank) in every transaction an...
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
Ronald Cramer, Rosario Gennaro, Berry Schoenmakers
Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two string OT, a sender offers two strings, one of which the other party, called the receive...
It has recently been shown that when m > 1 2 n - 1, the nonlinearity Nf of an mth-order correlation immune function f with n variables satisfies the condition of Nf 2n-1 - 2m ,...
The LILI-128 keystream generator is a LFSR based synchronous stream cipher with a 128 bit key. The design offers large period and linear complexity, and is resistant to currently ...
Leonie Ruth Simpson, Ed Dawson, Jovan Dj. Golic, W...
We present and analyze attacks on additive stream ciphers that rely on linear equations that hold with non-trivial probability in plaintexts that are encrypted using distinct keys....
We present a new 128-bit block cipher called Camellia. Camellia supports 128-bit block size and 128-, 192-, and 256-bit keys, i.e. the same interface specifications as the Advanced...