2001_appendix.pdf

This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van

Oorschot, and S. Vanstone, CRC Press, 1996.

For further information, see www.cacr.math.uwaterloo.ca/hac

CRC Press has granted the following specic permissions for the electronic version of this

book:

Permission is granted to retrieve, print and store a single copy of this chapter for

personal use. This permission does not extend to binding multiple chapters of

the book, photocopying or producing copies for other than personal use of the

person creating the copy, or making electronic copies available for retrieval by

others without prior permission in writing from CRC Press.

Except where over-ridden by the specic permission above, the standard copyright notice

from CRC Press applies to this electronic version:

Neither this book nor any part may be reproduced or transmitted in any form or

by any means, electronic or mechanical, including photocopying, microlming,

and recording, or by any information storage or retrieval system, without prior

permission in writing from the publisher.

The consent of CRC Press does not extend to copying for general distribution,

for promotion, for creating new works, or for resale. Specic permission must be

obtained in writing from CRC Press for such copying.

1997 by CRC Press, Inc.

Appendix A

BibliographyofPapersfrom

SelectedCryptographicForums

Contents in Brief

A.1

Asiacrypt/Auscrypt Proceedings :::::::::::::::::: 663

A.2

Crypto Proceedings ::::::::::::::::::::::::: 667

A.3

Eurocrypt Proceedings ::::::::::::::::::::::: 684

A.4

Fast Software Encryption Proceedings ::::::::::::::: 698

A.5

Journal of Cryptology papers

::::::::::::::::::::

700

A.1 Asiacrypt/Auscrypt Proceedings

Advances in Cryptology – AUSCRYPT ’90 . Springer-Verlag LNCS 453 (1990).

Editors: J. Seberry and J. Pieprzyk.

V.S. Alagar, Range equations and range matrices: A study in statistical database security, 360–385.

M. Ames, Secure cryptographic initialization, 451–462.

M.H.G. Anthony, K.M. Martin, J. Seberry, P. Wild, Some remarks on authentication systems, 122–139.

L. Brown, J. Pieprzyk, J. Seberry, LOKI – a cryptographic primitive for authentication and secrecy appli-

cations, 229–236.

L. Brown, J. Seberry, Key scheduling in DES type cryptosystems, 221–228.

J.M. Carroll, The three faces of information security, 433–450.

D. Chaum, Showing credentials without identiﬁcation: Transferring signatures between unconditionally

unlinkable pseudonyms, 246–264.

R.H. Cooper, W. Patterson, RSA as a benchmark for multiprocessor machines, 356–359.

Z.-D. Dai, K. Zeng, Continued fractions and Berlekamp-Massey algorithm, 24–31.

E. Dawson, B. Goldburg, Universal logic sequences, 426–432.

C. Ding, Lower bounds on the weight complexities of cascaded binary sequences, 39–43.

R. Ferreira, The practical application of state of the art security inreal environments, 334–355.

K. Gaarder, E. Snekkenes, On the formal analysis of PKCS authentication protocols, 106–121.

W. Geiselmann, D. Gollmann, VLSIdesign for exponentiation inGF (2 n ), 398–405.

M. Girault, A (non-practical) three-pass identiﬁcation protocol using coding theory, 265–272.

G. Guang, Nonlineargeneratorsofbinarysequences withcontrollablecomplexity anddouble key, 32–36.

H. Gustafson, E. Dawson, B. Caelli, Comparison of block ciphers, 208–220.

T. Hardjono, Record encryption in distributed databases, 386–395.

B. Hayes, Anonymous one-time signatures and ﬂexible untraceable electronic cash, 294–305.

663

664

BibliographyofPapersfromSelectedCryptographicForums

C.J.A. Jansen, D.E. Boekee, A binary sequence generator based on Ziv-Lempel source coding, 156–164.

C.J.A. Jansen, D.E. Boekee, On the signiﬁcance of the directed acyclic word graph in cryptology, 318–

326.

S.J. Knapskog, Formal speciﬁcation and veriﬁcation of secure communication protocols, 58–73.

K. Koyama, Direct demonstration of the power to break public-key cryptosystems, 14–21.

P.J. Lee, Secure user access control for public networks, 46–57.

R.Lidl,W.B.Muller, A note on strong Fibonacci pseudoprimes, 311–317.

A. Menezes, S. Vanstone, The implementation of elliptic curve cryptosystems, 2–13.

