Crypto Bibliography

O. Kömmerling and M. Kuhn, Design Principles for Tamper-Resistant Smartcard Processors, Proceedings of the USENIX Workshop on Smartcard Technology (Smartcard '99), Chicago, Illinois, USA, May 10-11, 1999, USENIX Association, pp. 9-20, ISBN 1-880446-34-0. [.pdf]

H. Fujii, W. Kachen, and K. Kurosawa, Combinatorial bounds and design of broadcast authentication, IEICE Trans., Vol.E79-A, No. 4, 1996, pp. 502-506. [.ps]

O. Goldreich and A. Kahan, How to Construct Constant-Round Zero-Knowledge Proof Systems for NP; March 1996. [.ps]

R. Kailar, V. Gligor, and L. Gong, On the Security Effectiveness of Cryptographic Protocols, Proceedings of the 4th IFIP Working Conference on Dependable Computing for Critical Applications, San Diego, California, January 1994, pp. 90-101. [.ps.gz]

V. Gligor, R. Kailar, S. Stubblebine, and L. Gong, Logics for Cryptographic Protocols -- Virtues and Limitations, Proceedings of the IEEE Computer Security Foundations Workshop IV, Franconia, New Hampshire, June, 1991, pp. 219-226. [.ps.gz]

A. Kaldewaij and B. Schoenmakers, The Derivation of a Tighter Bound for Top-Down Skew Heaps; Information Processing Letters 37 (1991) 265-271. [.ps.gz]

A. Kaldewaij and B. Schoenmakers, Searching by Elimination; Science of Computer Programming 14 (1990) 243-254. [.ps.gz]

D. Bleichenbacher, B. Kaliski, and J. Staddon, Recent results on PKCS #1: RSA encryption standard [.pdf], RSA Laboratories' bulletin #7, June 1998. [.pdf] [.ps]

V. Shoup and E. Kaltofen, Faster polynomial factorization over high algebraic extensions of finite fields; in Proc. 1997 International Symposium on Symbolic and Algebraic Computation. [.ps.Z]

V. Shoup and E. Kaltofen, Subquadratic-time factorization of polynomials over finite fields; in Proc. 27th ACM Symposium on Theory of Computation, 1995, Mathematics of Computation, 1998. [.ps.Z]

T. Baldin, G. Bleumer, and R. Kanne, CryptoManager - Eine intuitive Programmierschnittstelle für kryptographische Systeme; Sicherheitsschnittstellen - Konzepte, Anwendungen und Einsatzbeispiele, Proc. Workshop Security Application Programming Interfaces 94, Deutscher Universitäts Verlag, München 1994, 79-94. [.ps.gz]

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]

J.-P. Katoen and B. Schoenmakers, Systolic Arrays for the Recognition of Permutation-Invariant Segments; Science of Computer Programming 27 (1996) 119-137. [.ps.gz]

J.-P. Katoen and B. Schoenmakers, Recognizing Perfect-Shuffles [.ps.gz]

J. Katz and B. Schneier, A Chosen Ciphertext Attack against Several E-Mail Encryption Protocols, J. Katz and B. Schneier, 9th USENIX Security Symposium, 2000.

M. Abadi, M. Burrows, C. Kaufman, and B. Lampson, Authentication and Delegation with Smart-Cards, Science of Computer Programming 21, 2 (October 1993), 93-113. [.ps]

A. Blum, M. Furst, M. Kearns, and R. Lipton, Cryptographic Primitives Based on Hard Learning Problems, Advances in Cryptology -- CRYPTO 93, Lecture Notes in Computer Science #773, pages 278-291, Springer-Verlag, 1994. [.ps.Z]

J. Kelsey, B. Schneier, D. Wagner, and C. Hall, Cryptanalytic Attacks on Pseudorandom Number Generators, Fast Software Encryption, Fifth International Workshop Proceedings (March 1998), Springer-Verlag, 1998, pp. 168-188.

J. Kelsey and B. Schneier, Conditional Purchase Orders, 4th ACM Conference on Computer and Communications Security, ACM Press, April 1997, pp. 117-124.

B. Schneier and J. Kelsey, Unbalanced Feistel Networks and Block Cipher Design, Fast Software Encryption, Third International Workshop Proceedings (February 1996), Springer-Verlag, 1996, pp. 121-144.

