A~3-codes Under Collusion Attacks (Englisch)
- Neue Suche nach: Wang, Y. J.
- Neue Suche nach: Safavi-Naini, R.
- Neue Suche nach: Wang, Y. J.
- Neue Suche nach: Safavi-Naini, R.
- Neue Suche nach: Lam, K. Y.
- Neue Suche nach: Okamoto, E.
- Neue Suche nach: Xing, C.
In:
ASIACRYPT '99: Theory and application of cryptology and information security
1716
;
390-398
;
1999
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Print
-
Titel:A~3-codes Under Collusion Attacks
-
Beteiligte:
-
Kongress:International conference; 5th, ASIACRYPT '99: Theory and application of cryptology and information security ; 1999 ; Singapore
-
Erschienen in:LECTURE NOTES IN COMPUTER SCIENCE , 1716 ; 390-398
-
Verlag:
- Neue Suche nach: Springer-Verlag
-
Erscheinungsort:Berlin
-
Erscheinungsdatum:01.01.1999
-
Format / Umfang:9 pages
-
ISBN:
-
ISSN:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Print
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Modulus Search for Elliptic Curve CryptosystemsKoyama, K. / Tsuruoka, Y. / Kunihiro, N. et al. | 1999
- 8
-
On the Lai-Massey SchemeVaudenay, S. et al. | 1999
- 20
-
On Cryptographically Secure Vectorial Boolean FunctionsSatoh, T. / Iwata, T. / Kurosawa, K. et al. | 1999
- 29
-
Analysis Equivalent Keys of HPCD'Halluin, C. / Bijnens, G. / Preneel, B. / Rijmen, V. et al. | 1999
- 43
-
Cryptanalysis of Five Rounds of CRYPTON Using Impossible DifferentialsSeki, H. / Kaneko, T. et al. | 1999
- 52
-
Cryptanalysis of Two Cryptosystems Based on Group ActionsBlackburn, S. R. / Galbraith, S. D. et al. | 1999
- 62
-
Probabilistic Higher Order Differential Attack and Higher Order Bent FunctionsIwata, T. / Kurosawa, K. et al. | 1999
- 75
-
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite FieldHan, Y. F. / Leong, P.-C. / Tan, P.-C. / Zhang, J. et al. | 1999
- 86
-
Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic CurvesShikata, J. / Zheng, Y. / Suzuki, J. / Imai, H. et al. | 1999
- 103
-
Speeding up the Discrete Log Computation on Curves with AutomorphismsDuursma, I. / Gaudry, P. / Morain, F. et al. | 1999
- 122
-
ECC: Do We Need to Count?Coron, J.-S. / Handschuh, H. / Naccache, D. et al. | 1999
- 135
-
Elliptic Scalar Multiplication Using Point HalvingKnudsen, E. W. et al. | 1999
- 150
-
On the Design of RSA with Short Secret ExponentSun, H.-M. / Yang, W.-C. / Laih, C.-S. et al. | 1999
- 165
-
Efficient Public-Key Cryptosystems Provably Secure Against Active AdversariesPaillier, P. / Pointcheval, D. et al. | 1999
- 180
-
Adaptively-Secure Optimal-Resilience Proactive RSAFrankel, Y. / MacKenzie, P. / Yung, M. et al. | 1999
- 195
-
Factorization of RSA-140 Using the Number Field SieveCavallar, S. / Dodson, B. / Lenstra, A. / Leyland, P. et al. | 1999
- 208
-
How to Prove that a Committed Number Is PrimeLe, T. V. / Nguyen, K. Q. / Varadharajan, V. et al. | 1999
- 219
-
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite FieldsHuehnlein, D. / Takagi, T. et al. | 1999
- 232
-
General Adversaries in Unconditional Multi-party ComputationFitzi, M. / Hirt, M. / Maurer, U. et al. | 1999
- 247
-
Approximation Hardness and Secure Communication in Broadcast ChannelsDesmedt, Y. / Wang, Y. et al. | 1999
- 258
-
Mix-Networks on Permutation NetworksAbe, M. et al. | 1999
- 274
-
Secure Communication in an Unknown Network Using CertificatesBurmester, M. / Desmedt, Y. et al. | 1999
- 288
-
Linear Complexity versus Pseudorandomness: On Beth and Dai's ResultWang, Y. et al. | 1999
- 299
-
A Class of Explicit Perfect Multi-sequencesXing, C. P. / Lam, K. Y. / Wei, Z. H. et al. | 1999
- 306
-
Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining FunctionPalit, S. / Roy, B. K. et al. | 1999
- 321
-
Doing More with Fewer BitsBrouwer, A. E. / Pellikaan, R. / Verheul, E. R. et al. | 1999
- 333
-
A Quick Group Key Distribution Scheme with "Entity Revocation"Anzai, J. / Matsuzaki, N. / Matsumoto, T. et al. | 1999
- 348
-
An Efficient Hierachical Identity-Based Key-Sharing Method Resistant Against Collusion-AttacksHanaoka, G. / Nishioka, T. / Zheng, Y. / Imai, H. et al. | 1999
- 363
-
Periodical Multi-secret Threshold CryptosystemsNumao, M. et al. | 1999
- 378
-
A Signature Scheme with Message Recovery as Secure as Discrete LogarithmAbe, M. / Okamoto, T. et al. | 1999
- 390
-
A~3-codes Under Collusion AttacksWang, Y. J. / Safavi-Naini, R. et al. | 1999
- 399
-
Broadcast Authentication in Group CommunicationSafavi-Naini, R. / Wang, H. X. et al. | 1999