Crypto Bibliography

Citations by Year - 1993

M. Abadi, M. Burrows, B. Lampson, and G. Plotkin, A Calculus for Access Control in Distributed Systems, ACM Transactions on Programming Languages and Systems 15, 4 (September 1993), 706-734. (Also appeared as SRC Research Report 70.) [.ps]

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]

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]

D. Bayer, S. Haber, and W. Stornetta, Improving the Efficiency and Reliability of Digital Time-Stamping, Sequences II: Methods in Communication, Security, and Computer Science, eds. R. Capocelli, A. DeSantis, and U. Vaccaro, Springer-Verlag, 1993, pp. 329-334. [.pdf]

D. Beaver, How to Break a "Secure" Oblivious Transfer Protocol (extended abstract); Advances in Cryptology - Eurocrypt '92, Springer-Verlag, 1993, 285-296. [.pdf]

D. Beaver and S. Haber, Cryptographic Protocols Provably Secure Against Dynamic Adversaries (extended abstract); Advances in Cryptology - Eurocrypt '92, Springer-Verlag, 1993, 307-323. [.pdf]

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]

M. Bellare and P. Rogaway, Random oracles are practical: A paradigm for designing efficient protocols. Extended abstract in Proc. First Annual Conference on Computer and Communications Security, ACM, 1993. Full version available.

M. Bellare and O. Goldreich, On defining proofs of knowledge. Extended abstract in Advances in Cryptology - Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed, Springer-Verlag, 1993. Full version available.

S. Bellovin, Packets Found on an Internet; in Computer Communications Review 23:3, pp. 26-31, July 1993. [.pdf] [.ps]

S. Bellovin and M. Merritt, Augmented Encrypted Key Exchange; in Proceedings of the First ACM Conference on Computer and Communications Security, pp. 244-250, November 1993. [.pdf] [.ps]

A. Ben-Dor and S. Halevi, 0-1 Permanent is #P-Complete, a Simpler Proof, Proceedings of the 2nd Israeli Symposium on Theory and Computing Systems, IEEE, 1993, pp. 108-117. [.ps.gz]

C. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters, Teleporting an unkown quantum state by dual classical and EPR channels; Physical Review Letter, 70:1895-1898, 1993. [.ps.gz]

C. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters, Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels; Physical Review Letters, vol. 70, 29 March 1993, pp. 1895 - 1899. [.ps.gz]

E. Biham, On Modes of Operation, Proceedings of Fast Software Encryption 1, Cambridge Security Workshop, 1993, LNCS 809. [.ps.gz]

M. Blaze, A Cryptographic File System for Unix. Proceedings of First ACM Conference on Computer and Communications Security, Fairfax, VA, November 1993. [.ps]

C. Boyd and W. Mao, On a limitation of BAN logic. Advances in Cryptology, EUROCRYPT '93, LNCS(765):240-247. Springer-Verlag. Lofthus, Norway. May, 1993. [.ps]

G. Brassard and L. Salvail, Secret-key reconciliation by public discussion; Advances in Cryptology | Eurocrypt '93 Proceedings, May 1993. [.ps.gz]

G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois, A quantum bit commitment scheme provably unbreakable by both parties; Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, November 1993, pp. 362 - 371. [.ps.gz]

D. Chaum, Prepaid Smart Card Techniques. A Brief Introduction and Comparison; 1993

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, Secret Sharing Over Infinite Domains, J. Cryptology 6(2), 1993, pp. 87-96. Early version: Crypto 89. [.ps.Z]

L. Claesen, J. Daemen, M. Genoe, and G. Peeters, Subterranean: a 600 Mbit/sec cryptographic VLSI chip, Proceedings of ICCD '93: VLSI in Computers and Processors, R. Camposano, A. Domic, Eds., IEEE Computer Society Press, 1993, pp. 610-613. [.ps.gz]

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]

C. Crépeau, Cryptographic primitives and quantum theory; In Proceedings of the second Physics of Computation Workshop, PhysComp '92, pages 200-204, 1993. [.ps.gz]

R. Cramer and T. Pedersen, Improved Privacy in Wallets with Observers, Proceedings of EUROCRYPT '93, Lofthus, Norway, Springer Verlag LNCS, vol. 765, pp. 329-343. [.ps]

J. Daemen, R. Govaerts, and J. Vandewalle, J. Daemen, R. Govaerts, J. Vandewalle, A framework for the design of one-way hash functions including cryptanalysis of Damgård's one-way function based on a cellular automaton, Advances in Cryptology, Proceedings Asiacrypt'91, LNCS 739, H. Imai, R.L. Rivest, and T. Matsumoto, Eds., Springer-Verlag, 1993, pp. 82-96. [.ps.gz]

