Sciweavers

ASIACRYPT
1999
Springer
14 years 3 months ago
Periodical Multi-secret Threshold Cryptosystems
A periodical multi-secret threshold cryptosystem enables a sender to encrypt a message by using a cyclical sequence of keys which are shared by n parties and periodically updated. ...
Masayuki Numao
ASIACRYPT
1999
Springer
14 years 3 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
ASIACRYPT
1999
Springer
14 years 3 months ago
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jian...
ASIACRYPT
1999
Springer
14 years 3 months ago
Approximation Hardness and Secure Communication in Broadcast Channels
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
Yvo Desmedt, Yongge Wang
ASIACRYPT
1999
Springer
14 years 3 months ago
Doing More with Fewer Bits
We present a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical Diffie-Hellman scheme, while the offered secu...
Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheu...
ASIACRYPT
1999
Springer
14 years 3 months ago
Equivalent Keys of HPC
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
Carl D'Halluin, Gert Bijnens, Bart Preneel, Vincen...
ASIACRYPT
1999
Springer
14 years 3 months ago
ECC: Do We Need to Count?
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
Jean-Sébastien Coron, Helena Handschuh, Dav...
AFRICACRYPT
2010
Springer
14 years 3 months ago
Information-Theoretically Secure Key-Insulated Multireceiver Authentication Codes
Takenobu Seito, Tadashi Aikawa, Junji Shikata, Tsu...
ACNS
2010
Springer
156views Cryptology» more  ACNS 2010»
14 years 3 months ago
COP: A Step toward Children Online Privacy
We propose COP, a client-side system for protecting children’s online privacy and empowering parental control over children’s information disclosure with little manual effort. ...
Wei Xu, Sencun Zhu, Heng Xu
CRYPTO
2000
Springer
108views Cryptology» more  CRYPTO 2000»
14 years 4 months ago
Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
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...
Muxiang Zhang, Agnes Hui Chan