J. Kelsey and B. Schneier, Minimizing Bandwidth for Remote Access to Cryptographically Protected Audit Logs, Second International Workshop on the Recent Advances in Intrusion Detection (RAID '99), September 1999.

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, and N. Ferguson, Performance Comparison of the AES Submissions, Proc. Second AES Candidate Conference, NIST, March 1999, pp. 15-34.

D. Wagner, B. Schneier, and J. Kelsey, Cryptanalysis of the Cellular Message Encryption Algorithm, Advances in Cryptology--CRYPTO '97 Proceedings, Springer-Verlag, August 1997, pp. 526-537.

B. Schneier, J. Kelsey, and J. Walker, Distributed Proctoring, ESORICS 96 Proceedings, Springer-Verlag, September 1996, pp. 172-182.

C. Hall, J. Kelsey, B. Schneier, and D. Wagner, Cryptanalysis of SPEED (Extended Abstract), Financial Cryptography '98, Springer-Verlag, 1998, 309-310.

B. Schneier and J. Kelsey, A Peer-to-Peer Software Metering System, The Second USENIX Workshop on Electronic Commerce Proceedings, USENIX Press, November 1996, pp. 279-286.

B. Schneier and J. Kelsey, Secure Audit Logs to Support Computer Forensics, ACM Transactions on Information and System Security, v. 2, n. 2, May 1999, pp. 159-176.

J. Kelsey, B. Schneier, and D. Wagner, Mod n Cryptanalysis, with Applications Against RC5P and M6, Fast Software Encryption, Sixth International Workshop Proceedings (March 1999), Springer-Verlag, 1999, pp. 139-155.

J. Kelsey and B. Schneier, The Street Performer Protocol, The Third USENIX Workshop on Electronic Commerce Proceedings, USENIX Press, November 1998.

N. Ferguson, D. Whiting, B. Schneier, J. Kelsey, S. Lucks, and T. Kohno, Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive, Proceedings of Fast Software Encryption 2003, to appear.

T. Kohno, J. Kelsey, and B. Schneier, Preliminary Cryptanalysis of Reduced-Round Serpent, Proceedings of the Third AES Candidate Conference, April 2000, pp. 195-211.

D. Coppersmith, D. Wagner, B. Schneier, and J. Kelsey, Cryptanalysis of TwoPrime, Fast Software Encryption, Fifth International Workshop Proceedings (March 1998), Springer-Verlag, 1998, 32-48.

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, N. Ferguson, T. Kohno, M. Stay, The Twofish Team's Final Comments on AES Selection, May 15, 2000.

B. Schneier and J. Kelsey, Cryptographic Support for Secure Logs on Untrusted Machines, The Seventh USENIX Security Symposium Proceedings, USENIX Press, January 1998, 53-62.

J. Kelsey, B. Schneier, and D. Wagner, Protocol Interactions and the Chosen Protocol Attack, Security Protocols, 5th International Workshop April 1997 Proceedings, Springer-Verlag, 1998, pp. 91-104.

B. Schneier and J. Kelsey, Remote Auditing of Software Outputs Using a Trusted Coprocessor, Journal of Future Generation Computer Systems, v.13, n.1, 1997, pp. 9-18.

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, and C. Hall, On the Twofish Key Schedule, Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, pp. 27-42.

B. Schneier and J. Kelsey, Automatic Event Stream Notarization Using Digital Signatures, Security Protocols, International Workshop April 1996 Proceedings, Springer-Verlag, 1997, pp. 155-169.

J. Kelsey, Key Separation in Twofish, Twofish Technical Report #7, April 7, 2000.

N. Ferguson, J. Kelsey, B. Schneier, and D. Whiting, A Twofish Retreat: Related-Key Attacks Against Reduced-Round Twofish, Twofish Technical Report #6, February 14, 2000.

J. Kelsey and B. Schneier, Key-Schedule Cryptanalysis of DEAL, Sixth Annual Workshop on Selected Areas in Cryptography (SAC 99), Springer Verlag, 2000, pp. 118-134.

J. Kelsey and B. Schneier, Authenticating Secure Tokens Using Slow Memory Access, First USENIX Symposium on Smart Cards, USENIX Press.

N. Ferguson, J. Kelsey, B. Schneier, M. Stay, D. Wagner, and D. WHiting, Improved Cryptanalysis of Rijndael, Proceedings of the Seventh Fast Software Encryption Workshop, Springer-Verlag, 2001, pp. 213-230.

C. Hall, J. Kelsey, B. Schneier, and D. Wagner, Building Pseudo-Random Functions from Pseudo-Random Permutations, Advances in Cryptology--CRYPTO '98 Proceedings, Springer-Verlag, August 98, 370-389.

J. Kelsey, B. Schneier, and D. Wagner, Related-Key Cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA, ICICS '97 Proceedings, Springer-Verlag, November 1997, pp. 233-246.

J. Kelsey, B. Schneier, D. Wagner, and C. Hall, Side Channel Cryptanalysis of Product Ciphers, ESORICS '98 Proceedings, Springer-Verlag, September 1998, 97-110.

J. Kelsey, B. Schneier, and D. Wagner, Key-Schedule Cryptanalysis of 3-WAY, IDEA, G-DES, RC4, SAFER, and Triple-DES, Advances in Cryptology--CRYPTO '96 Proceedings, Springer-Verlag, August 1996, pp. 237-251.

J. Kelsey, B. Schneier, C. Hall, and D. Wagner, Secure Applications of Low-Entropy Keys, 1997 Information Security Workshop (ISW'97), Proceedings (September 1997), Springer-Verlag, 1998, pp. 121-134.

C. Hall, J. Kelsey, V. Rijmen, B. Schneier, and D. Wagner, Cryptanalysis of SPEED, Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, pp. 318-338.

J. Kelsey, T. Kohno, and B. Schneier, Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent, Proceedings of the Seventh Fast Software Encryption Workshop, Springer-Verlag, Springer-Verlag, 2001, pp. 7-93.

D. Whiting, J. Kelsey, B. Schneier, D. Wagner, N. Ferguson, and C. Hall, Further Observations on the Key Schedule of Twofish, Twofish Technical Report #4, March 16, 1999.

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, and N. Ferguson, New Results on the Twofish Encryption Algorithm, Second AES Candiate Conference, April 1999.

J. Kelsey, B. Schneier, and Key Schedule Weakness in SAFER+, Second AES Candiate Conference, April 1999.

J. Kelsey and B. Schneier, MARS Attacks! Preliminary Cryptanalysis of Reduced-Round MARS Variants, Proceedings of the Third AES Candidate Conference, April 2000, pp. 169-185.

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, and N. Ferguson, Twofish: A 128-Bit Block Cipher, 15 June 1998.

J. Kelsey, B. Schneier, and C. Hall, An Authenticated Camera, 12th Annual Computer Security Applications Conference, ACM Press, December 1996, pp. 24-30.

J. Kelsey and B. Schneier, Authenticating Outputs of Computer Software Using a Cryptographic Coprocessor, Proceedings 1996 CARDIS, September 1996, pp. 11-24.

J. Kelsey, B. Schneier, and N. Ferguson, and Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator, Sixth Annual Workshop on Selected Areas in Cryptography (SAC 99), Springer Verlag, 2000, pp. 13-33.

D. Wagner, L. Simpson, E. Dawson, J. Kelsey, W. Millan and B. Schneier, Cryptanalysis of ORYX, Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, pp. 296-305.

M. Blaze, J. Ioannidis, and A. Keromytis, Trust Management and Network-Layer Security Protocols [.ps], 1999 Cambridge Protocols Workshop, Cambridge, April 1999. [.ps] [.tex]

M. Blaze, J. Feigenbaum, J. Ioannidis, and A. Keromytis, The KeyNote Trust Management System, Version 2. RFC-2704. IETF, September 1999. [.txt]

M. Blaze, J. Feigenbaum, J. Ioannidis, and A. Keromytis, The Role of Trust Management in Distributed Systems Security, Secure Internet Programming: Security Issues for Mobile and Distributed Objects, ed. Vitek and Jensen, Springer-Verlag, 1999. [.pdf] [.ps]

M. Blaze, J. Feigenbaum, and A. Keromytis, KeyNote: Trust Management for Public-Key Infrastructures (Position Paper), in Proceedings of the 1998 Cambridge University Security Protocols International Workshop, Springer, Berlin, to appear. [.ps]

N. Daswani, D. Boneh, H. Gracia-Molina, S. Ketchpel, and A. Paepcke, A Generalized Wallet Architecture, Proceedings of the 3rd USENIX Workshop on Electronic Commerce, 1998.

C. Crépeau and J. Kilian, Achieving oblivious transfer using weakened security assumptions; In 29th Symp. on Found. of Computer Sci., pages 42-52. IEEE, 1988. [.ps.gz]

J. Kilian and P. Rogaway, How to protect DES against exhaustive key search; Advances in Cryptology - CRYPTO '96, Lecture Notes in Computer Science, Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996, pp. 252-267. [.ps] [.ps.gz]

C. Crépeau and J. Kilian, Weakening security assumptions and oblivious transfer; In S. Goldwasser, editor, Advances in Cryptology: Proceedings of Crypto '88, volume 403 of Lecture Notes in Computer Science, pages 2-7. Springer-Verlag, 1990. [.ps.gz]

D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, Security with Low Communication Overhead (extended abstract), Advances in Cryptology - Crypto '90 Proceedings, Springer-Verlag, 1991, 62-76. [.pdf]

M. Bellare, J. Kilian, and P. Rogaway, The security of the cipher block chaining message authentication code; Advances in Cryptology - CRYPTO '94, Lecture Notes in Computer Science, Vol. 839. Y. Desmedt, ed., Springer-Verlag, 1994. Extended abstract in Advances in Cryptology -- Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed, Springer-Verlag, 1994.

D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, Locally Random Reductions: Improvements and Applications, Journal of Cryptology, 10 (1997), pp. 17-36. [.pdf] [.ps]

C. Crépeau and J. Kilian, Discreet solitary games; In Advances in Cryptology: Proceedings of Crypto '93, Lecture Notes in Computer Science. Springer-Verlag, pages 319-330,1993. [.ps.gz]

M. Abadi, J. Feigenbaum, and J. Kilian, On Hiding Information from an Oracle Journal of Computer and System Sciences 39, 1 (August 1989), 21-50. [.ps]

S. Kim, B. Kim, and S. Park, Comments on password-based private key download protocol of NDSS'99, Electronics Letters, 35(22), IEE Press, 1999, pp.1937-1938. [.zip]

J. Kim, D. Simon, and P. Tetali, Limits on the Efficiency of One-Way Permutation-Based Hash Functions, 1999.

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]

N. Modadugu, D. Boneh, and M. Kim, Generating RSA keys on the PalmPilot with the help of an untrusted server.

S. Kim, S. Park, and D. Won, Group Signatures for Hierarchical Multigroups, Proc. of ISW'97, Information Security Workshop, Springer, Lecture Notes in Computer Science, LNCS 1396, 1998, pp. 273-281. [.zip]

S. Kim, M. Mambo, H. Shizuya, and D. Won, On the security of the Okamoto-Tanaka ID-based key exchange scheme against active attacks, Proc. of JW-ISC'2000, Korea-Japan Joint Workshop on Information Security and Cryptology, January 2000. [.zip]

S. Park, S. Kim, and D. Won, ID-based Group Signature, Electronics Letters, 1997, pp. 1616-1617. [.zip]

M. Joye, S. Kim, and N.-Y. Lee, Cryptanalysis of two group signature schemes, Masahiro Mambo, Yuliang Zheng, Proceedings of ISW'99, Information Security Workshop, Springer-Verlag, LNCS 1729, Kuala Lumpur, Malaysia, November 6-7 1999, pp. 271-275. [.zip]

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, 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]