J. Daemen, A. Bosselaers, R. Govaerts, and J. Vandewalle, Collisions for Schnorr's hash function FFT-hash, Advances in Cryptology, Proceedings Asiacrypt'91, LNCS 739, H. Imai, R.L. Rivest, and T. Matsumoto, Eds., Springer-Verlag, 1993, pp. 477-480. [.ps.gz]

J. Daemen, Limitations of the Even-Mansour construction, Advances in Cryptology, Proceedings Asiacrypt'91, LNCS 739, H. Imai, R.L. Rivest, and T. Matsumoto, Eds., Springer-Verlag, 1993, pp. 495-499. [.ps.gz]

J. Daemen, R. Govaerts, and J. Vandewalle, Cryptanalysis of MUX-LFSR based scramblers, Proceedings of the 3rd symposium on State and Progress of Research in Cryptography, W. Wolfowicz, Ed., Fondazione Ugo Bordoni, 1993, pp. 55-61. [.ps.gz]

J. Daemen, R. Govaerts, and J. Vandewalle, Block ciphers based on modular arithmetic, Proceedings of the 3rd symposium on State and Progress of Research in Cryptography, W. Wolfowicz, Ed., Fondazione Ugo Bordoni, 1993, pp. 80-89. [.ps.gz]

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]

A. De Santis, R. M. Capocelli, L. Gargano, and U. Vaccaro, On the Sizes of Shares for Secret Sharing Schemes, Journal of Cryptology, v. 6, 1993, pp. 157-167. [.ps.gz]

J. Feigenbaum, Locally Random Reductions in Interactive Complexity Theory, in Advances in Computational Complexity Theory, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 13, American Mathematical Society, Providence, 1993, pp. 73-98.. [.ps]

J. Feigenbaum and L. Fortnow, Random-Self-Reducibility of Complete Sets, SIAM Journal on Computing, 22 (1993), pp. 994-1005. Extended Abstract in Proceedings of the 1991 IEEE Conference on Structure in Complexity Theory. [.ps]

N. Ferguson, Extensions of Single-Term Coins, In Advances in Cryptology-CRYPTO '93, Lecture Notes in Computer Science no. 773, pp 292-301, Springer Verlag, 1993.

N. Ferguson, Single Term Off-Line Coins, In Advances in Cryptology-EUROCRYPT '93, Lecture Notes in Computer Science, Springer Verlag, 1993.

N. Ferguson, Single Term Off-Line Coins, Technical report CS-R9318, CWI, Amsterdam, 1993.

N. Ferguson, Single Term Off-Line Coins, Technical report CS-R9318, CWI, Amsterdam, 1993. [.pdf]

D. Fox and Der 'Digital Signature Standard'. Aufwand, Implementierung und Sicherheit; In: Weck, G.; Horster, P. (Hrsg.): Proceedings der Fachtagung Verläßliche Informationssysteme - VIS '93. DuD-Fachberichte Nr. 16, Vieweg-Verlag, Braunschweig 1993, S. 333-352.

Y. Frankel and M. Naor, Codes for Interactive Authentication; Crypto 93 and submitted by invitation to the Journal of Cryptology. [.ps]

M. Franklin and M. Yung, Secure and efficient off-line digital money, Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP 1993). [.ps]

M. Franklin, Z. Galil, and M. Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS 1993). [.ps]

Z. Galil and M. Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, Journal of the ACM. Earlier version in Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS 1993). [.ps]

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]

L. Gong, Increasing Availability and Security of an Authentication Service, IEEE Journal on Selected Areas in Communications, Vol.11, No.5, June, 1993, pp.657-662. [.ps.gz]

L. Gong, Variations on the Themes of Message Freshness and Replay, Proceedings of the IEEE Computer Security Foundations Workshop VI, Franconia, New Hampshire, June, 1993, pp.131-136. [.ps.gz]

L. Gong, Lower Bounds on Messages and Rounds for Network Authentication Protocols, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, November, 1993, pp.26-37. [.ps.gz]

L. Gong, T. Lomas, R. Needham, and J. Saltzer, Protecting Poorly Chosen Secrets from Guessing Attacks, IEEE Journal on Selected Areas in Communications, Vol.11, No.5, June, 1993, pp.648-656. [.ps.gz]

T. Hardjono and Y. Zheng, A practical digital multisignature scheme based on discrete logarithms; Advances in Cryptology -- AusCrypt'92, Lecture Notes in Computer Science, Vol. 718, pp. 122-132, Springer-Verlag, Berlin, 1993. [.ps] [.ps.Z]

J. Ioannidis and M. Blaze, The swIPe IP Security Protocol, Internet Draft, December 1993. [.id]

