Crypto Bibliography

Citations by First Author - S

K. Sakurai and Y. Zheng, On Non-Pseudorandomness from Block Ciphers with Provable Immunity against Linear Cryptanalysis; IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol. E80-A, No.1, pp.19-24, 1997. [.pdf] [.ps] [.ps.Z]

C. Salter, O.S. Saydjari, B. Schneier, and J. Wallner, Toward a Secure System Engineering Methodology, New Security Paradigms Workshop, September 1998, pp. 2-10.

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]

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

J. Schiller, D. Atkins, Scaling the Web of Trust: Combining Kerberos and PGP to Provide Large Scale Authentication [.txt], Usenix 1995 Technical Conference Proceedings, Jan. 16-20, 1995. [.ps] [.txt]

B. Schneier and Mudge, Cryptanalysis of Microsoft's Point-to-Point Tunneling Protocol (PPTP), Proceedings of the 5th ACM Conference on Communcations and Computer Security, ACM Press, November 1998, pp. 132-141.

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, Why Cryptography is Harder than it Looks, Information Security Bulletin, v. 2, n. 2, March 1997, pp. 31-36.

B. Schneier, Attack Trees, Dr. Dobb's Journal, v. 24, n. 12, Dec 1999, pp. 21-29.

B. Schneier and D. Whiting, A Performance Comparison of the Five AES Finalists, Proceedings of the Third AES Candidate Conference, April 2000, pp. 123-135.

B. Schneier, Inside Risks 111: The Trojan Horse Race, Communications of the ACM, vol 42, n 9, Sep 1999.

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.

B. Schneier, Blowfish--One Year Later, Dr. Dobb's Journal, September 1995.

B. Schneier, Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish), Fast Software Encryption, Cambridge Security Workshop Proceedings (December 1993), Springer-Verlag, 1994, pp. 191-204.

B. Schneier and Mudge, Cryptanalysis of Microsoft's PPTP Authentication Extensions (MS-CHAPv2), CQRE, Dusseldorf, Oct 1999.

B. Schneier and C. Hall, An Improved E-mail Security Protocol, 13th Annual Computer Security Applications Conference, ACM Press, December 1997, pp. 232-238.

B. Schneier and D. Whiting, Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor, Fast Software Encryption, Fourth International Workshop Proceedings (January 1997), Springer-Verlag, 1997, pp. 242-259.

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.

B. Schneier, Security in the Real World: How to Evaluate Security, Computer Security Journal, v 15, n 4, 1999, pp. 1-14.

B. Schneier, Self-Study Course in Block Cipher Cryptanalysis, 1998.

B. Schneier, Inside Risks 110: Biometrics: Uses and Abuses, Communications of the ACM, vol 42, n 8, August 1999.

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

B. Schneier, Inside Risks 112: Risks of Relying on Cryptography, Communications of the ACM, vol 42, n 10, Oct 1999.

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

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, Cryptographic Design Vulnerabilities IEEE Computer, v. 31, n. 9, Sep 1998, pp. 29-33. [.pdf]

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

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.

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, Cryptographic Support for Secure Logs on Untrusted Machines, The Seventh USENIX Security Symposium Proceedings, USENIX Press, January 1998, 53-62.

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.

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.

B. Schneier, Cryptography, Security, and the Future, Communications of the ACM, v. 40, n. 1, January 1997, p. 138.

C. Schnorr and S. Vaudenay, The Black-Box Model for Cryptographic Primitives, Journal of Cryptology, vol.11, pp. 125-140, 1998.

C. Schnorr and H. Hörner, Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction, Advances in Cryptology - Eurocrypt '95, Lecture Notes in Computer Science, Vol. 921, Springer Verlag, pp.1-12, 1995.

C. Schnorr, S. Vaudenay, Parallel FFT-Hashing, Fast Software Encryption - Proceedings of the Cambridge Security Workshop Lecture Notes in Computer Science, Vol. 809, Springer Verlag, pp.149-156,1994. [.ps] [.ps.gz]

C. Schnorr, Efficient Signature Generation by Smart Cards, Journal of Cryptology, Vol.4, pp.161-174, 1991. [.ps] [.ps.gz]

B. Schoenmakers, A New Algorithm for the Recognition of Series Parallel Graphs; Report CS-R9504, Centrum voor Wiskunde en Informatica (CWI), January 1995.

B. Schoenmakers, Basic Security of the ecash Payment System, Bart Preneel et al. (eds.) Computer Security and Industrial Cryptography: State of the Art and Evolution, ESAT Course, Leuven, Belgium, June 3--6, 1997, Springer-Verlag's LNCS series. 16 pages. [.pdf]

B. Schoenmakers, Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space; In Mathematics of Program Construction-MPC'92, volume 669 of Lecture Notes in Computer Science, pages 291-301, Berlin, 1993. Springer-Verlag. [.ps.gz]

B. Schoenmakers, A Systematic Analysis of Splaying; Information Processing Letters 45 (1993) 41-50. [.pdf] [.ps.gz]

