A.5 Journal of Cryptology papers

Journal of Cryptology papers (Volume 1 No.1 - Volume 9 No.3, 1988-1996)

M. Abadi, J. Feigenbaum, Secure circuit evaluation, 2 (1990), 1-12.

C. Adams, S. Tavares, The structured design of cryptographically good S-Boxes, 3 (1990), 27-41.

G.B. Agnew, T. Beth, R.C. Mullin, S.A. Vanstone, Aritlmietic operations in GF(2"‘), 6 (1993), 3-13. G.B. Agnew, R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone, An implementation fora fast public-key cryptosystem, 3 (1991), 63-79.

P. Beauchemin, G. Brassard, A eeneralization of Heilman’s extension to Shannon’s approach to cryptography, 1 (1988), 129-131.

P. Beauchemin, G. Brassard, C. Crepeau, C. Goutier, C. Pomerance, The generation of random numbers that are probably prime, 1 (1988), 53-64.

D. Beaver, Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority, 4

(1991) , 75-122.

M. Bellare, M. Yung, Certifying permutations: noninteractive zero-knowledge based on any trapdoor permutation, 9 (1996), 149-166.

I. Ben-Aroya, E. Biham, Differential cryptanalysis of Lucifer, 9 (1996), 21-34.

S. Bengio, G. Brassard, Y.G. Desmedt, C. Goutier, J.-J. Quisquater, Secure implementation of identification systems, 4 (1991), 175-183.

C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, J. Smolin, Experimental quantum cryptography, 5

(1992) , 3-28.

E. Biham, New types of ciypranalytic attacks usmg related keys, 7 (1994), 229-246.

E. Biham, A. Shamir, Differential cryptanalysis of DES-like cryptosystems, 4 (1991), 3-72.

S. Blackburn, S. Murphy, J. Stem, The cryptanalysis of a public-key implementation of finite group mappings, 8 (1995), 157-166.

C. Blundo, A. De Santis, D.R. Stinson, U. Vaccaro, Graph decompositions and secret sharing schemes. 8 (1995), 39-64.

J. Boyar, Infernng sequences produced by a linear congruential generator missing low-order bits. 1 (1989),

177-184.

J. Boyar, K. Friedl, C. Lund, Practical zero-knowledge proofs: Giving lunts and using deficiencies, 4 (1991), 185-206.

J. Boyar, C. Lund, R. Peralta, On the communication complexity of zero-knowledge proofs, 6 (1993), 65- 85.

J.F. Boyar, S.A. Kurtz, M.W. Krentel, A discrete logaritlnn implementation of perfect zero-knowledge blobs, 2 (1990), 63-76.

E.F. Brickell, D.M. Davenport, On the classification of ideal secret sharing schemes, 4 (1991), 123-134.

E.F. Brickell, K.S. McCurley, An interactive identification scheme based on discrete logaritlnns and factoring, 5 (1992), 29-39.

E.F. Brickell, D.R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, 5 (1992), 153-166.

J. Buchmann, H.C. Williams, A key-exchange system based on imaginary quadratic Gelds, 1 (1988), 107— 118.

R. M. Capocelli, A. De Santis, L. Gargano, U. Vaccaro. On the size of shares for secret sharing schemes, 6

(1993), 157-167.

D. Chaum, The dinins cryptographers problem: Unconditional sender and recipient untraceability, 1 (1988), 65-75.

B. Chor, M. Gereb-Graus, E. Kushilevitz, On the structure of the privacy hierarchy, 1 (1994), 53-60.

B. Chor, E. Kushilevitz, Secret sharing over infinite domains, 6 (1993), 87-95.

D. Coppersmith, Modifications to the number held sieve, 6(1993), 169-180.

Z.-D. Dai, Binary' sequences derived from ML-Sequences over rinss, I: Periods and minimal polynomials. 5 (1992), 193-207.

D.W. Davies, S. Murphy, Pairs and triplets ofDES S-boxes, 8 (1995), 1-25.

A. De Santis, G. Persiano, The power of preprocessms in zero-knowledse proofs of knowledse, 9 (1996),

129-148.

M. De Soete, New bounds and constructions for authentication/secrecy codes with splittins. 3 (1991), 173-186.

M. Dyer, T. Fenner, A. Frieze, A. Thomason, On key storage in secure networks, 8 (1995), 189-200.

S. Even, O. Goldreich, S. Micali, On-line/off-line digital signatures, 9 (1996), 35-67.

J. -H. Evertse, E. van Heijst, Which new RSA-signamres can be computed from certain given RSA-

signatures?, 5 (1992), 41-52.

U. Feige, A. Fiat, A. Shamir, Zero-knowledge proofs of identity', 1 (1988), 77-94.

M. Fischer, R. Wright, Bounds on secret key exchange using a random deal of cards, 9 (1996), 71-99.

M. J. Fischer, S. Micali, C. Rackoff, A secure protocol for the oblivious transfer, 9 (1996), 191-195.

R. Forre, Methods and instruments for designing S-Boxes, 2(1990), 115-130.

K. Gaarder, E. Snekkenes, Applying a formal analysis technique to the CCITT X.509 strong two-way au

thentication protocol, 3 (1991), 81-98.

J. Georgiades, Some remarks on the security of the identification scheme based on permuted kernels, 5 (1992), 133-137.

P. Godlewski, C. Mitchell, Key-minimal cryptosystems for unconditional secrecy, 3 (1990), 1-25.

O. Goldreich, A uniform-complexity treatment of encryption and zero-knowledge, 6 (1993), 21-53.

O. Goldreich, A. Kalian. How to construct constant-round zero-knowledse proof systems forNP. 9 (1996), 167-189.

O. Goldreich, E. Kushilevitz, A perfect zero-knowledge proof system for a problem equivalent to the discrete logaritlun, 6 (1993), 97-116.

O. Goldreich, Y. Oren, Definitions and properties of zero-knowledge proof systems, 7 (1994), 1-32.

J. Golic, Correlation properties of a general binary combiner with memory, 9 (1996), 111-126.

J. Golic, M. Mihaljevic, A generalized correlation attack on a class of stream ciphers based on the Leven- shtein distance, 3 (1991), 201-212.

L. Gong, D.J. Wheeler, A matrix key-distribution scheme, 2 (1990), 51-59.

S. Haber, W.S. Stometta, How to time-stamp a digital document, 3 (1991), 99-111.

H. Heys, S. Tavares, Substitution-permutation networks resistant to differential and linear cryptanalysis. 9 (1996), 1-19.

M. Ito, A. Saito, T. Nishizeki, Multiple assignment scheme for sharing secret, 6 (1993), 15-20.

T. Itoh, M. Hoshi, S. Tsujii, A low communication competitive interactive proof system for promised

quadratic residuosity, 9 (1996), 101-109.

B. S. Kaliski Jr., One-way permutations on elliptic curt'es, 3 (1991), 187-199.

B.S. Kaliski Jr., R.L. Rivest, A.T. Sherman, Is the Data Encryption Standard a group? (Results of cycling experiments on DES), 1 (1988), 3-36.

R. Kenunerer, C. Meadows, J. Millen. Three systems for cryptosraphic protocol analysis. 7 (1994), 79-

130.

A. Klapper. The mlnerabihty of seometric sequences based on fields of odd characteristic. 7 (1994), 33- 51.

N. Koblitz, Hyperelliptic cryptosystems, 1 (1989), 139-150.

N. Koblitz, Elliptic curve implementation of zero-knowledge blobs, 4 (1991), 207-213.

A.K. Lenstra, Y. Yacobi, User impersonation in key certification schemes, 6 (1993), 225-232.

H.W. Lenstra Jr., On the Chor-Rivest knapsack cryptosystem, 3 (1991), 149-155.

S. Lloyd, Counting binary- functions with certain cryptographic properties, 5 (1992), 107-131.

J.H. Loxton, D.S.P. Klioo, G.J. Bird, J. Seberry, A cubic RSA code equivalent to factorization. 5 (1992), 139-150.

M. Luby, C. Rackoff, A study of password security, 1 (1989), 151-158.

S.S. Magliveras, N.D. Memon, Algebraic properties of cryptosystem PGM, 5 (1992), 167-183.

S.M. Matyas, Key processing with control vectors, 3 (1991), 113-136.

U. Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher, 5 (1992), 53-66.

U. Maurer, A universal statistical test for random bit generators, 5 (1992), 89-105.

U. Maurer, Fast seneration of prime numbers and secure public-key cryptographic parameters, 8 (1995), 123-155.

U. Maurer, J.L. Massey, Local randomness in pseudorandom sequences, 4 (1991), 135-149.

U. Maurer, J.L. Massey, Cascade ciphers: The importance of being first, 6 (1993), 55-61.

K.S. McCurley, A key distribution system equivalent to factoring, 1 (1988), 95-105.

W. Meier, O. Staffelbach, Fast correlation attacks on certain stream ciphers, 1 (1989), 159-176.

W. Meier, O. Staffelbach, Correlation properties of combiners with memory in stream ciphers, 5 (1992), 67-86.

A. Menezes, S. Vanstone, Elliptic curve cryptosystems and their implementation, 6 (1993), 209-224.

R. C. Merkle, A fast software one-way hash function, 3 (1990), 43-58.

S. Micali, C.P. Schnorr, Efficient, perfect polynomial random number generators, 3 (1991), 157-172.

C. Mitchell, Enumerating Boolean functions of cryptographic significance, 2 (1990), 155-170.

S. Murphy, The cryptanalysis of FEAL-4 with 20 chosen plamtexts, 2 (1990), 145-154.

S. Murphy, K. Paterson, P. Wild, A weak cipher that generates the symmetric group, 7 (1994), 61-65.

M. Naor, Bit commitment using pseudorandoumess, 4(1991), 151-158.

H. Niederreiter, A combinatorial approach to probabilistic results on the linear-complexity profile of random sequences, 2(1990), 105-112.

K. Nishimura, M. Sibuya, Probabihty to meet in the middle, 2 (1990), 13-22.

K. Nyberg, L.R. Knudsen, Provable security against a differential attack, 8 (1995), 27-37.

L. O'Connor, An analysis of a class of algoritluns for S-box construction, 1 (1994), 133-151.

L. O’Connor, On the distribution of characteristics in bijective mappings, 8 (1995), 67-86.

L. O’Connor, A. Klapper, Algebraic nonlinearity and its applications to cryptography, 1 (1994), 213-227. G. Orton, L. Peppard, S. Tavares, A design of a fast pipelined modular multiplier based on a diminished-

radix algorithm, 6 (1993), 183-208.

J. Pastor, CRYPTOPOST™-a cryptographic application to mail processing. 3 (1991), 137-146.

D. Pei, Information-theoretic bounds for authentication codes and block designs, 8 (1995), 177-188.

S.J. Phillips, N.C. Phillips, Strongly ideal secret sharing schemes, 5 (1992), 185-191.

F. Piper, M. Walker, Linear ciphers and spreads, 1 (1989), 185-188.

M. Qu, S.A. Vanstone, Factorizations in the elementary abehan p-sroup and their cryptographic sisnifi-

cance, 7 (1994), 201-212.

U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, 6 (1993), 135-156.

A. Russell, Necessary and sufficient conditions for collision-free hashing, 8 (1995), 87-99.

R. Scheidler, J.A. Buchmann, H.C. Williams, A key-exchanse protocol usins real quadratic fields, 7

(1994), 171-199.

C. P. Schnorr, Efficient signature generation by smart cards, 4(1991), 161-174.

A.W. Schrift, A. Shamir, Universal tests for nonuniform distributions, 6 (1993), 119-133.

G. J. Simmons, A cartesian product construction for unconditionally secure authentication codes that permit

arbitration, 2 (1990), 77-104.

G.J. Simmons, Proof of soundness (integrity) of cryptographic protocols, 7 (1994), 69-77.

D. R. Stinson, A construction for authentication/secrecy codes from certain combinatorial designs, 1

(1988), 119-127.

D.R. Stinson, Some constructions and bounds for authentication codes, 1 (1988), 37-51.

D.R. Stinson, The combinatorics of authentication and secrecy codes, 2 (1990), 23-49.

D.R. Stinson, J.L. Massey, An infinite class of counterexamples to a conjecmre concerning nonlinear resilient functions, 8 (1995), 167-173.

S. -H. Teng, Functional inversion and communication complexity, 7 (1994), 153-170.

M. Tompa, H. Woll, How to share a secret with cheaters, 1 (1988), 133-138.

S.A. Vanstone, R.J. Zuccherato, Short RSA keys and their generation, 8 (1995), 101-114.

M. Walker, Information-theoretic bounds for authentication schemes, 2 (1990), 131-143.

Y.-X. Yang. B. Guo, Further enumerating boolean functions of cryptographic significance, 8 (1995), 115— 122.

 
Source
< Prev   CONTENTS   Source   Next >