S. Kim, B. Kim, and S. Park, Comments on password-based private key download protocol of NDSS'99, Electronics Letters, 35(22), IEE Press, 1999, pp.1937-1938. [.zip]

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. 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. Park, and D. H. Won, Convertible Group Signatures, Advances in Cryptology - Asiacrypt'96, Springer, Lecture Notes in Computer Science, LNCS 1163, 1996, pp. 311-321. [.zip]

S. Kim, S. Park, and D. Won, Zero-Knowledge Nominative Signatures, Proc. of Pragocrypt'96, International Conference on the Theory and Applications of Cryptology, 1996, pp. 380-392. [.zip]

S. Kim, S. Park, and D. Won, Proxy Signatures, Revisited, Proc. of ICICS'97, International Conference on Information and Communications Security, Springer, Lecture Notes in Computer Science, LNCS 1334, 1997, pp. 223-232. [.zip]

S.J. Kim, I.S. Lee, M. Mambo, and S.J. Park, On the difficulty of key recovery systems, Proc. of ISW'99, Information Security Workshop, Springer-Verlag, Lecture Notes in Computer Science, Kuala Lumpur, Malaysia, November 6-7 1999. [.zip]

S.J. Kim, Improved Privacy and Authenticity in Digital Signatures / Key Management, PhD Thesis . [.zip]