B. Schoenmakers, A Tight Lower Bound for Top-Down Skew Heaps; Information Processing Letters 61 (1997) 279-284. Reference [10] of the paper is also available as Neil Sloane's On-Line Encyclopedia of Integer Sequences; through which I found out about Hofstadter's G-sequence. [.pdf]

B. Schoenmakers, An Efficient Electronic Payment System Withstanding Parallel Attacks, Report CS-R9522, Centrum voor Wiskunde en Informatica (CWI), March 1995.

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]

J. Seberry, X. Zhang, and Y. Zheng, Nonlinearly balanced Boolean functions and their propagation characteristics; Advances in Cryptology -- Crypto'93, Lecture Notes in Computer Science, Vol. 773, pp. 49-60, Springer-Verlag, Berlin, 1994. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Improving the strict avalanche characteristics of cryptographic functions; Information Processing Letters, Vol.50, pp.37-41, 1994. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Systematic generation of cryptographically robust S-boxes; Proceedings of the First ACM Conference on Computer and Communications Security, pp.171-182, The Association for Computing Machinery, New York, November 1993. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Cryptographic Boolean functions via group Hadamard matrices; in the Special Issue: the Hadamard Centenary Conference, the Australasian Journal of Combinatorics, Vol.10, pp.131-145, 1994. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, The Relationship Between Propagation Characteristics and Nonlinearity of Cryptographic Functions; Journal of Universal Computer Science, Vol. 1, No. 2, pp. 136-150, 1995. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Nonlinearity and propagation characteristics of balanced Boolean functions; Information and Computation, Vol. 119, No. 1, pp. 1-13, 1995. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Relationships among nonlinearity criteria; Advances in Cryptology -- EuroCrypt'95, Lecture Notes in Computer Science, Vol. 950, pp. 376-388, Springer-Verlag, 1995 [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Relationships Among Nonlinearity Criteria. Eurocrypt '95, Lecture Notes in Computer Science, vol. 950, pp. 376-388, Springer-Verlag, 1995. [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Structures of cryptographic functions with strong avalanche characteristics; Advances in Cryptology -- AsiaCrypt'94, Lecture Notes in Computer Science, Vol.917, pp.119-132, Springer-Verlag, 1995. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, On constructions and nonlinearity of correlation immune functions; Advances in Cryptology -- EuroCrypt'93, Lecture Notes in Computer Science, Vol. 765, pp. 181-199, Springer-Verlag, Berlin, 1994. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Pitfalls in designing substitution boxes; Advances in Cryptology -- Crypto'94, Lecture Notes in Computer Science, Vol. 839, pp. 383-396, Springer-Verlag, Berlin, 1994. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Relating Nonlinearity to Propagation Characteristics; Proceedings of 1995 Cryptography Policy and Algorithms Conference, pp.283-297, Brisbane, July 1995. [.ps] [.ps.Z]

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

V. Shoup, On the security of a practical identification scheme, in Proc. Eurocrypt '96, pp. 344-353, 1996. [.ps.Z]

V. Shoup and J. von zur Gathen, Computing Frobenius maps and factoring polynomials; Computational Complexity 2:187-224, 1992; extended abstract in Proc. 24th ACM Symposium on Theory of Computing, pp. 97-105, 1992. [.ps.Z]

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, Why chosen ciphertext security matters, Preprint, 1998. [.ps.Z]

V. Shoup, Smoothness and factoring polynomials over finite fields; Information Processing Letters 39:39-42, 1991. [.ps.Z]

V. Shoup, On the deterministic complexity of factoring polynomials over finite fields; Information Processing Letters 33:261-267, 1990. [.ps.Z]

V. Shoup, F. Lehmann, M. Mauerer, and V. Mueller, Counting the number of points on elliptic curves of characteristic greater than three; in Proc. First Algorithmic Number Theory Symposium, pp. 60-70, 1994. [.ps.Z]

V. Shoup and R. Smolensky, Lower bounds for polynomial evaluation and interpolation problems; Computational Complexity, 6:301-311, 1997; preliminary version in Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 378-383, 1991. [.ps.Z]

V. Shoup, Factoring polynomials over finite fields: asymptotic complexity vs. reality; in Proc. IMACS Symposium, Lille, France, 1993. [.ps.Z]

V. Shoup, Fast construction of irreducible polynomials over finite fields; Journal of Symbolic Computation 17:371-391, 1994; extended abstract in Proc. 4th Annual Symposium on Discrete Algorithms, pp. 484-492, 1993. [.ps.Z]

V. Shoup, A note on session-key distrubution using smart cards; manuscript, 1996. This contains some corrections and modifications to the previous paper. [.ps.Z]

V. Shoup and J. Buchmann, Constructing nonresidues in finite fields and the Extended Riemann Hypothesis; Mathematics of Computation 65(215):1311-1326, 1996; extended abstract in Proc. 23rd ACM Symposium on Theory of Computation, pp. 72-79, 1991. [.ps.Z]

V. Shoup and E. Bach, Factoring polynomials using fewer random bits; Journal of Symbolic Computation 9:229-239, 1990. [.ps.Z]

V. Shoup and A. Rubin, Session-key distrubution using smart cards; in Proc. Eurocrypt '96, pp. 321-31, 1996. [.ps.Z]

V. Shoup, New algorithms for finding irreducible polynomials over finite fields; Mathematics of Computation 54:435-447, 1990; extended abstract in Proc. 29th Annual Symposium on Foundations of Computer Science, pp. 283-290, 1988. [.ps.Z]

V. Shoup, A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic; in Proc. 1991 International Symposium on Symbolic and Algebraic Computation, pp. 14-21, 1991. [.ps.Z]

V. Shoup, Lower bounds for discrete logarithms and related problems; in Proc. Eurocrypt '97, pp. 256-266, 1997. This is a revision of the conference version. [.ps.Z]

V. Shoup and A. Rubin, Session Key Distribution Using Smart Cards; Proc. of Eurocrypt '96 (May, 1996). [.ps]

V. Shoup and R. Gennaro, Securing Threshold Cryptosystems against Chosen Ciphertext Attack, Proceedings of EUROCRYPT'98, Springer-Verlag LNCS 1403, pp.1-16. [.ps]

V. Shoup, Searching for primitive roots in finite fields; Mathematics of Computation 58:369-380, 1992; extended abstract in Proc. 22nd ACM Symposium on Theory of Computation, pp. 546-554, 1990. [.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]

V. Shoup, A new polynomial factorization algorithm and its implementation; Journal of Symbolic Computation 20:363-397, 1995. [.ps.Z]

V. Shoup and R. Peralta, Primality testing with fewer random bits; Computational Complexity 3:355-367, 1993. [.ps.Z]

V. Shoup and R. Cramer, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack; May 1998. [.ps.Z]

V. Shoup, Removing Randomness from Computational Number Theory; Ph. D. Thesis, University of Wisconsin, 1989. [.ps.Z]

V. Shoup, On fast and provably secure message authentication based on universal hashing; in Proc. Crypto '96, pp. 313-328, 1996. This contains some corrections to the conference version. [.ps.Z]

G. Simmons and C. Meadows, The Role of Trust in Information Integrity Protocols, Journal of Computer Security, Vol. 3, No. 2, 1994. [.pdf] [.ps]

S. Simpson, PGP DH vs PGP RSA, 1999.

M. Skala, A Limited-Diffusion Algorithm for Blind Substring Search, Proceedings of the 10th Annual Canadian Information Technology Security Symposium, 1-5 June 1998, Ottawa, Ontario, pp. 397-410.

A. Smith and A. Stiglic, Multiparty computation unconditionally secure against Q^2 adversary structure, McGill Tech. Report, 1998. [.pdf]

M. Stadler, J.-M. Piveteau, and J. Camenisch, Fair Blind Signatures, Advances in Cryptology -- EUROCRYPT '95, Lecture Notes in Computer Science v. 921, pp. 209-219, Springer Verlag, 1995. [.txt - abstract] [.pdf] [.ps]

F. Stajano and R. Anderson, The Cocaine Auction Protocol: On the Power of Anonymous Broadcast, Third International Workshop on Information Hiding, Dresden, Germany, 1999.

F. Stajano and R. Anderson, The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks, 7th International Workshop on Security Protocols, Cambridge, UK, April 1999, Springer LNCS vol 1796, pp 172-182.

F. Stajano and R. Anderson, The Grenade Timer: Fortifying the Watchdog Timer Against Malicious Mobile Code, 7th International Workshop on Mobile Multimedia Communications (MoMuC 2000), Waseda, Tokyo, Japan. [.pdf]

F. Stajano, The Resurrecting Duckling -- What Next?, 8th International Workshop on Security Protocols, Cambridge, UK, April 2000, Springer LNCS. [.pdf]

A. Stiglic, Computations with a Deck of Cards (preprint version), Theoretical Computer Science, v. 259 (1-2), 2001, pp. 671-678. [.pdf]

D. Stinson, On some methods for unconditionally secure key distribution and broadcast encryption; Designs, Codes and Cryptography 12 (1997), 215-243. [.ps]

D. Stinson, T. van Trung, and R. Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, Journal of Statistical Planning and Inference, 86 (2), 2000, pp. 595-617. [.ps]

D. Stinson and R. Wei, Combinatorial properties and constructions of traceability schemes and frameproof codes; SIAM J. Discrete Math 11 (1998), 41-53. [.ps]

D. Stinson, On the connections between universal hashing, combinatorial designs and error-correcting codes; Congressus Numerantium 114 (1996), 7-27. [.ps]

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 R. Wei, Key preassigned traceability schemes for broadcast encryption; Submitted to SAC '98. [.ps]

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

P. Syverson, Limitations on Design Principles for Public Key Protocols, Proceedings of the 1996 IEEE Symposium on Security and Privacy, Oakland, CA, 1996, IEEE CS Press, pp. 62-73. [.pdf] [.ps]

P. Syverson and C. Meadows, A Formal Language for Cryptographic Protocol Requirements, Designs, Codes, and Cryptography, vol. 7, no. 1/2, pp. 27-59, 1996. [.pdf] [.ps]

N. Szabo, Formalizing and Securing Relationships on Public Networks, Published in the First Monday electronic journal, vol 2 no 9.

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