M.J. Mihaljevic, J.D. Golic, A fast iterative algorithm for a shift register initial state reconstruction given

the noisy output sequence, 165–175.

H. Morita, A fast modular-mulitplication module for smart cards, 406–409.

M. Newberry, Minos: Extended user authentication, 410–423.

K. Ohta, K. Koyama, Meet-in-the-middle attack on digital signature schemes, 140–154.

J. Pieprzyk, X.-M. Zhang, Permutation generators of alternating groups, 237–244.

R. Safavi-Naini, Parallel generation of pseudo-random sequences, 176–193.

H. Shizuya, K. Koyama, T. Itoh, Demonstrating possession without revealing factors and its application,

273–293.

J.C.A. van der Lubbe, D.E. Boekee, KEYMEX: An expert system for the design of key management sch-

emes, 96–103.

V. Varadharajan, Network security policy models, 74–95.

Y. Y. X i a n , Dyadic matrices and their potential signiﬁcance in cryptography, 308–310.

Y. Y. X i a n , K-M sequence is forwardly predictable, 37–38.

K. Zeng, M. Huang, Solving equations in sequences, 327–332.

K. Zeng, C.H. Yang, T.R.N. Rao, Large primes in stream cipher cryptography, 194–205.

Advances in Cryptology – ASIACRYPT ’91 . Springer-Verlag LNCS 739 (1993).

Editors: H. Imai, R.L. Rivest, and T. Matsumoto.

J. Brandt, I. Damgard, P. Landrock, Speeding up prime number generation, 440–449.

L. Brown, M. Kwan, J. Pieprzyk, J. Seberry, Improving resistance to differential cryptanalysis and the re-

design of LOKI, 36–50.

J. Daemen, Limitations of the Even-Mansour construction, 495–498.

J. Daemen, A. Bosselaers, R. Govaerts, J. Vandewalle, Collisions for Schnorr’s hash function FFT-Hash

presented at Crypto’91, 477–480.

J. Daemen, R. Govaerts, J. Vandewalle, A framework for the design of one-way hash functions including

cryptanalysis of Damgard’s one-way function based on a cellular automaton, 82–96.

D.W. Davies, The transition from mechanisms to electronic computers, 1940 to 1950, 1–21.

Y. Desmedt, M. Burmester, An efﬁcient zero-knowledge scheme for the discrete logarithm based on

smooth numbers, 360–367.

S. Even, Y. Mansour, A construction of a cipher from a single pseudorandom permutation, 210–224.

J. Feigenbaum, R. Ostrovsky, Anoteonone-prover, instance-hiding zero-knowledge proofsystems, 352–

359.

L. Fortnow, M. Szegedy, On the power of two-local random reductions, 346–351.

B. Goldburg, E. Dawson, S. Sridharan, A secure analog speech scrambler using the discrete cosine trans-

form, 299–311.

L. Harn, H.-Y. Lin, Anoblivioustransferprotocolanditsapplicationfortheexchangeofsecrets, 312–320.

T. Itoh, K. Sakurai, On the complexity of constant round ZKIP of possession of knowledge, 331–345.

T. Itoh, K. Sakurai, H. Shizuya, Any language in IP has a divertible ZKIP, 382–396.

A. Joux, J. Stern, Cryptanalysis of another knapsack cryptosystem, 470–476.

T. Kaneko, A known-plaintext attack of FEAL-4 based on the system of linear equations on difference,

485–488.

K. Kim, Construction of DES-like S-boxes based on Boolean functions satisfying the SAC, 59–72.

A. Klapper, M. Goresky, Revealing information withpartial period correlations, 277–287.

L.R. Knudsen, Cryptanalysis of LOKI, 22–35.

M. Kwan, Simultaneousattacksindifferentialcryptanalysis(gettingmorepairsperencryption), 489–492.

1997 by CRC Press, Inc. — See accompanying notice at front of chapter.

xA.1 Asiacrypt/AuscryptProceedings

665

M. Kwan, J. Pieprzyk, A general purpose technique for locating key scheduling weaknesses in DES-like

cryptosystems, 237–246.

C.-S. Laih, L. Harn, Generalized threshold cryptosystems, 159–166.

C.-S. Laih, S.-M. Yen, L. Harn, Two efﬁcient server-aided secret computation protocols based on the ad-

dition sequence, 450–459.

H.-Y.Lin,L.Harn, A generalized secret sharing scheme with cheater detection, 149–158.