S. Park, T. Kim, Y. An, and D. Won, A Provably Entrusted Undeniable Signature, Proc. of IEEE SICON/ICIE'95, IEEE Singapore International Conference on Network/International Conference on Information Engineering, 1995, pp.644--648. [.ps]

G. Ateniese, D. Hasse, O. Chevassut, Y. Kim, and G. Tsudik, The Design of a Group Key Agreement API, IBM Research Report. Also in DARPA Information Survivability Conference And Exposition (DISCEX) 2000.

Y. Amir, G. Ateniese, D. Hasse, Y. Kim, C. Nita-Rotaru, T. Schlossnagle, J. Schultz, J. Stanton, and G. Tsudik, Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments, 2000 International Conference on Distributed Computing Systems. [.pdf]

Y. Desmedt, B. King, W. Kishimoto, and K. Kurosawa, A comment on the efficiency of secret sharing scheme over any finite Abelian group, Information and Privacy, 3rd Australasian Conference, ACISP'98, LNCS 1438, 1998, pp. 391-402. [.ps]

A. Shamir and A. Kipnis, Cryptanalysis of the HFE public key cryptosystem, Crypto'99, Springer-Verlag. [.pdf] [.ps]

Y. Desmedt, B. King, W. Kishimoto, and K. Kurosawa, A comment on the efficiency of secret sharing scheme over any finite Abelian group, Information and Privacy, 3rd Australasian Conference, ACISP'98, LNCS 1438, 1998, pp. 391-402. [.ps]

L. Knudsen, V. Rijmen, R. Rivest, and M. Robshaw, On the Design and Security of RC2, FSE5. [.ps] [.ps.gz]

L. Knudsen and T. Jakobsen, The Interpolation Attack on Block Ciphers, Proc. Fast Software Encryption '97. [.ps.gz]

L. Knudsen, Iterative characteristics of DES and s²-DES. Advances in Cryptology - Crypto'92. Springer Verlag, Lecture Note Series 746, pp. 497-511, Berlin Heidelberg 1993. [.ps.Z]

L. Knudsen, J. Daemen, and V. Rijmen, The block cipher SQUARE, Proc. Fast Software Encryption '97. [.pdf]

L. Knudsen and K. Nyberg, Provable Security Against a Differential Attack, The Journal of Cryptology, vol.8, No. 1, 1995. [.ps.Z]

L. Knudsen and B. Preneel, Hash Functions Based on Block Ciphers and Quaternary Codes, Advances in Cryptology - Proc. AsiaCrypt'96, LNCS 1163, Springer Verlag, 1996, pp. 77-90. [.ps.Z]

L. Knudsen and E. Biham, Cryptanalysis of the ANSI X9.52 CBCM Mode, Advances in Cryptology - EuroCrypt'98, LNCS, Springer Verlag, 1998. [.ps]

L. Knudsen and T. Pedersen, On the Difficulty of Software Key Escrow, Advances in Cryptology -- Proc. EUROCRYPT'96, LNCS 1070, pp. 237-244, Springer Verlag, 1996. [.ps.Z]

E. Biham, A. Biryukov, N. Ferguson, L. Knudsen, B. Schneier, and A. Shamir, Cryptanalysis of Magenta, Second AES Candidate Conference, April 1999.

L. Knudsen and T. Berson, Truncated Differentials of SAFER, Fast Software Encryption, Third International Workshop, Cambridge, UK, February 1996, LNCS 1039, D., Gollmann, Springer Verlag, 1995, pp. 15-26. [.ps.Z]

B. Van Rompay, L. Knudsen, and V. Rijmen, Differential cryptanalysis of the ICE encryption algorithm, Fast Software Encryption 98, LNCS 1372 , S. Vaudenay, Ed., Springer-Verlag, 1998, pp. 270-283. [.ps.gz]

L. Knudsen, Practically Secure Feistel Ciphers, Fast Software Encryption, The Cambridge Security Workshop, Cambridge, U.K., December 1993, Springer Verlag, Lecture Note Series 809, Berlin Heidelberg 1994, pp. 211-221. [.ps.Z]

