Sciweavers

INDOCRYPT
2003
Springer
13 years 9 months ago
Security Analysis of Several Group Signature Schemes
At Eurocrypt’91, Chaum and van Heyst introduced the concept of group signature. In such a scheme, each group member is allowed to sign messages on behalf of a group anonymously. ...
Guilin Wang
INDOCRYPT
2003
Springer
13 years 9 months ago
Analysis of Non-fortuitous Predictive States of the RC4 Keystream Generator
The RC4 stream cipher is the most widely used software based stream cipher. It is based on a secret internal state of N = 256 bytes and two pointers. This paper proposes an efficie...
Souradyuti Paul, Bart Preneel
INDOCRYPT
2003
Springer
13 years 9 months ago
On Multiplicative Linear Secret Sharing Schemes
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
INDOCRYPT
2003
Springer
13 years 9 months ago
Practical Mental Poker Without a TTP Based on Homomorphic Encryption
A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-ga...
Jordi Castellà-Roca, Josep Domingo-Ferrer, ...
INDOCRYPT
2003
Springer
13 years 9 months ago
On the Construction of Prime Order Elliptic Curves
We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber po...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
INDOCRYPT
2003
Springer
13 years 9 months ago
Improved Cost Function in the Design of Boolean Functions Satisfying Multiple Criteria
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
Selçuk Kavut, Melek D. Yücel
INDOCRYPT
2003
Springer
13 years 9 months ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
Tetsu Iwata, Kaoru Kurosawa
INDOCRYPT
2003
Springer
13 years 9 months ago
Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both propos...
P. J. Abisha, D. G. Thomas, K. G. Subramanian