J. Meijers, J. van Tilburg, Extendedmajorityvotingandprivate-keyalgebraic-codeencryptions, 288–298.

A. Miyaji, On ordinary elliptic curve cryptosystems, 460–469.

H. Miyano, A method to estimate the number of ciphertext pairs for differential cryptanalysis, 51–58.

J.-I. Mizusawa, IC-cards and telecommunication services, 253–264.

S. Mjølsnes, Privacy, cryptographic pseudonyms, and the state of health, 493–494.

H. Morita, K. Ohta, S. Miyaguchi, Results of switching-closure-test on FEAL, 247–252.

W. Ogata, K. Kurosawa, On claw free families, 111–123.

K. Ohta, T. Okamoto, A digital multisignature scheme based on the Fiat-Shamir scheme, 139–148.

T. Okamoto, An extension of zero-knowledge proofs and its applications, 368–381.

J. Pieprzyk, B. Sadeghiyan, Optimal perfect randomizers, 225–236.

M.Y. Rhee, Research activities on cryptology in Korea, 179–193.

R.L. Rivest, Cryptography and machine learning, 427–439.

R.L. Rivest, On NIST’sproposed digital signature standard, 481–484.

B. Sadeghiyan, J. Pieprzyk, On necessary and sufﬁcient conditions for the construction of super pseudo-

random permutations, 194–209.

B. Sadeghiyan, Y. Zheng, J. Pieprzyk, Howtoconstructafamilyofstrongone-waypermutations, 97–110.

R. Safavi-Naini, Feistel type authentication codes, 167–178.

T. Saito, K. Kurosawa, K. Sakurai, 4 move perfect ZKIP of knowledge with no assumption, 321–330.

A. Shimbo, S.-I. Kawamura, Cryptanalysis of several conference key distribution schemes, 265–276.

C. Shu, T. Matsumoto, H. Imai, Amulti-purposeproofsystem–foridentityandmembershipproofs, 397–

411.

M.-J. Toussaint, Formal veriﬁcation of probabilistic properties in cryptographic protocols, 412–426.

J.-H. Yang, Z.-D. Dai, K.-C. Zeng, The data base of selected permutations, 73–81.

Y. Zheng, T. Hardjono, J. Pieprzyk, Sibling intractable function families and their applications, 124–138.

Advances in Cryptology – AUSCRYPT ’92 . Springer-Verlag LNCS 718 (1993).

Editors: J. Seberry and Y. Zheng.

M. Bertilsson, I. Ingemarsson, Aconstructionofpracticalsecretsharingschemesusinglinearblockcodes,

67–79.

M. Cerecedo, T. Matsumoto, H. Imai, Non-interactive generation of shared pseudorandom sequences,

385–396.

C.-C. Chang, T.-C. Wu, C.-P. Chen, The design of a conference key distribution system, 459–466.

C. Charnes, J. Pieprzyk, Linear nonequivalence versus nonlinearity, 156–164.

L. Condie, Prime generation with the Demytko-Miller-Trbovich algorithm, 413–421.

E. Dawson, Cryptanalysis of summation generator, 209–215.

Y. D e s m e d t , Threshold cryptosystems, 3–14.

Y. Desmedt, J. Seberry, Practical proven secure authentication with arbitration, 27–32.

J. Detombe, S.E. Tavares, Constructing large cryptographically strong S-boxes, 165–181.

A. Fujioka, T. Okamoto, K. Ohta, A practical secret voting scheme for large scale elections, 244–251.

T. Hardjono, Y. Zheng, A practical digital multisignature scheme based on discrete logarithms, 122–132.

L. Harn, S. Yang, Group-oriented undeniable signature schemes without the assistance of a mutually

trusted party, 133–142.

L. Harn, S. Yang, Public-key cryptosystem based on the discrete logarithm problem, 469–476.

A.P.L. Hiltgen, Construction of feebly-one-way families of permutations, 422–434.

W.-A. Jackson, K.M. Martin, Cumulative arrays and geometric secret sharing schemes, 48–55.

A. Klapper, The vulnerability of geometric sequences based on ﬁelds of odd characteristic, 327–338.

L.R. Knudsen, Cryptanalysis of LOKI91, 196–208.

Handbook of Applied Cryptography by A. Menezes, P. van Oorschot and S. Vanstone.

666

BibliographyofPapersfromSelectedCryptographicForums

V. Korzhik, V. Yakovlev, Nonasymptotic estimates of information protection efﬁciency for the wire-tap

