Crypto Bibliography

Citations by Year - unknown

R. Anderson, R. Needham, and A. Shamir, The Steganographic File System. [.ps.gz]

R. Anderson, Privacy and freedom issues

R. Anderson, Security of clinical information systems

R. Anderson, Analysis and design of cryptographic algorithms

R. Anderson, V. Matyas, and F. Petitcolas, The Eternal Resource Locator: An Alternative Means of Establishing Trust on the World Wide Web, 3rd USENIX workshop on electronic commerce, ISBN 1-880-446-97-9, pp. 141-153. [.pdf]

R. Anderson, Editing `Computer and Communications Security Reviews'

R. Anderson, Robustness of cryptographic protocols

R. Anderson, Tempest and other recent work.

R. Anderson, V. Matyas, F. Petitcolas, I. Buchan, and R. Hanka, On the Importance of Trusted Distribution and Authentic Channels for the Distribution of Medical Knowledge,

R. Anderson, Reliability of security systems.

G. Ateniese, C. Blundo, A. De Santis, and D. Stinson, Extended capabilities for visual cryptography; Submitted to Theoretical Computer Science. [.ps]

M. Atici, D. Stinson, and R. Wei, A new practical algorithm for the construction of a perfect hash function; Submitted to Algorithmica. [.ps]

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]

F. Bergadano, B. Crispo, and M. Lomas, Strong Authentication and Privacy with Standard Browsers, submitted for publication.

C. Blundo, A. De Santis, and D. Stinson, On the contrast in visual cryptography schemes, Journal of Cryptology. [.ps]

C. Blundo, L. Frota Mattos, and D. Stinson, Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution, Theoretical Computer Science. [.ps]

C. Blundo, P. D'Arco, A. De Santis, and D. Stinson, Contrast optimal threshold visual cryptography schemes; Submitted to SIAM Journal on Discrete Mathematics. [.ps]

S. Brands, Off-Line Cash Transfer by Smart Cards. [.ps.Z]

G. Brassard, A bibliography of quantum cryptography. [.ps.gz]

M. Burmester, R. Rivest, and A. Shamir, Geometric Cryptography; [.ps]

D. Chaum, Online Cash Checks; Advances in Cryptology, EUROCRYPT 89, Springer-Verlag, pp. 288-293.

A. Clark, Cryptography in Great Britain, CNEJITA conference of experts, French Senate, Paris. [.pdf]

A. Clark, Personal Authentication, an Update - presented to the Technology of Software Protection Group of the British Computer Society, London. [.pdf]

C. Colbourn, J. Dinitz, and D. Stinson, Quorum systems constructed from combinatorial designs; Submitted to Information and Computation. [.ps]

R. Cramer, I. Damgård, and B. Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. [.ps.Z]

R. Cramer and T. Pedersen, Efficient and provable security amplifications. [.ps.Z]

R. Cramer, On shared randomness and the size of secure signatures. [.ps.Z]

A. De Santis, C. Blundo, A. Cresti, and U. Vaccaro, Fully Dynamic Secret Sharing Schemes, Theoretical Computer Science. [.ps]

A. De Santis, G. Ateniese, C. Blundo, and D. R. Stinson, Visual Cryptography for General Access Structures Information and Computation. [.ps]

C. Ellison, C. Hall, R. Milbert, and B. Schneier, Protecting Secret Keys with Personal Entropy, Future Generation Computer Systems.

Y. Frankel, P. MacKenzie, and M. Yung, Proactive RSA [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, Using Lattice Problems in Cryptography.

O. Goldreich, R. Rubinfeld, and M. Sudan, Learning polynomials with queries: the highly noisy case; FOCS95 version. [.ps]

S. Halevi and E. Petrank, Storing Classified Files [.ps.gz]

J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a pseudo-random generator from any one-way function, SIAM Journal on Computing. [.ps]

R. Impagliazzo and M. Naor, Efficient cryptographic schemes provably as secure as subset sum [.ps]

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

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

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

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

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

H. Krawczyk and T. Rabin, Chameleon Hashing and Signatures, preprint. [.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]

S. Lucks, On the Security of Remotely Keyed Encryption [.ps.gz]

S. Lucks, BEAST: A fast block cipher for arbitrary blocksizes [.ps.gz]

S. Lucks, Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys [.ps.gz]

S. Lucks, How to Exploit the Intractability of Exact TSP for Cryptography [.ps.gz]

S. Lucks, Faster Luby-Rackoff Ciphers [.ps.gz]

S. Lucks, How Traveling Salespersons Prove Their Identity [.ps.gz]

S. Lucks, Attacking Triple Encryption. [.ps.gz]

W. Martin and D. Stinson, A generalized Rao bound for ordered orthogonal arrays and (t,m,s)-nets; Submitted to Canadian Mathematical Bulletin. [.ps]

W. Martin and D. Stinson, Association schemes for ordered orthogonal arrays and (T,M,S)-nets; Submitted to Canadian Journal of Mathematics. [.ps]

S. Halevi and S. Micali, A Stronger Notion of Proofs of Knowledge [.ps.gz]

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

M. Naor and O. Reingold, From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs;

R. Rivest, M.J.B. Robshaw, R. Sidney, and Y. Yin, The RC6 Block Cipher; a block cipher submitted for consideration as the new AES [.pdf] [.ps]

R. Rivest, Multi-grade cryptography. [.ps]

R. Rivest, M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, and M. Wiener, Minimal Key Lenths for Symmetric Ciphers to Provide Adequate Commercial Security [.ps]

B. Schneier and A. Shostack, Breaking Up Is Hard to Do: Modeling Security Threats for Smart Cards, First USENIX Symposium on Smart Cards, USENIX Press.

D. Stinson, Some results on nonlinear zigzag functions, J. Combin. Math. Combin. Comput. [.ps]

D. Stinson and R. Wei, An application of ramp schemes to broadcast encryption; Submitted to Information Processing Letters. [.ps]

D. Stinson and T. van Trung, Some new results on key distribution patterns and broadcast encryption, Designs, Codes and Cryptography. [.ps]

Y. Tsiounis, Efficient Electronic Cash: New Notions and Techniques; Ph.D. thesis. [.ps] [.ps.Z]

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