J. Ioannidis and M. Blaze, Architecture and Implementation of Network Layer Security Under UNIX, Proceedings of the Fourth USENIX Security Workshop, October 1993. [.ps]

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, Cryptanalysis of LOKI, Advances in Cryptology -- AsiaCrypt'91. Springer Verlag, Lecture Note Series 739, pp. 22-35, Berlin Heidelberg 1993. [.ps.Z]

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

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]

R. Lercier, Factoriser des entiers par la méthode des courbes elliptiques [french], Mémoire de DEA Informatique, Mathématiques et Applications, filière algorithmique, complexité et cryptographie, École Polytechnique, 1993 [.ps.gz]

C. Lim and P. Lee, Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks, Crypto '93, pp. 420-434. [.ps]

W. Mao and C. Boyd, Towards formal analysis of security protocols, IEEE Computer Security Foundations Workshop VI. pp. 147-158. IEEE Computer Society Press, Los Alamitos, CA. 1993. [.ps]

U. Maurer and J. Massey, Cascade ciphers: the importance of being first, Journal of Cryptology, vol. 6, no. 1, pp. 55-61, 1993. [.txt - abstract] [.pdf] [.ps]

U. Maurer, Secret key agreement by public discussion from common information; Institute for Theoretical Computer Science, ETH Zürich. 1993. IEEE Transactions on Information Theory. Vol. 39. Pages: 733-742. [.txt - abstract] [.ps] [.ps.gz]

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

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

B. Pfitzmann and M. Waidner, Attacks on protocols for server-aided RSA computation; Eurocrypt '92, LNCS 658, Springer-Verlag, Berlin 1993, 153-162. [.ps.gz]

B. Pfitzmann, Sorting Out Signature Schemes -- and some Theory of Secure Reactive Systems; Hildesheimer Informatik-Berichte 4/93 (Mai 1993), Institut für Informatik, Universität Hildesheim. [.ps.gz]

B. Pfitzmann, M. Waidner, and A. Pfitzmann, Rechtssicherheit trotz Anonymität in offenen digitalen Systemen; Datenschutz und Datensicherung DuD 14/5-6 (1990) 243-253, 305-315. Nachgedruckt in: Kongreßband 1. Kieler Netztage '93, Verlag Claus Schönleber, Kiel, ISBN 3-926986-18-2, 1993, 55-93. [.ps.gz]

M. Reiter and L. Gong, Preventing Denial and Forgery of Causal Relationships in Distributed Systems, Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, California, May, 1993, pp.30-40. [.ps.gz]

R. Rivest, Cryptography and Machine Learning; Proceedings ASIACRYPT '91 (Springer 1993), 427--439. [.pdf]

P. Rogaway and D. Coppersmith, A software-optimized encryption algorithm; Fast software encryption, Lecture Notes in Computer Science, Vol. 809, R. Anderson, ed., Springer-Verlag, 1993. [.ps] [.ps.gz]

A. Rubin and P. Honeyman, Formal methods for the analysis of authentication protocols ; CITI Technical Report 93-7 (October, 1993). [.ps]

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

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]

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]

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, Factoring polynomials over finite fields: asymptotic complexity vs. reality; in Proc. IMACS Symposium, Lille, France, 1993. [.ps.Z]

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

E. van Heijst, T. Pedersen, and B. Pfitzmann, New Constructions of Fail-Stop Signatures and Lower Bounds; Crypto '92, LNCS 740, Springer-Verlag, Berlin 1993, 15-30. [.ps.gz]

Y. Zheng, J. Pieprzyk, and J. Seberry, HAVAL -- a one-way hashing algorithm with variable length of output; Advances in Cryptology -- AusCrypt'92, Lecture Notes in Computer Science, Vol. 718, pp. 83-104, Springer-Verlag, Berlin, 1993. [.tar.Z]

Y. Zheng and J. Seberry, Immunizing public key cryptosystems against chosen ciphertext attacks; the Special Issue on Secure Communications, IEEE Journal on Selected Areas in Communications, Vol. 11, No. 5, pp. 715-724, June 1993. [.ps] [.ps.Z]

Y. Zheng and J. Seberry, Practical approaches to attaining security against adaptively chosen ciphertext attacks; Advances in Cryptology -- Crypto'92, Lecture Notes in Computer Science, Vol. 740, pp.292-304, Springer-Verlag, 1993. [.ps] [.ps.Z]

Y. Zheng, T. Hardjono, and J. Pieprzyk, The sibling intractable function family (SIFF): notion, construction and applications; IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol. E76-A, No. 1, pp. 4-13, January 1993. [.ps] [.ps.Z]

Y. Zheng, T. Hardjono, and J. Pieprzyk, Sibling intractable function families and their applications; Advances in Cryptology -- AsiaCrypt'91, Lecture Notes in Computer Science, Vol.739, pp. 124-138, Springer-Verlag, 1993. [.ps] [.ps.Z]

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