L. Knudsen and X. Lai, Attacks on Double Block Length Hash Functions, Fast Software Encryption, The Cambridge Security Workshop, Cambridge, U.K., December 1993. Springer Verlag, Lecture Note Series 809, pp. 157-165, Berlin Heidelberg 1994. [.ps.Z]

L. Knudsen and I. Damgaard, The breaking of the AR Hash Function, Advances in Cryptology -- EuroCrypt '93, Springer Verlag, Lecture Note Series 765, pp.286-292, Berlin Heidelberg 1994. [.ps.Z]

L. Knudsen and M. Robshaw, Non-linear Approximations in Linear Cryptanalysis, Advances in Cryptology -- Proc. EUROCRYPT'96, LNCS 1070, Springer Verlag, 1996, pp. 224-236. [.ps.Z]

L. Knudsen, Cryptanalysis of LOKI, Advances in Cryptology -- AsiaCrypt'91. Springer Verlag, Lecture Note Series 739, pp. 22-35, Berlin Heidelberg 1993. [.ps.Z]

R. Anderson, E. Biham, and L. Knudsen, Serpent and Smartcards, CARDIS '98.

L. Knudsen, A Key-schedule Weakness in SAFER K-64, Advances in Cryptology - Proc. Crypto'95, LNCS 963, pp. 274-286, Springer Verlag, 1995. [.ps.Z]

L. Knudsen, Truncated and Higher Order Differentials, Fast Software Encryption - Second International Workshop, Leuven, Belgium, LNCS 1008, Springer Verlag, 1995, pp. 196-211. [.ps.Z]

E. Biham, A. Biryukov, N. Ferguson, L. Knudsen, B. Schneier, and A. Shamir, Cryptanalysis of Magenta, distributed at the first AES conference, August 20, 1998. [.ps.gz]

J. Borst, L. Knudsen, and V. Rijmen, Two attacks on reduced IDEA, Advances in Cryptology, Proceedings Eurocrypt '97, LNCS 1233, W. Fumy, Ed., Springer-Verlag, 1997, pp. 1-13. [.ps.gz]

L. Knudsen and W. Meier, Improved Differential Attack on RC5, Advances in Cryptology - Proc. CRYPTO'96, LNCS 1109, Springer Verlag, 1996, pp. 216-228. [.ps.Z]

L. Knudsen, Cryptanalysis of LOKI91, Advances in Cryptology - AusCrypt'92, Springer Verlag, Lecture Note Series 718, 1993, pp. 196-208. [.ps.Z]

L. Knudsen and I. Damgaard, Multiple Encryption with Minimum Key, Cryptography: Policy and Algorithms, International Conference, Brisbane, Queensland, Australia, July 1995, LNCS 1029, Springer Verlag, Berlin Heidelberg, pp. 156-164. [.ps.Z]

L. Knudsen and V. Rijmen, Truncated Differentials of IDEA, ESAT-COSIC Technical Report 97-1, 1997. [.ps]

L. Knudsen, New potentially weak keys for DES and LOKI, Advances in Cryptology -- EUROCRYPT'94, LNCS 950, A. De Santis, pp. 419-424, Springer Verlag, 1995. [.ps.Z]

L. Knudsen and X. Lai, New attacks on all Double Block Length Hash Functions of Hash Rate 1, including the Parallel DM, Advances in Cryptology -- EUROCRYPT'94, LNCS 950, Springer Verlag, 1995, pp. 410-418. [.ps.Z]

L. Knudsen, V. Rijmen, and B. Van Rompay, Differential Cryptanalysis of ICE, FSE5. [.ps] [.ps.gz]

E. Biham and P. Kocher, A Known Plaintext Attack on the PKZIP Stream Cipher, CS 842, December 1994 Fast Software Encryption 2, Proceedings of the Leuven Workshop, LNCS 1008. [.ps.gz]

P. Kocher, Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems.

M. Joye, J.-J. Quisquater, and F. Koeune, Takagi/Naito's algorithm revisited; Tech. Report CG-1997/3, UCL Crypto Group, Louvain-la-Neuve, March 1997. [.ps.gz]

J.-F. Dhem, F. Koeune, P.-A. Leroux, P. Mestré, J.-J. Quisquater, and J.-L. Williams, A practical implementation of the Timing Attack, Proc. of CARDIS 1998, 14-16th September 1998. [.ps.gz]

G. Hachez, F. Koeune, and J.-J. Quisquater, cAESar results: Implementation of Four AES Candidates on Two Smart Cards, Proc. of the Second AES Conference, March 1999. [.pdf]

J.-M. Boucqueau, J.-F. Delaigle, J.-F. Dhem, M. Joye, F. Koeune, H. Massias, P. Mestré, and J.-J. Quisquater, Comment jouer à pile ou face sur Internet sans tricher, Technical Report CG-1997/2, UCL Crypto Group, Louvain-la-Neuve, March 1997, presented at Les mercredis des Maths, Louvain-la-Neuve, 24th September 1997. [.ps.gz]

M. Joye, J.-J. Quisquater, and F. Koeune, Further results on Chinese remaindering; Tech. Report CG-1997/1, UCL Crypto Group, Louvain-la-Neuve, March 1997. [.ps.gz]

J. Kelsey, T. Kohno, and B. Schneier, Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent, Proceedings of the Seventh Fast Software Encryption Workshop, Springer-Verlag, Springer-Verlag, 2001, pp. 7-93.