channel concept, 185–195.

X. Lai, R.A. Rueppel, J. Woollven, A fast cryptographic checksum algorithm based on stream ciphers,

339–348.

C.-S. Laih, S.-M. Yen, Secure addition sequence and its applications on the server-aided secret computa-

tion protocols, 219–230.

R.Lidl,W.B.Muller, Primalitytesting withLucas functions, 539–542.

C.H. Lim, P.J. Lee, Modiﬁed Maurer-Yacobi’s scheme and its applications, 308–323.

T. Matsumoto, H. Imai, C.-S. Laih, S.-M. Yen, On veriﬁable implicit asking protocols for RSA computa-

tion, 296–307.

M. Mihaljevic, An approach to the initial state reconstruction of a clock-controlled shift register based on

a novel distance measure, 349–356.

A. Miyaji, Ellipticcurves over

F p suitable for cryptosystems, 479–491.

B.B. Nieh, S.E. Tavares, Modelling and analyzing cryptographic protocols using Petri nets, 275–295.

W. Ogata, K. Kurosawa, S. Tsujii, Nonperfect secret sharing schemes, 56–66.

C.M. O’Keefe, A comparison of key distribution patterns constructed from circle geometries, 517–527.

J.C. Pailles, New protocols for electronic money, 263–274.

M. Portz, A generalized description of DES-based and Benes-based permutation generators, 397–409.

B. Preneel, R. Govaerts, J. Vandewalle, AnattackontwohashfunctionsbyZheng-Matsumoto-Imai, 535–

538.

B. Preneel, R. Govaerts, J. Vandewalle, On the power of memory in the design of collision resistant hash

functions, 105–121.

M. Rezny, E. Trimarchi, Ablockciphermethodusingcombinationsofdifferentmethodsunderthecontrol

of the user key, 531–534.

R. Safavi-Naini, L. Tombak, Authentication codes under impersonation attack, 35–47.

K. Sakurai, T. Itoh, On bit correlations among preimages of “many to one” one-way functions – anew ap-

proach to study on randomness and hardness of one-way functions, 435–446.

K. Sakurai, T. Itoh, Subliminalchannelsforsignaturetransferandtheirapplicationtosignaturedistribution

schemes, 231–243.

T. Satoh, K. Kurosawa, S. Tsujii, Privacy for multi-partyprotocols, 252–260.

J. Sauerbrey, A modular exponentiation unit based on systolic arrays, 505–516.

J. Seberry, X.-M. Zhang, Highly nonlinear 0-1 balanced Boolean functions satisfying strict avalanche cri-

terion, 145–155.

J. Snare, Information technology security standards – an Australian perspective, 367–384.

L. Tombak, R. Safavi-Naini, Authentication codes withperfect protection, 15–26.

C.P. Waldvogel, J.L. Massey, The probability distribution of the Difﬁe-Hellmankey, 492–504.

J.-H. Yang, Z.-D. Dai, Construction ofm-ary de Bruijn sequences, 357–363.

S.-M.Yen,C.-S.Laih, The fast cascade exponentiation algorithm and its applications on cryptography,

447–456.

Y. Zheng, J. Pieprzyk, J. Seberry, HAVAL – a one-way hashing algorithm with variable length of output,

83–104.

E. Zuk, Remarks on “The design of a conference key distribution system”, 467–468.

Advances in Cryptology – ASIACRYPT ’94 . Springer-Verlag LNCS 917 (1995).

Editors: J. Pieprzyk and R. Safavi-Naini.

M. Abe, H. Morita, Higherradixnonrestoring modularmultiplicationalgorithmandpublic-key LSIarchi-

tecture with limited hardware resources, 365–375.

M. Alabbadi, S.B. Wicker, A digital signature scheme based on linear error-correcting block codes, 238–

248.

D. Atkins, M. Graff, A.K. Lenstra, P.C. Leyland, ThemagicwordsareSQUEAMISHOSSIFRAGE, 263–

277.

D. Beaver, Factoring: The DNA solution, 419–423.

P. B ´eguin, J.-J. Quisquater, Secure acceleration of DSS signatures using insecure server, 249–259.

T. Beth, Multifeature security through homomorphic encryption, 1–17.

E. Biham, Cryptanalysis of multiple modes of operation, 278–292.

1997 by CRC Press, Inc. — See accompanying notice at front of chapter.

Plik z chomika:

Inne pliki z tego folderu:

Inne foldery tego chomika: