Crypto Bibliography

L. O'Connor, On the Distribution of Characteristics in Bijective Mappings, Eurocrypt'93, 360-370. [.pdf]

C. Burwick, D. Coppersmith, E. D'Avignon, R. Gennaro, S. Halevi, C. Jutla, S. Matyas Jr., L. O'Connor, M. Peyravian, D. Safford, and N. Zunic, MARS - a candidate cipher for AES, First AES conference, 1998. [.pdf] [.ps]

L. O'Connor, On the Distribution of Characteristics in Composite Permutations, Crypto '93, pp. 403-412. [.pdf]

H. Petersen, A. Herrigel, J. O'Ruanaidh, S. Pereira, and T. Pun, Secure Copyright Protection Techniques for Digital Images; Proc. Workshop on Information Hiding, April, (1998), 12 Seiten, erscheint in LNCS, Springer. [.ps.zip]

K. Kurosawa, S. Obana, and W. Ogata, t-Cheater Identifiable (k,n) Threshold Secret Sharing Schemes, Advances in Cryptology - CRYPTO '95, LNCS 963 (1995), 410-423. [.ps]

K. Kurosawa and S. Obana, Combinatorial Bounds of Authentication Codes with Arbitration, EUROCRYPT '95, revised version, December 8, 1997. [.ps]

S. Obana and K. Kurosawa, Veto is Impossible in Secret Sharing Schemes, Information Processing Letters, Vol. 58, No 6, 1996, pp. 293-295. [.ps]

K. Kurosawa and S. Obana, Combinatorial Bounds for Authentication Codes with Arbitration, Advances in Cryptology - EUROCYPT '95, LNCS 921, 1995, 289-300. [.ps]

K. Kurosawa and S. Obana, Characterization of (k,n) Multi-Receiver Authentication, Information and Privacy, 2nd Australasian Conference, ACISP'97, LNCS 1270, 1997, pp. 204-215. [.ps]

Y. Desmedt and A. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, Advances in Cryptology - CRYPTO '85, H. C. Williams (ed.), Springer Verlag, Lecture Notes in Computer Science #218, 1986, pp. 516-522. [.pdf] [.ps]

A. Odlyzko, Discrete logarithms and smooth polynomials, Finite Fields: Theory, Applications and Algorithms, G. L. Mullen and P. Shiue, eds., Amer. Math. Soc., Contemporary Math. #168 (1994), pp. 269-278. [.pdf] [.ps]

H. Gilbert, D. Gupta, A. Odlyzko, and J.-J. Quisquater, Attacks on Shamir's 'RSA for paranoids', Information Processing Letters (1998), to appear. [.pdf] [.ps]

A. Odlyzko, Public key cryptography, AT&T Tech. J., 73:5 (Sept.-Oct. 1994), pp. 17-23. [.pdf] [.ps]

P. Flajolet and A. Odlyzko, Random mapping statistics, P. Flajolet and A. Odlyzko, Advances in Cryptology - EUROCRYPT '89, J.-J. Quisquater and J. Vandewalle (eds.), Springer Verlag, Lecture Notes in Computer Science #434 (1990), pp. 329-354. [.pdf] [.ps]

A. Odlyzko, On the complexity of computing discrete logarithms and factoring integers, Open Problems in Communication and Computation, T. M. Cover and B. Gopinath (eds.), Springer, 1987, pp. 113-116. [.pdf] [.ps]

P. Delsarte, Y. Desmedt, A. Odlyzko, and P. Piret, Fast cryptanalysis of the Matsumoto-Imai public key scheme, Advances in Cryptology: Proceedings of EUROCRYPT 84, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985, pp. 142-149. [.pdf] [.ps]

E. Brickell and A. Odlyzko, Cryptanalysis: A survey of recent results, Contemporary Cryptology, G. J. Simmons (ed.), IEEE Press (1991), pp. 501-540. Preliminary version Proc. IEEE 76, 1988, pp. 578-593. [.pdf] [.ps]

A. Odlyzko, The future of integer factorization, CryptoBytes (The technical newsletter of RSA Laboratories) 1 (no. 2) (1995), pp. 5-12. [.pdf] [.ps]

A. Odlyzko, Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's signature scheme, IEEE Trans. Information Theory, IT-30 (1984), pp. 594-601. [.pdf] [.ps]

S. Jarecki and A. Odlyzko, An efficient micropayment system based on probabilistic polling, Financial Cryptography, R. Hirschfeld, ed., Lecture Notes in Computer Science #1318, Springer, 1997, pp. 173-191. [.pdf] [.ps]

M. Coster, A. Joux, B. LaMacchia, A. Odlyzko, C. Schnorr, and J. Stern, Improved low-density subset sum algorithms, Computational Complexity 2 (1992), pp. 111-128. [.pdf] [.ps]

A. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology: Proceedings of EUROCRYPT 84, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985, pp. 224-314. [.pdf] [.ps]

B. LaMacchia and A. Odlyzko, Solving large sparse linear systems over finite fields, Advances in Cryptology - CRYPTO '90, A. J. Menezes and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537 (1991), pp. 109-133. [.pdf] [.ps]

M. Coster, B. LaMacchia, A. Odlyzko, and C. Schnorr, An improved low-density subset sum algorithm, Advances in Cryptology - EUROCRYPT '91, D. W. Davies (ed.), Springer Verlag, Lecture Notes in Computer Science #547 (1991), pp. 54-67. [.pdf] [.ps]

A. Odlyzko, The rise and fall of knapsack cryptosystems, Cryptology and Computational Number Theory, C. Pomerance (ed.), Am. Math. Soc., Proc. Symp. Appl. Math. #42 (1990), pp. 75-88. [.pdf] [.ps]

B. LaMacchia and A. Odlyzko, Computation of discrete logarithms in prime fields, Designs, Codes, and Cryptography 1 (1991), pp. 46-62. Extended abstract in Advances in Cryptology - CRYPTO '90, A. J. Menezes, and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537, 1991, pp. 616-618. [.pdf] [.ps]

K. Kurosawa, K. Okada, K. Sakano, W. Ogata, and S. Tsujii, Nonperfect Secret Sharing Schemes and Matroids, Advances in Cryptology - EUROCRYPT '93, LNCS 765, 1993, 126-141. [.ps]

C. Blundo, A. De Santis, K. Kurosawa, and W. Ogata, On a Fallacious Bound for Authentication Codes, Journal of Cryptology. [.ps]

W. Ogata and K. Kurosawa, Some new results on nonperfect secret sharing scheme, Technical Report, ISEC95-44, Dec. 1995. [.ps]

W. Ogata, K. Kurosawa, K. Sako, and K. Takatani, Fault Tolerant Anonymous Channel, Proceedings of ICICS '97, LNCS 1334, 1997, pp. 440-444. [.ps]

K. Kurosawa, S. Obana, and W. Ogata, t-Cheater Identifiable (k,n) Threshold Secret Sharing Schemes, Advances in Cryptology - CRYPTO '95, LNCS 963 (1995), 410-423. [.ps]

W. Ogata and K. Kurosawa, Optimum Secret Sharing Scheme Secure against Cheating, Advances in Cryptology - EUROCRYPT '96, LNCS 1070, 1996, pp. 200-211. [.ps]

K. Okada, W. Ogata, K. Sakano, and K. Kurosawa, Analysis on Secret Sharing Schemes with Non-graphical Access Structures, IEICE Trans., Vol.E80-A, No. 1, 1997, 85-89. [.ps]

K. Kurosawa and W. Ogata, Efficient Rabin-type Digital Signature Scheme, Designs, Codes and Cryptography. [.ps]

W. Ogata and K. Kurosawa, Some Basic Properties of General Nonperfect Secret Sharing Schemes, Journal of Universal Computer Science, Vol. 4, No. 8, 1998, 690-704 [.ps]

K. Kurosawa, Y. Katayama, and W. Ogata, Reshufflable and laziness tolerant mental card game protocol, IEICE Trans., Vol.E80-A, No. 1, 1997, pp. 72-78. (Preliminary version appeared in Advances in Cryptology - EUROCRYPT '90, LNCS 473 (1990), 374-388. [.ps]

S. Oh, S. Kim, and D. Won, On the security of cryptographic techniques based on D.L.P., Proc. of KIPS'98, Korea Information Processing Society Fall Conference, Vol.5/No.2, 1998, pp.745-748. [.pdf]

S. Kim, S. Oh, S. Park, and D. Won, Cryptanalysis and Enhancement of Saeednia's Key-Exchange Protocols, Proceeding of KICS'98, Korean Institute of Communication Sciences Summer Conference, Vol.17/No.2, 1998, pp. 1001--1004. [.ps]

S. Kim, S.H. Oh, S. Park, and D. Won, Verifiable Self-Certified Public Keys, Proc. of WCC'99, INRIA Workshop on Coding and Cryptography, January 1999. [.zip]

S. Kim, S.H. Oh, K.K. Kim, and D. Won, One-Time Self-Certified Public Keys, Revisited, Proc. of ICISC'98, International Conference on Information Security and Cryptology, Vol.1/No.1, 1998, pp.59-69 ; ISBN 89-85305-14-X. [.zip]

K. Kurosawa and K. Okada, Combinatorial Lower Bounds for Secret Sharing Schemes, Information Processing Letters, Vol.60, No. 6, 1996, pp. 301-304. (Preliminary version appeared in Advances in Cryptology - ASIACRYPT '94, LNCS 917, 1995, pp. 55-66.) [.ps]

K. Kurosawa, K. Okada, and S. Tsujii, Low Exponent Attack against Elliptic Curve RSA, Information Processing Letters, Vol. 53, No. 2, 1995, 77-83. (Preliminary version appeared in Advances in Cryptology - ASIACRYPT '94, LNCS 917, 1995, 376-386.) [.ps]

K. Kurosawa, K. Okada, and K. Sakano, Security of the Center in Key Distribution Schemes, Advances in Cryptology - ASIACRYPT 94, LNCS 917 (1995), 333-341. [.ps]

K. Kurosawa, K. Okada, H. Saido, and D. Stinson, New combinatorial bounds for authentication codes and key predistribution schemes, Designs, Codes and Cryptography. [.ps]

K. Okada and K. Kurosawa, Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes, Advances in Cryptology - ASIACRYPT '94, LNCS 917 (1995), 33-41. [.ps]

K. Kurosawa, K. Okada, H. Saido, and D. Stinson, New combinatorial bounds for authentication codes and key predistribution schemes, Designs, Codes and Cryptography, v.15, no.1, 1998, pp. 87-100. [.ps]

K. Kurosawa, K. Okada, H. Saido, and D. Stinson, New combinatorial bounds for authentication codes and key predistribution schemes, Designs, Codes and Cryptography, v. 15, no. 1, 1998, pp. 87--100. [.ps]

K. Kurosawa, K. Okada, K. Sakano, W. Ogata, and S. Tsujii, Nonperfect Secret Sharing Schemes and Matroids, Advances in Cryptology - EUROCRYPT '93, LNCS 765, 1993, 126-141. [.ps]

K. Okada and K. Kurosawa, MDS Secret Sharing Schemes Secure against Cheaters, Proc. of IEEE ISIT'97, 1997, p. 90. [.ps]

K. Okada, W. Ogata, K. Sakano, and K. Kurosawa, Analysis on Secret Sharing Schemes with Non-graphical Access Structures, IEICE Trans., Vol.E80-A, No. 1, 1997, 85-89. [.ps]

I. Damgård, O. Goldreich, T. Okamoto, and A. Wigderson, Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs; (Extended Abstract), September 1995. [.ps]
See also partial version by Damgård, Goldreich, and Wigderson, November 1994. [.ps]

H. Ong, C. Schnorr, Fast Signature Generation with a Fiat Shamir-Like Scheme, Advances in Cryptology - Eurocrypt '90, Lecture Notes in Computer Science, Vol.473, Springer Verlag, pp.432-440,1991. [.ps] [.ps.gz]

R. Bar-Yehuda, B. Chor, E. Kushilevitz, and A. Orlitsky, Privacy, Additional Information, and Communication, IEEE IT 39(6), 1993, pp. 1930-1943. [.ps.Z]

A. Ort, R. Aßmann, G. Bleumer, M. Böttger, D. Fox, A. Pfitzmann, B. Pfitzmann, and M. Waidner, Schutz in verteilten Systemen durch Kryptologie - Ein Praktikum im Informatik-Hauptstudium; Datenschutz und Datensicherung DuD 16/11 (1992) 571-579. [.ps.gz]

O. Goldreich, R. Ostrovsky, and E. Petrank, Computational Complexity and Knowledge Complexity; revised March 1995. [.ps]

D. Beaver, J. Feigenbaum, R. Ostrovsky, and V. Shoup, Instance-Hiding Proof Systems; submitted for journal publication. Available as DIMACS Technical Report 93-65, Rutgers University, Piscataway, 1993. [.ps.Z]

O. Goldreich and R. Ostrovsky, Software Protection and Simulation on Oblivious RAMs; revised October 1995. [.ps]

R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosén, Randomness vs. Fault-Tolerance, PODC 97. [.ps.Z]

E. Kushilevitz and R. Ostrovsky, Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval, FOCS 97. [.ps.Z]

A. Juels, M. Luby, and R. Ostrovsky, Security of Blind Digital Signatures, Crypto '97. [.ps]

E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and Completeness in Multi-Party Private Computations, FOCS 94. [.ps.Z]

E. Kushilevitz, R. Ostrovsky, and A. Rosén, Characterizing Linear Size Circuits in Terms of Privacy, STOC 96. [.ps.Z]

Schneier.com is a personal website. Opinions expressed are not necessarily those of BT Counterpane.