Crypto Bibliography

Citations by First Author - K

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

A. Kaldewaij and B. Schoenmakers, Searching by Elimination; Science of Computer Programming 14 (1990) 243-254. [.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]

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

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. Katz and B. Schneier, A Chosen Ciphertext Attack against Several E-Mail Encryption Protocols, J. Katz and B. Schneier, 9th USENIX Security Symposium, 2000.

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.

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 and B. Schneier, Authenticating Secure Tokens Using Slow Memory Access, First USENIX Symposium on Smart Cards, USENIX Press.

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, Key Separation in Twofish, Twofish Technical Report #7, April 7, 2000.

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

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 and B. Schneier, Conditional Purchase Orders, 4th ACM Conference on Computer and Communications Security, ACM Press, April 1997, pp. 117-124.

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

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.

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

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, 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 and B. Schneier, MARS Attacks! Preliminary Cryptanalysis of Reduced-Round MARS Variants, Proceedings of the Third AES Candidate Conference, April 2000, pp. 169-185.

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.

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.

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

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

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

L. Knudsen and T. Jakobsen, The Interpolation Attack on Block Ciphers, Proc. Fast Software Encryption '97. [.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 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, V. Rijmen, and B. Van Rompay, Differential Cryptanalysis of ICE, FSE5. [.ps] [.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 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, 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, 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, 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 and V. Rijmen, Truncated Differentials of IDEA, ESAT-COSIC Technical Report 97-1, 1997. [.ps]

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]

L. Knudsen, Cryptanalysis of LOKI91, Advances in Cryptology - AusCrypt'92, Springer Verlag, Lecture Note Series 718, 1993, pp. 196-208. [.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]

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]

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

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

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 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, V. Rijmen, R. Rivest, and M. Robshaw, On the Design and Security of RC2, FSE5. [.ps] [.ps.gz]

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

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.

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

H. Krawczyk, SKEME: A Versatile Secure Key Exchange Mechanism for the Internet, August 1995. [.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]

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 and W. Ogata, Efficient Rabin-type Digital Signature Scheme, Designs, Codes and Cryptography. [.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, 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 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, 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 and S. Obana, Combinatorial Bounds for Authentication Codes with Arbitration, Advances in Cryptology - EUROCYPT '95, LNCS 921, 1995, 289-300. [.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 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]

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, 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. Kurosawa, New Bound on Authentication Code with Arbitration, Advances in Cryptology - CRYPTO '94, LNCS 839 (1994), 140-149. [.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, 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. 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, 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]

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. Kurosawa and S. Obana, Combinatorial Bounds of Authentication Codes with Arbitration, EUROCRYPT '95, revised version, December 8, 1997. [.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]

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

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

E. Kushilevitz, R. Ostrovsky, and A. Rosén, Characterizing Linear Size Circuits in Terms of Privacy, STOC 96. [.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]

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

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

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

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.