T. Kohno, J. Kelsey, and B. Schneier, Preliminary Cryptanalysis of Reduced-Round Serpent, Proceedings of the Third AES Candidate Conference, April 2000, pp. 195-211.

N. Ferguson, D. Whiting, B. Schneier, J. Kelsey, S. Lucks, and T. Kohno, Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive, Proceedings of Fast Software Encryption 2003, to appear.

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, N. Ferguson, T. Kohno, M. Stay, The Twofish Team's Final Comments on AES Selection, May 15, 2000.

J. Feigenbaum, D. Koller, and P. Shor, A Game-Theoretic Classification of Interactive Complexity Classes; submitted for journal publication. Extended abstract appears in Proceedings of the 1995 IEEE Conference on Structure in Complexity Theory.

E. Verheul, B. Koops, and H. van Tilborg, Binding Cryptography. A Fraud-Detectible Alternative to Key-Escrow Proposals, Computer Law & Security Report, January-February 1997, pp. 3-14.

T. Aura, P. Koponen, and J. Räsänen, Delegation-based access control for intelligent network services, Proceedings of ECOOP Workshop on Distributed Object Security, Brussels, Belgium, July 1998. [.ps]

D. Fox, P. Horster, and P. Kraaibeek, Grundüberlegungen zu Trust Centern; In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 1-10.

C. Harpes, G. Kramer, and J. Massey, A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-up Lemma, Eurocrypt '95. [.ps]

M. Just, E. Kranakis, D. Krizanc, and P. Van Oorschot, On Key Distribution via True Broadcasting, Proceedings of 2nd ACM Conference on Computer and Communications Security, pp. 81-88, November 1994 [.ps.gz]

Y. Frankel, E. Brickell, and D. Kravitz, Trustee-traceable Electronic Cash and the Making of Anonymous Change; 1995 Symposium on Discrete Algorithms [.ps]

P. Chen, J. Garay, A. Herzberg, and H. Krawczyk, A Security Architecture for the Internet Protocol, IBM Systems Journal 37, No. 1 (1998).

R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Adaptive Security for Threshold Cryptosystems, Proc. Advances in Cryptology - CRYPTO '99, Michael Wiener (Ed.), LNCS (1666), Springer-Verlag, August 1999. (This is an extended version.) [.ps.gz]

S. Halevi and H. Krawczyk, MMH: Message Authentication in Software in the Gbit/second Rates, Proceedings of the 4th Workshop on Fast Software Encryption, 1997. [.ps.gz]

A. Herzberg, H. Krawczyk, M. Yung, and S. Jarecki, Proactive Secret Sharing and Public Key Cryptosystems; MIT M.Eng. Thesis: Feb'96 [.ps.gz]

M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, and M. Waidner, iKP - A Family of Secure Electronic Payment Protocols, Proc. First USENIX Workshop on Electronic Commerce, New York City, July 1995.

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust and Efficient Sharing of RSA Functions, Proceedings of CRYPTO'96. [.ps]

A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, Proactive Secret Sharing, Or: How To Cope With Perpetual Leakage, Proceedings of CRYPTO'95, Springer Verlag, LNCS 963, pp. 339-352. [.ps]

H. Krawczyk, SKEME: A Versatile Secure Key Exchange Mechanism for the Internet, August 1995. [.ps]

M. Bellare, C. Canetti, and H. Krawczyk, Message authentication using hash functions: The HMAC construction, RSA Laboratories' CryptoBytes v. 2, no. 1, Spring 1996.

M. Bellare, R. Canetti, and H. Krawczyk, Pseudorandom functions revisited: The cascade construction and its concrete security, Extended abstract in Proc. 37th Annual Symposium on the Foundations of Computer Science, IEEE, 1996.

J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway, UMAC: Fast and Secure Message Authentication, J. Black, S. Halevi, H. Krawczyk, T. Krovetz, P. Rogaway, Proceedings of Crypto 99, 1999. [.pdf] [.ps]

M. Bellare, R. Canetti, and H. Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols, Extended abstract in Proceedings of 30th Annual Symposium on the Theory of Computing, ACM, 1998.

H. Krawczyk and T. Rabin, Chameleon Hashing and Signatures, preprint. [.ps]

M. Bellare, O. Goldreich, and H. Krawczyk, Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier, Advances in Cryptology - Crypto 99 Proceedings, LNCS v. 1666, Springer-Verlag, 1999.

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Proceedings of EUROCRYPT'96, Springer Verlag, LNCS 1070, pp. 354-371. [.ps]

P. Cheng, J. Garay, A. Herzberg, and H. Krawczyk, Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX, Proc. 5th USENIX UNIX Security Symposium, Salt Lake City, Utah, June 1995. [.ps]

S. Halevi and H. Krawczyk, Public-key cryptography and password protocols, Proceedings of the Fifth ACM Conference on Computer and Communications Security, 1998. [.ps]

R. Gennaro, H. Krawczyk, and T. Rabin, RSA-Based Undeniable Signatures, Proceedings of CRYPTO'97. [.ps]

A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung, Proactive public key and signature systems, Proceedings of the 1997 ACM Conference on Computers and Communication Security, 1997. [.ps]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Proceedings Eurocrypt '99, Lecture Notes in Computer Science, Vol. 1592, Springer-Verlag, 1999. (This version has an appendix added.) [.ps.gz]

M. Bellare, R. Canetti, and H. Krawczyk, Keying hash functions for message authentication. Extended abstract in Advances in Cryptology - Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed, Springer-Verlag, 1996.

