ASIACRYPT A

33 papers

YearTitle / Authors
1999A
Yejing Wang, Reihaneh Safavi-Naini
1999A Class of Explicit Perfect Multi-sequences.
Chaoping Xing, Kwok-Yan Lam, Zhenghong Wei
1999A Quick Group Key Distribution Scheme with "Entity Revocation".
Jun Anzai, Natsume Matsuzaki, Tsutomu Matsumoto
1999A Signature Scheme with Message Recovery as Secure as Discrete Logarithm.
Masayuki Abe, Tatsuaki Okamoto
1999Adaptively-Secure Optimal-Resilience Proactive RSA.
Yair Frankel, Philip D. MacKenzie, Moti Yung
1999Advances in Cryptology - ASIACRYPT '99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings
Kwok-Yan Lam, Eiji Okamoto, Chaoping Xing
1999An Efficient Hierarchical Identity-Based Key-Sharing Method Resistant against Collusion-Attacks.
Goichiro Hanaoka, Tsuyoshi Nishioka, Yuliang Zheng, Hideki Imai
1999Approximation Hardness and Secure Communication in Broadcast Channels.
Yvo Desmedt, Yongge Wang
1999Broadcast Authentication in Group Communication.
Reihaneh Safavi-Naini, Huaxiong Wang
1999Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials.
Haruki Seki, Toshinobu Kaneko
1999Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function.
Sarbani Palit, Bimal K. Roy
1999Cryptanalysis of Two Cryptosystems Based on Group Actions.
Simon R. Blackburn, Steven D. Galbraith
1999Doing More with Fewer Bits.
Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheul
1999ECC: Do We Need to Count?
Jean-Sébastien Coron, Helena Handschuh, David Naccache
1999Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries.
Pascal Paillier, David Pointcheval
1999Elliptic Scalar Multiplication Using Point Halving.
Erik Woodward Knudsen
1999Equivalent Keys of HPC.
Carl D'Halluin, Gert Bijnens, Bart Preneel, Vincent Rijmen
1999Factorization of RSA-140 Using the Number Field Sieve.
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Paul Zimmermann
1999Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field.
Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jiang Zhang
1999General Adversaries in Unconditional Multi-party Computation.
Matthias Fitzi, Martin Hirt, Ueli M. Maurer
1999How to Prove That a Committed Number Is Prime.
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
1999Linear Complexity versus Pseudorandomness: On Beth and Dai's Result.
Yongge Wang
1999Mix-Networks on Permutation Networks.
Masayuki Abe
1999Modulus Search for Elliptic Curve Cryptosystems.
Kenji Koyama, Yukio Tsuruoka, Noboru Kunihiro
1999On Cryptographically Secure Vectorial Boolean Functions.
Takashi Satoh, Tetsu Iwata, Kaoru Kurosawa
1999On the Design of RSA with Short Secret Exponent.
Hung-Min Sun, Wu-Chuan Yang, Chi-Sung Laih
1999On the Lai-Massey Scheme.
Serge Vaudenay
1999Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves.
Junji Shikata, Yuliang Zheng, Joe Suzuki, Hideki Imai
1999Periodical Multi-secret Threshold Cryptosystems.
Masayuki Numao
1999Probabilistic Higher Order Differential Attack and Higher Order Bent Functions.
Tetsu Iwata, Kaoru Kurosawa
1999Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields.
Detlef Hühnlein, Tsuyoshi Takagi
1999Secure Communication in an Unknown Network Using Certificates.
Mike Burmester, Yvo Desmedt
1999Speeding up the Discrete Log Computation on Curves with Automorphisms.
Iwan M. Duursma, Pierrick Gaudry, François Morain