M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, E. Van Herreweghen, and M. Waidner, Design, Implementation and Deployment of the iKP Secure Electronic Payment System, IEEE Journal of Selected Areas in Communications. [.ps]

O. Goldreich and H. Krawczyk, On the Composition of Zero-Knowledge Proof Systems; revised 1994. [.ps]

D. Kreher, D. Stinson, and L. Zhu, On the maximum number of fixed points in automorphisms of prime order of 2-(v,k,1) designs; Annals of Combinatorics 1 (1997), 227-243. [.ps]

E. Gabber, P. Gibbons, D. Kristol, Y. Matias, and A. Mayer, Consistent yet Anonymous Web Access with LPWA, Communications of the ACM, February 1999. [.ps] [.ps.gz] [.ps.Z]

M. Just, E. Kranakis, D. Krizanc, and P. Van Oorschot, On Key Distribution via True Broadcasting, Proceedings of 2nd ACM Conference on Computer and Communications Security, pp. 81-88, November 1994 [.ps.gz]

M. Bellare, T. Krovetz, and P. Rogaway, Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible, Extended abstract in Advances in Cryptology -- Eurocrypt 98 Proceedings, Lecture Notes in Computer Science Vol. 1403, K. Nyberg ed, Springer-Verlag, 1998.

J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway, UMAC: Fast and Secure Message Authentication, J. Black, S. Halevi, H. Krawczyk, T. Krovetz, P. Rogaway, Proceedings of Crypto 99, 1999. [.pdf] [.ps]

C. Schuba, I. Krsul, M. Kuhn, E. Spafford, A. Sundaram, and D. Zamboni, Analysis of a Denial of Service Attack on TCP, Proceedings of the 1997 IEEE Symposium on Security and Privacy, Oakland, California, May 5-7, 1997. [.ps.gz]

A. McDonald, and M. Kuhn, StegFS: A Steganographic File System for Linux, Information Hiding, Third International Workshop, IH'99, Dresden, Germany, September/October, 1999, Proceedings, LNCS 1768, Springer-Verlag, ISBN 3-540-67182-X, pp. 463-477. [.pdf]

F. Petitcolas, R. Anderson, and M. Kuhn, Attacks on Copyright Marking Systems, presented at the Second Workshop on Information Hiding, Portland, Oregon, USA, 14--17 April, 1998. [.pdf]

O. Kömmerling and M. Kuhn, Design Principles for Tamper-Resistant Smartcard Processors, Proceedings of the USENIX Workshop on Smartcard Technology (Smartcard '99), Chicago, Illinois, USA, May 10-11, 1999, USENIX Association, pp. 9-20, ISBN 1-880446-34-0. [.pdf]

R. Anderson and M. Kuhn, Tamper Resistance - a Cautionary Note, The Second USENIX Workshop on Electronic Commerce Proceedings, Oakland, California, November 18-21, 1996, pp. 1-11, ISBN 1-880446-83-9. [.pdf]

F. Petitcolas, R. Anderson, and M. Kuhn, Information Hiding - A Survey, Proceedings of the IEEE, Vol. 87, No. 7, July 1999, pp. 1062-1078. [.pdf]

C. Schuba, I. Krsul, M. Kuhn, E. Spafford, A. Sundaram, and D. Zamboni, Analysis of a Denial of Service Attack on TCP, Proceedings of the 1997 IEEE Symposium on Security and Privacy, Oakland, California, May 5-7, 1997. [.ps.gz]

R. Anderson and M. Kuhn, Low Cost Attacks on Tamper Resistant Devices, Security Protocols, 5th International Workshop, Paris, France, April 7-9, 1997, Proceedings, Springer-Verlag, LNCS 1361, pp. 125-136. [.pdf]

M. Kuhn and R. Anderson, Soft Tempest: Hidden Data Transmission Using Electromagnetic Emanations, Second Workshop on Information Hiding, Portland, Oregon, USA, Apr. 15-17, 1998. [.pdf]

Markus G. Kuhn, Cipher Instruction Search Attack on the Bus-Encryption Security Microcontroller DS5002FP, IEEE Transactions on Computers, Vol. 47, No. 10, October 1998, pp. 1153-1157.

K. Kurosawa, T. Yoshida, Y. Desmedt, and M. Burmester, Some Bounds and a Construction for Secure Broadcast Encryption, Advances in Cryptology - ASIACRYPT'98, LNCS 1514, 1998, pp. 420-333. [.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]

Y. Desmedt and K. Kurosawa, Practical and proven zero-knowledge constant round variants of GQ and Schnorr, IEICE, Trans. on Fundamentals. [.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, 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]

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]

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 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]

K. Kurosawa, Unconditionally secure entity authentication, Proceedings of IEEE ISIT'98, p. 298, 1998. [.ps] Also available in a long version. [.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, T. Johansson, and D. Stinson, Almost k-wise Independent Sample Spaces and Their Cryptologic Applications, Advances in Cryptology - EUROCRYPT '97, LNCS 1233, 1997, pp. 409-421. [.ps]

K. Okada and K. Kurosawa, MDS Secret Sharing Schemes Secure against Cheaters, Proc. of IEEE ISIT'97, 1997, p. 90. [.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]

H. Fujii, W. Kachen, and K. Kurosawa, Combinatorial bounds and design of broadcast authentication, IEICE Trans., Vol.E79-A, No. 4, 1996, pp. 502-506. [.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. Kurosawa and W. Ogata, Efficient Rabin-type Digital Signature Scheme, Designs, Codes and Cryptography. [.ps]

T. Sato, M. Haga, and K. Kurosawa, Towards secure and fast hash functions, IEICE, Trans. on Fundamentals. [.ps]

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

F. Sato and K. Kurosawa, On the randomness of aself-decimation stream key generator, International Conference on Sequences and their Applications -- SETA'98, 1998. [.ps]

K. Kurosawa and Y. Desmedt, Optimum traitor tracing and new direction for asymmetricity, Advances in Cryptology - EUROCRYPT '98, LNCS 1403, 1998, pp. 145-157. [.ps]

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

Y. Desmedt, B. King, W. Kishimoto, and K. Kurosawa, A comment on the efficiency of secret sharing scheme over any finite Abelian group, Information and Privacy, 3rd Australasian Conference, ACISP'98, LNCS 1438, 1998, pp. 391-402. [.ps]

K. Kurosawa, T. Johansson, and D. Stinson, Almost k-wise independent sample spaces and their cryptologic applications; Lecture Notes in Computer Science 1233 (1997), 409-421 (Advances in Cryptology - EUROCRYPT '97). [.ps]

C. Park and K. Kurosawa, New ElGamal type threshold digital signature, IEICE Trans., Vol.E79-A, No. 1, 19996, pp. 86-93. [.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 T. Satoh, Generalization of higher order SAC to vector output Boolean function, IEICE Trans. E81-A, pp. 41-47 (1998). (Preliminary version appeared in Advances in Cryptology - ASIACRYPT '96, LNCS 1163 (1996), 218-231.) [.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 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, 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, New Bound on Authentication Code with Arbitration, Advances in Cryptology - CRYPTO '94, LNCS 839 (1994), 140-149. [.ps]

K. Kurosawa and T. Satoh, Design of SAC/PC(l) of order k Boolean functions and three other cryptographic criteria, Advances in Cryptology - EUROCRYPT '97, LNCS 1233, 1997, pp. 434-449. [.ps]

K. Kurosawa and S. Obana, Combinatorial Bounds of Authentication Codes with Arbitration, EUROCRYPT '95, revised version, December 8, 1997. [.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, H. Saido, and D. Stinson, New combinatorial bounds for authentication codes and key predistribution schemes, Designs, Codes and Cryptography. [.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]

B. Chor, M. Gereb-Graus, and E. Kushilevitz, Private Computations Over the Integers, SICOMP 24(2), 1995, pp. 376-386. [.ps.Z]

A. Beimel, Y. Isahi, T. Malkin, and E. Kushilevitz, One-way functions are essential for single-server private information retrieval, Proc. of the 31st Annu. ACM Symp. on the Theory of Computing (STOC), pp. 89-98, 1999. [.ps]

A. Biryukov and E. Kushilevitz, From Differential Cryptanalysis to Ciphertext-Only Attacks [.ps.gz], proceedings of CRYPTO'98, LNCS 1462. [.ps.Z]

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private Information Retrieval, FOCS 95. [.ps.Z]

E. Kushilevitz and A. Rosén, A Randomness-Rounds Tradeoff in Private Computation, SIDMA 11(1), 1998, pp. 61-80. Early version: Crypto 94. [.ps.Z]

Y. Ishai and E. Kushilevitz, Private Simultaneous Messages Protocols with Applications, ISTCS97. [.ps.Z]

E. Kushilevitz, Privacy and Communication Complexity, SIDMA 5(2), 1992, pp. 273-284. [.ps.Z]

O. Goldreich and E. Kushilevitz, A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm, J. Cryptology 6(2), 1993, pp. 97-116. Early version: Crypto 88. [.ps.Z]

B. Chor and E. Kushilevitz, A Communication-Privacy Tradeoff for Modular Addition, IPL 45, 1993, pp. 205-210. [.ps.Z]

B. Chor and E. Kushilevitz, A Zero-One Law for Boolean Privacy, SIDMA 4(1), 1991, pp. 36-47. [.ps.Z]

Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, Protecting Data Privacy in Private Information Retrieval Schemes, STOC 98. [.ps.Z]

B. Chor and E. Kushilevitz, Secret Sharing Over Infinite Domains, J. Cryptology 6(2), 1993, pp. 87-96. Early version: Crypto 89. [.ps.Z]

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

A. Biryukov and E. Kushilevitz, Improved Cryptanalysis of RC5, EuroCrypt 98. [.ps.Z]

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]

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

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

E. Kushilevitz and Y. Mansour, Randomness in Private Computations, SIDMA 10(4), 1997, pp. 647-661. Early version: PODC 96. [.ps.Z]

B. Chor, M. Gereb-Graus, and E. Kushilevitz, On the Structure of the Privacy Hierarchy, J. Cryptology 7(1), 1994, pp. 53-60. [.ps.Z]

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

A. De Santis, C. Blundo, A. Herzberg, S. Kutten, M. Yung, and U. Vaccaro, Perfectly-Secure Conference Key Distribution. An extended abstract of this paper appeared in: Advances in Cryptology -- CRYPTO '92, E. Brickell (Ed.), v. 740, Lectures Notes in Computer Science, 1993, Springer-Verlag, pp. 471-486. [.ps.gz]

M. Kwan, The Design of the ICE Encryption Algorithm, Proceedings of Fast Software Encryption - Fourth International Workshop, Haifa, Israel, Springer-Verlag, pp. 69-82, 1997.

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