Crypto Bibliography

Citations by Year - 1997

M. Abadi, Secrecy by Typing in Security Protocols, Theoretical Aspects of Computer Software, Springer-Verlag (September 1997), 611-638. [.ps]

M. Abadi, T. Mark, A. Lomas, and R. Needham, Strengthening Passwords; SRC Technical Note 1997-033 (September/December 1997). [.ps]

M. Abadi, On SDSI's Linked Local Name Spaces, Proceedings of the 10th IEEE Computer Security Foundations Workshop (June 1997), 98-108. [.ps]

M. Abadi, Explicit Communication Revisited: Two New Attacks on Authentication Protocols, IEEE Transactions on Software Engineering 23, 3 (March 1997), 185-186. [.ps]

M. Abdalla, W. Cirne, L. Franklin, and A. Tabbara, Security Issues in Agent Based Computing, in Proc. of the 15th Brazilian Symposium on Computer Networks, Campinas, SP, May 1997. [.pdf]

M. Abdalla and O. Duarte, Analysis of CAC Mechanisms for ATM Networks [.ps.gz], in Proc. of the 15th Brazilian Telecommunications Symposium, Recife, PE, September 1997. Portuguese. [.pdf] [.ps.gz]

H. Abelson, R. Anderson, S. Bellovin, J. Benaloh, M. Blaze, W. Diffie, J. Gilmore, P. Neumann, R. Rivest, J. Schiller, and B. Schneier, The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption [PDF]. An earlier version appeared in World Wide Web Journal, v.2, n.3, 1997, pp. 241-257.

P. Ammann, S. Jajodia, D. McCollum, and b. Blaustein, Surviving information warfare attacks on databases, Proc. IEEE Symp. on Research in Security and Privacy, Oakland, Calif., May 1997, pages 31-42. [.ps]

R. Anderson, V. Matyas, and F. Petitcolas, Secure Books: Protecting the Secure Distribution of Knowledge, Security Protocols Workshop, 1997.

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]

R. Anderson and M. Roe, The GCHQ Protocol and its Problems, Eurocrypt 97. [.ps.Z] [.ps.gz]

N. Asokan, V. Shoup, and M. Waidner, Optimistic fair exchange of digital signatures, IBM Research Report RZ 2973, 1997. This is the full length version of the extended abstract in Proc. Eurocrypt '98. [.ps]

T. Aura, Strategies against replay attacks, Proceedings of 10th IEEE Computer Security Foundations Workshop, Rockport MA, June 1997, pp. 59-68.

S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, A Message Authentication Code based on Latin Squares, Australian Conference on Information Security and Privacy (ACISP '97), Springer-Verlag, LNCS 1270, pp. 194-203, 1997. [.ps.Z]

N. Baric and B. Pfitzmann, Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees; Eurocrypt '97, LNCS 1233, Springer-Verlag, Berlin 1997, 480-494. [.ps.gz]

D. Beaver, Commodity-Based Cryptography (extended abstract); Proceedings of the 29th STOC, ACM, 1997, 446-455. [.pdf]

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]

M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proofs; August 1991. [.ps] Addendum, May 1997. [.ps]

M. Bellare and D. Micciancio, A New Paradigm for collision-free hashing: Incrementality at reduced cost; Extended abstract in Advances in Cryptology- Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed, Springer-Verlag, 1997.

M. Bellare, S. Goldwasser, and D. Micciancio, "Pseudo-Random" Number Generation within Cryptographic Algorithms: the DSS Case, Advances in Cryptology -- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed, Springer-Verlag, 1997.

M. Bellare, M. Jakobsson, and M. Yung, Round-optimal zero-knowledge arguments based on any one-way function, Extended abstract in Advances in Cryptology- Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed, Springer-Verlag, 1997.

M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation; Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS 97), IEEE, 1997.

M. Bellare and P. Rogaway, Collision-Resistant Hashing: Towards Making UOWHFs Practical, Extended abstract in Advances in Cryptology- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed, Springer-Verlag, 1997.

M. Bellare and P. Rogaway, Collision-Resistant Hashing: Towards Making UOWHFs Practical; Extended abstract in Advances in Cryptology- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed, Springer-Verlag, 1997.

M. Bellare, A Note on Negligible Functions; Technical Report CS97-529, Department of Computer Science and Engineering, UCSD, March 1997.

M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation, Extended abstract in Proceedings of 38th Annual Symposium on Foundations of Computer Science, IEEE, 1997.

M. Bellare and S. Goldwasser, Verifiable partial key escrow, Proc. 4th ACM Conference on Computer and Communications Security, April 1997. Earlier version was Technical Report CS95-447, Department of Computer Science and Engineering, UCSD, October 1995.

M. Bellare, M. Jakobsson, and M. Yung, Round-optimal zero-knowledge arguments based on any one-way function, extended abstract in Advances in Cryptology- Eurocrypt 97 Proceedings, LNCS v. 1233, Springer-Verlag, 1997.

M. Bellare and D. Micciancio, A New Paradigm for collision-free hashing: Incrementality at reduced cost, Extended abstract in Advances in Cryptology- Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed, Springer-Verlag, 1997.

M. Bellare, R. Impagliazzo, and M. Naor, Does Parallel Repetition Lower the Error in Computationally Sound Protocols?, Extended abstract in Proceedings of 38th Annual Symposium on Foundations of Computer Science, IEEE, 1997.

M. Bellare, A Note on Negligible Functions, Technical Report CS97-529, Department of Computer Science and Engineering, UCSD, March 1997.

S. Bellovin, Probable Plaintext Cryptanalysis of the IP Security Protocols, Proceedings of the Symposium on Network and Distributed System Security, San Diego, CA, pp. 155-160, February 1997. [.pdf] [.ps]

F. Bergadano, B. Crispo, and G. Ruffo, Proactive Password Checking with Decision Trees, Proc. 4th ACM Conference on Computer and Communications Security, Zurich, April 1997.

I. Biehl and J. Buchmann, An analysis of the reduction algorithms for binary quadratic forms; Technical Report No. TI-26/97, 07.11.1997 [.ps.gz]

E. Biham and T. Mor, On the Security of Quantum Cryptography Against Collective Attacks, Physical Review Letters, Vol. 78, No. 11, pp. 2256-2259, March 1997 [.ps.gz]

E. Biham and A. Biryukov, An Improvement of Davies' Attack on DES, CS 817, May 1994, Proceedings of Eurocrypt'94, LNCS 950, Journal of Cryptology, Vol. 10, No. 3, pp. 195-206, 1997 [.ps.gz]

E. Biham and A. Shamir, Differential Fault Analysis of Secret Key Cryptosystems, Proceedings of Crypto '97. [.ps.gz]

E. Biham, A Fast New DES Implementation in Software, CS 0891, Fast Software Encryption 4, 1997. [.ps.gz]

E. Biham, Cryptanalysis of Ladder-DES, CS 0890, Fast Software Encryption 4, 1997. [.ps.gz]

A. Biryukov and S. Even, Cryptanalysis of the Portz Interconnection Network Block Cipher [.ps.gz], CS0887, Technion (reported at DIMACS'97 "Cryptography and Network Security"). [.ps] [.ps.gz]

S. Blake-Wilson, D. Johnson, and A. Menezes, Key Agreement Protocols and their Security Analysis, Technical Report CORR 97-17, University of Waterloo. Revised version. An extended abstract of this paper appears in Cryptography and Coding: 6th IMA Conference, Springer Verlag, 1997. [.ps]

S. Blake-Wilson and A. Menezes, Entity Authentication and Authenticated Key Transport Protocols Employing Asymmetric Techniques, Security Protocols Workshop '97, Springer Verlag, 1997. Revised version. [.ps]

M. Blaze and M. Strauss, Proxy Cryptography. Draft, May 1997. [.ps]

M. Blaze, J. Feigenbaum, P. Resnick, and M. Strauss, Managing Trust in an Information-Labeling System, European Transactions on Telecommunications, 8 (1997), pp. 491-501. Special issue of selected papers from the 1996 Amalfi Conference on Secure Communication in Networks.

D. Bleichenbacher, On the Security of the KMOV Public Key cryptosystem, in Advances in Cryptology - CRYPTO '97, LNCS vol. 1294. Springer-Verlag, pp. 235-248, 1997. [.ps] [.ps.gz]

D. Bleichenbacher, M. Joye, and J.-J. Quisquater, A new and optimal chosen-message attack on RSA-type cryptosystems, Information and Communications Security - ICICS'97, LNCS vol. 1334. Springer-Verlag, pp. 302-313, 1997. [.ps] [.ps.gz]

G. Bleumer and M. Schunter, Privacy Oriented Clearing for the German Healthcare System; Personal Medical Information -- Security, Engineering, and Ethics, Springer-Verlag, Berlin 1997, 175-194. [.ps.gz]

C. Blundo and D. Stinson, Anonymous secret sharing schemes; Discrete Applied Math 77 (1997), 13-28. [.ps]

D. Boneh, R. Lipton, and R. DeMillo, On the Importance of Checking Cryptographic Protocols for Faults, Proceedings of Eurocrypt '97, Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, 1997, pp. 37-51.

D. Boneh and R. Venkatesan, Rounding in lattices and its cryptographic applications, Proceedings of SODA 1997, pp. 675-681.

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]

A. Bosselaers, Even faster hashing on the Pentium, presented at the rump session of Eurocrypt'97. [.pdf]

A. Bosselaers, R. Govaerts, and J. Vandewalle, SHA: A design for parallel architectures?, Advances in Cryptology, Proceedings Eurocrypt'97, LNCS 1233, W. Fumy, Ed., Springer-Verlag, 1997, pp. 348-362. [.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]

C. Boyd, Digital Signature and Public Key Cryptosystem in a Prime Order Subgroup of Zn*, ICICS'97, Springer-Verlag, 1997. [.ps.gz]

C. Boyd, Extensional Goals for Authentication Protocols, DIMACS Workshop on Cryptographic Protocol Design and Verification, 1997.

C. Boyd, On Key Agreement and Conference Key Agreement, Information Security and Privacy, LNCS 1270, pp.294-302, Springer-Verlag 1997. [.ps.gz]

H. Brandt, J. Myers, and S. Lomonaco, Jr., Aspects of entangled translucent eavesdropping in quantum cryptography, Phys. Rev. A, Vol. 56, No. 6, December 1997, pp. 4456-4465.

G. Brassard, C. Crépeau, D. Mayers, and L. Salvail, A brief review on the impossibility of quantum bit commitment; Posted as paper 9712023 on quant-ph archive, 11 pages, December 1997.

G. Brassard and C. Crépeau, Oblivious Transfers and Privacy Amplification; Advances in Cryptology: Proceedings of Eurocrypt '97, Springer-Verlag, pages 334-347, 1997. [.ps.gz]

J. Buchmann and S. Paulus, A one way function based on ideal arithmetic in number fields; Technical Report No. TI-5/97, 1997. [.ps.gz]

C. Cachin and U. Maurer, Linking information reconciliation and privacy amplification [.ps], Journal of Cryptology, 10(2):97-110, 1997. [.ps] [.ps.gz]

C. Cachin, Smooth entropy and Rényi entropy [.ps], Advances in Cryptology: EUROCRYPT '97, ed. Walter Fumy, volume 1233 of Lecture Notes in Computer Science, Springer-Verlag, 1997, pp. 193-208. [.ps] [.ps.gz]

C. Cachin and U. Maurer, Smoothing probability distributions and smooth entropy; Preprint (Abstract in Proc. 1997 IEEE International Symposium on Information Theory, Ulm), 1997. [.ps] [.ps.gz]

C. Cachin, Entropy Measures and Unconditional Security in Cryptography; volume 1 of ETH Series in Information Security and Cryptography. Hartung-Gorre Verlag, Konstanz, Germany, 1997. ISBN 3-89649-185-7 (Reprint of Ph.D. dissertation No. 12187, ETH Zürich).

C. Cachin and U. Maurer, Unconditional security against memory-bounded adversaries [.ps], Advances in Cryptology: CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pp. 292-306. Springer-Verlag, 1997. [.ps] [.ps.gz]

J. Camenisch, Efficient and Generalized Group Signatures, Advances in Cryptology -- EUROCRYPT '97, v. 1233 of Lecture Notes in Computer Science, Springer Verlag, 1997, pp. 465-479. [.txt - abstract] [.ps]

J. Camenisch, Efficient and generalized group signatures; In Advances in Cryptology - EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 465-479, Springer Verlag, 1997. [.txt - abstract] [.pdf] [.ps]

J. Camenisch and M. Stadler, Proof Systems for General Statements about Discrete Logarithms, Techreport TR 260, 13 pp. Institute for Theoretical Computer Science, ETH Zürich, March 1997. [.txt - abstract] [.ps] [.ps.gz]

J. Camenisch and M. Stadler, Efficient Group Signature Schemes for Large Groups, Advances in Cryptology -- CRYPTO '97, Lecture Notes in Computer Science v. 1294, Springer Verlag, 1997, pp. 410-424. [.ps] [.ps.Z] [.ps.gz]

J. Camenisch, U. Maurer, and M. Stadler, Digital Payment Systems with Passive Anonymity-Revoking Trustees, Journal of Computer Security, v. 5, n. 1, IOS Press, 1997. [.ps] [.ps.Z] [.ps.gz]

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

R. Canetti, S. Halevi, and A. Herzberg, How to Maintain Authenticated Communication in the Presence of Break-ins, PODC '97. Preliminary version available as Theory of Cryptography Library: Record Arc-02.

Y.-h. Chu, J. Feigenbaum, B. LaMacchia, P. Resnick, and M. Strauss, REFEREE: Trust Management for Web Applications, World Wide Web Journal, 2 (1997), pp. 127-139. Reprinted from Proceedings of the 6th International World Wide Web Conference, World Wide Web Consortium, Cambridge, 1997, pp. 227-238. [.ps]

A. Clark, Key Recovery - Why, How, Who?, Compsec '97, London, Elsevier. [.pdf]

A. Clark, Security Auditing, A Methodology, COSAC 97, Newcastle Co. Down. [.pdf]

A. Clark, Crypto Toolkits -- Addressing Clients' Real Requirements, PKS '97, Toronto. [.pdf]

A. Clark, Secure Email, Fact or Fiction?, COSAC 97, Newcastle Co. Down. [.pdf]

C. Crépeau, La cryptographie : pour que les secrets le restent; Les grands Dossiers, "Nouvelles Technologies de l'information", CyberSciences, June 1997.

C. Crépeau, Efficient Cryptographic Protocols Based on Noisy Channels; Advances in Cryptology: Proceedings of Eurocrypt '97, Springer-Verlag, pages 306-317, 1997. [.ps.gz]

R. Cramer, R. Gennaro, and B. Schoemakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, Proceedings of EUROCRYPT '97, Springer-Verlag, LNCS 1233, pp.103-118. Also in European Transactions on Telecommunications. [.ps]

R. Cramer, R. Gennaro, and B. Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme; Appears in European Transactions of Telecommunications Vol.8, No.5. A preliminary version appears at EUROCRYPT'97. [.ps]

R. Cramer and I. Damgård, Linear Zero-Knowledge: A Note on Efficient Zero-Knowledge Proofs and Arguments, Proceedings of 29th Annual ACM Symposium on Theory of Computing (STOC '97), El Paso, Texas, ACM Press, pp. 436-445. [.ps]

L. Cranor and R. Cytron, Sensus: A Security-Conscious Electronic Polling System for the Internet, Proceedings of the Hawai`i International Conference on System Sciences, January 7-10, 1997, Wailea, Hawai`i, USA.

I. Damgård and B. Pfitzmann, Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP; BRICS Report Series RS-97-50, Computer Science Department, Aarhus University, Dec. 1997.

A. De Santis, G. Di Crescenzo, and G. Persiano, Randomness-efficient Non-Interactive Zero-knowledge, ICALP '97 (with G. Di Crescenzo, and G. Persiano). [.ps]

S. Decatur, O. Goldreich, and D. Ron, Computational Sample Complexity; April 1997. [.ps]

Y. Desmedt, Some Recent Research Aspects of Threshold Cryptography, E. Okamoto, G. Davida and M. Mambo, eds., Information Security, Proceedings (Lecture Notes in Computer Science 1396), pp. 158-173. Springer-Verlag, 1997. Tatsunokuchi, Ishikawa, Japan, September.

Y. Desmedt, Redistributing secret shares to new access structures and its applications; 1997 [.ps]

J.-F. Dhem, M. Joye, and J.-J. Quisquater, Normalisation in diminished-radix modulus transformation, IEE Electronics Letters, 33 (23), p. 1931, November 1997. [.ps.gz]

C. Dwork, J. Lotspiech, and M. Naor, Digital Signets: Self-Enforcing Protection of Digital Information; Proc. 28th Ann. ACM Symp. on Theory of Computing, 1997, pp.

J. Feigenbaum and M. Strauss, An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract), in Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1200, Springer, Berlin, 1997, pp. 523-534. [.ps]

E. Felten, D. Balfanz, D. Dean, and D. Wallach, Web Spoofing: An Internet Con Game, Proc. of 20th National Information Systems Security Conference, Oct. 1997.

N. Ferguson and B. Schneier, Cryptanalysis of Akelarre, Fourth Annual Workshop on Selected Areas in Cryptography, August 1997, pp. 201-212.

E. Ferrari, P. Samarati, E. Bertino, and S. Jajodia, Providing flexibility in information flow control for object-oriented systems, Proc. IEEE Symp. on Security and Privacy, Oakland, Calif., May 1997, pages 130-140. [.ps]

M. Fischlin, Lower Bounds for the Signature Size of Incremental Schemes, IEEE Symposium on Foundations of Computer Science (FOCS), pp.438-447, 1997.

M. Fischlin, Incremental Cryptography and Memory Checkers, Advances in Cryptology - Eurocrypt '97, Lecture Notes in Computer Science, Vol.1233, Springer-Verlag, pp.393-408, 1997.

M. Fischlin, Practical Memory Checkers for Stacks, Queues and Deques, Information Security and Privacy - ACISP '97, Lecture Notes in Computer Science, Vol.1270, Springer-Verlag, pp.114-125, 1997.

D. Fox, Ein effizientes und sicheres digitales Signatursystem; In: Müller, G.; Rannenberg, K.; Reitenspieß, M.; Stiegler, H. (Hrsg.): Verläßliche IT-Systeme - Zwischen Key Escrow und elektronischem Geld, Vieweg, Braunschweig 1997, S. 121-137.

D. Fox, Sichere digitale Signatursysteme; In: Mit Sicherheit in die Informationsgesellschaft. Tagungsband 5. Deutscher IT-Sicherheitskongreß des BSI 1997, SecuMedia Verlag, Ingelheim 1997, S. 61-76.

D. Franklin and D. Malkhi, Auditable metering with lightweight security, Journal of Computer Security. Earlier version in Proc. Financial Cryptography '97, Springer-Verlag. [.ps]

M. Franklin and M. Reiter, Fair exchange with a semi-trusted third party, Proc. ACM Conference on Computer and Communications Security, 1997. [.ps]

M. Franklin and M. Reiter, Fair exchange with a semi-trusted third party, Proc. ACM Conference on Computer and Communications Security, 1997. [.ps]

M. Franklin and A. Beimel, Reliable communication over partially authenticated networks, Proc. 11th International Workshop on Distributed Algorithms (WDAG 1997). [.ps]

M. Franklin and D. Boneh, Efficient generation of shared RSA keys, Advances in Cryptology -- Crypto '97 Proceedings.

E. Gabber, P. Gibbons, Y. Matias, and A. Mayer, How to Make Personalized Web Browsing Simple, Secure, and Anonymous, Proc. Financial Cryptography'97, Springer-Verlag LNCS 1318. [.ps.gz]

J. Garay, R. Gennaro, C. Jutla, and T. Rabin, Secure Distributed Storage and Retrieval, Theoretical Computer Science. A preliminary version appeared in WDAG'97. [.ps]

R. Gennaro and P. Rohatgi, How to Sign Digital Streams, Proceedings of CRYPTO'97. [.ps]

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

E. Gerck, Overview of Certification Systems: X.509, CA, PGP and SKIP , published on the Internet by MCG 1997/98. [.pdf]

I. Goldberg, D. Wagner, and E. Brewer, Privacy-enhancing technologies for the Internet, IEEE COMPCON '97, February 1997.

O. Goldreich, A Computational Perspective on Sampling (survey); May 1997. [.ps]

O. Goldreich, Randomness, Interaction, Proofs and Zero-Knowledge (a survey); 1987. [.ps]
See a revised version of the part on Computational Randomness; 1987 (rev. 1997). [.ps]

O. Goldreich, B. Pfitzmann, and R. Rivest, Self-Delegation with Controlled Propagation -- or -- What If You Lose Your Laptop; Theory of Cryptography Library 97-12, September 1997.

O. Goldreich and D. Ron, Property Testing in Bounded-Degree Graphs; 1997. [.ps]

O. Goldreich and D. Ron, A Sublinear Bipartite Tester for Bounded Degree Graphs; 1997. [.ps]

O. Goldreich, S. Goldwasser, and D. Ron, A Note on Testing Monotinicity; 1997. [.ps]

O. Goldreich and D. Zuckerman, Another proof that BPP subseteq PH (and more); September 1997. [.ps]

O. Goldreich, B. Pfitzmann, and R. Rivest, Self-Delegation with Controlled Propagation; September 1997. [.ps]

O. Goldreich, Combinatorial Property Testing -- A Survey; 1997. [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem, Proceedings of Crypto '97.

O. Goldreich, The Foundations of Cryptography -- An Essay; June 1997.

O. Goldreich and S. Goldwasser, On the Limits of Non-Approximability of Lattice Problems; Sept. 1997. [.ps]

L. Gong, New Security Architectural Directions for Java (Extended Abstract), Proceedings of IEEE COMPCON, San Jose, California, February 1997, pp.97--102. [.ps.gz]

L. Gong, M. Mueller, H. Prafullchandra, and R. Schemers, Going Beyond the Sandbox: An Overview of the New Security Architecture in the Java Development Kit 1.2, Proceedings of the USENIX Symposium on Internet Technologies and Systems, Monterey, California, December 1997, pp. 103-112. [.ps.gz]

L. Gong, Enclaves: Enabling Secure Collaboration over the Internet, IEEE Journal on Selected Areas in Communications, 15(3):567--575, April 1997. [.ps.gz]

S. Haber and W. Stornetta, Secure Names for Bit-Strings, Proceedings of the 4th ACM Conference on Computer and Communication Security, 1997. [.ps]

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]

C. Hall and B. Schneier, Remote Electronic Gambling, 13th Annual Computer Security Applications Conference, ACM Press, December 1997, pp. 227-230.

D. Hamer, Enigma: Actions Involved in the 'Double Stepping' of the Middle Rotor, Cryptologia, Vol.XXI(1), January 1997, pp. 47-50. [.pdf.zip]

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]

H. Heys, Linearly Weak Keys of RC5, IEE Electronics Letters, vol. 33, no. 10, pp. 836-838, 1997. [.ps]

M. Hirt and U. Maurer, Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation, Proceedings of the Sixteenth ACM Symposium on Principles of Distributed Computing (PODC),1997. [.txt - abstract] [.pdf] [.ps]

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

D. Jablon, Extended Password Key Exchange Protocols Immune to Dictionary Attacks , Proceedings of the Sixth Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WET-ICE '97), IEEE Computer Society, June 18-20, 1997, Cambridge, MA, pp. 248-255.

S. Jajodia, P. Samarati, and V. S. Subrahmanian, A logical language for expressing authorizations,'' Proc. IEEE Symp. on Security and Privacy, Oakland, Calif., May 1997, pp. 31-42. [.ps]

S. Jajodia, P. Samarati, V. Subrahmanian, and E. Bertino, A Unified Framework for Enforcing Multiple Access Control Policies, Proc. ACM SIGMOD Int'l. Conf. on Management of Data, May 1997, pp. 474-485. [.ps]

S. Jarecki and A. Odlyzko, An efficient micropayment system based on probabilistic polling, Financial Cryptography, R. Hirschfeld, ed., Lecture Notes in Computer Science #1318, Springer, 1997, pp. 173-191. [.pdf] [.ps]

M. Joye and J.-J. Quisquater, Cryptosystem of Chua and Ling, IEE Electronics Letters, 33 (23), p. 1938, November 1997. [.ps.gz]

M. Joye, J.-J. Quisquater, and T. Takagi, How to choose secret parameters for RSA-type cryptosystems over elliptic curves, Technical Report TI-35/97, Technische Universität Darmstadt, Darmstadt, November 1997. [.ps.gz]

M. Joye and J.-J. Quisquater, Faulty RSA encryption; Tech. Report CG-1997/8, UCL Crypto Group, Louvain-la-Neuve, July 1997. [.ps.gz]

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]

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]

A. Juels, M. Luby, and R. Ostrovsky, Security of Blind Digital Signatures, Crypto '97. [.ps]

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

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]

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

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

L. Knudsen and V. Rijmen, Truncated Differentials of IDEA, ESAT-COSIC Technical Report 97-1, 1997. [.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]

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 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, Characterization of (k,n) Multi-Receiver Authentication, Information and Privacy, 2nd Australasian Conference, ACISP'97, LNCS 1270, 1997, pp. 204-215. [.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 and S. Obana, Combinatorial Bounds of Authentication Codes with Arbitration, EUROCRYPT '95, revised version, December 8, 1997. [.ps]

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

E. Kushilevitz and R. Ostrovsky, Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval, FOCS 97. [.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.

R. Lercier and F. Morain, Algorithms for computing isogenies between elliptic curves, Computational Perspectives On Number Theory, 1997. [.ps.gz]

R. Lercier, Finding Good Random Elliptic Curves for Cryptosystems Defined over GF(2^n), Advances in Cryptology - EUROCRYPT'97, Springer-Verlag. [.ps.gz]

R. Anderson and C. Manifavas, Chameleon - A New Kind of Stream Cipher, Fourth Workshop on Fast Cipher Encryption, Haifa, January 1997. [.ps.gz]

W. Mao, Verifiable Escrowed Signature, Second Australian Conference in Information Security and Privacy. LNCS 1270, pp 240-248, Springer. Sydney, July, 1997. [.ps]

D. Martin, S. Rajagopalan, and A. Rubin, Blocking Java Applets at the Firewall; Proc. ISOC Symposium on Network and Distributed System Security (February, 1997). [.ps]

Y. Matias, A. Mayer, and A. Silberschatz Lightweight Security Primitives for E-Commerce, Proc. USENIX Symposium On Internet Technologies and Systems (USITS), 1997. [.ps]

U. Maurer, Information-theoretically secure secret-key agreement by NOT authenticated public discussion; Computer Science Department, ETH Zürich. 1997. in Proceedings of EUROCRYPT '97 [.txt - abstract] [.pdf] [.ps]

U. Maurer and S. Wolf, Privacy Amplification Secure Against Active Adversaries; Computer Science Department, ETH Zürich. 1997. in Proceedings of CRYPTO '97 [.txt - abstract] [.ps]

D. Micciancio, Oblivious Data Structures: Applications to Cryptography; STOC'97 [.ps]

D. Micciancio, "Pseudo-Random" Number Generation within Cryptographic Algorithms: The DSS Case; Crypto'97 [.ps]

D. Micciancio, An Algorithm for the Solution of Tree Equations; CAAP'97 [.ps]

F. Monrose and A. Rubin, Authentication via Keystroke Dynamics; 4th ACM Conference on Computer and Communcations Security (April, 1997). [.ps] [.pdf]

M. Morconi, X. Qian, R. A. Riemenschneider, and L. gong, Secure Software Architectures, Proceedings of the IEEE Symposium On Security And Privacy, Oakland, California, May 1997, pp.84--93. [.ps.gz]

M. Naor and O. Reingold, Number-Theoretic constructions of efficient pseudo-random functions; Extended abstract in: Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 458-467

M. Naor and B. Pinkas, Visual Authentication; Crypto 97. [.ps.gz]

M. Naor and O. Reingold, On the construction of pseudo-random permutations: Luby-Rackoff revisited, J. of Cryptology. Extended abstract in: Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 189-199.

P. Nguyen and J. Stern, Merkle-Hellman Revisited: a Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations, Advances in Cryptology -- Proceedings of CRYPTO '97, vol. 1294 of LNCS, Springer-Verlag, pp. 198-212.

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

K. Okada and K. Kurosawa, MDS Secret Sharing Schemes Secure against Cheaters, Proc. of IEEE ISIT'97, 1997, p. 90. [.ps]

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

H. Petersen, Faires elektronisches Geld; 5.Deutscher IT-Sicherheitskongress, SecuMedia, (1997), S. 425 - 444. [.ps.gz]

H. Petersen and P. Horster, Self certified keys - Concepts and Applications; Proc. Communications and Multimedia Security'97, Athen, Chapman & Hall, (1997), S. 102 - 116 [.ps.gz]

H. Petersen, P. Horster, and M. Michels, How to convert any digital signature scheme into a group signature scheme; Proc. Security Protocols Workshop, Paris, April, (1997), LNCS 1361, Springer Verlag, S. 177 - 190 [.ps.gz]

B. Pfitzmann and M. Waidner, How to Break Fraud-Detectable Key Recovery; IBM Research Report RZ 2970 11/03/1997, IBM Research Division, Zürich, Oct. 1997. [.pdf] [.ps.gz]

B. Pfitzmann and M. Waidner, Asymmetric Fingerprinting for Larger Collusions; 4th ACM Conference on Computer and Communications Security, Zürich, April 1997, 151-160. [.ps.gz]

D. Pointcheval and J. Stern, New Blind Signatures Equivalent to Factorization, Proceedings of the 4th ACM Conference on Computer and Communications Security, pages 92-99, ACM Press, 1997.

B. Preneel, A. Bosselaers, and H. Dobbertin, The cryptographic hash function RIPEMD-160, CryptoBytes, Vol. 3, No. 2, 1997, pp. 9-14. [.pdf]

J.-J. Quisquater and M. Joye, Authentication of sequences with the SL2 hash function: Application to video sequences, Journal of Computer Security, 5(3), pp. 213-223, 1997. [.ps.gz]

C. Radu, Analysis and design of off-line electronic payment systems, Doctoral Dissertation, K.U. Leuven, October 1997.

V. Rijmen and B. Preneel, A family of trapdoor ciphers, Fast Software Encryption, LNCS 1267, E. Biham, Ed., Springer-Verlag, 1997, pp. 139-148. [.ps.gz]

H. Ritter and C. Rössner, Factoring via Strong Lattice Reduction Algorithm, Technical Report, Universität Frankfurt am Main, Mai 1997. [.ps]

R. Rivest, Perspectives on Financial Cryptography; iinvited talk given at the Financial Cryptography '97 conference. [.ps] [.ppt]

R. Rivest, All-Or-Nothing Encryption and The Package Transform, proceedings of the 1997 Fast Software Encryption Conference. [.ps]

R. Rivest, Cryptography as Duct Tape; a short note written to the Senate Commerce and Judiciary Committees in opposition to mandatory key recovery proposals. Version of June 12, 1997 [.txt]

R. Rivest, Electronic Lottery Tickets as Micropayments; Financial Cryptography '97. [.ps]

A. Rubin, An Experience Teaching a Graduate Course in Cryptography; Cryptologia (April, 1997). [.ps]

A. Rubin, D. Boneh, and K. Fu, Revocation of Unread E-mail in an Untrusted Network; Second Australasian Conference on Information Security and Privacy (July, 1997).

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]

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 C. Hall, An Improved E-mail Security Protocol, 13th Annual Computer Security Applications Conference, ACM Press, December 1997, pp. 232-238.

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

B. Schneier, Why Cryptography is Harder than it Looks, Information Security Bulletin, v. 2, n. 2, March 1997, pp. 31-36.

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

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]

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

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

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

Y. Tsiounis, Y. Frankel, and B. Patt-Shamir, Exact Analysis of Exact Change; The 5th Israel Symposium on the Theory of Computing Systems (ISTCS '97), June 17-19, Ran-Gatan Israel, pages 107-119, IEEE Computer Society Press.

Y. Tsiounis, Micropayments and anonymous e-cash; for the IEEE local (New England) chapter, February 13, 1997. [.ppt]

Y. Tsiounis, G. Davida, Y. Frankel, and M. Yung, Anonymity Control in E-Cash Systems; Financial Cryptography '97, Anguilla, British West Indies, February 24-27.

Y. Tsiounis, Anonymity in Electronic Commerce; as part of a panel discussion given at the 22nd Conferece on Local Computer Networks (LCN '97), Minneapolis, Minessota, November 4th, 1997. [.ppt]

Y. Tsiounis, Balancing Anonymity and Accountability; as part of a panel discussion given at the University of Wisconsin at Milwaukee, December 12th, 1997. [.ppt]
Abstract. [.txt]

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.

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.

J. Xu and H. Heys, A New Criterion for the Design of 8x8 S-boxes in Private-Key Ciphers, IEEE Canadian Conference on Electrical and Computer Engineering (CCECE '97), St. John's, Newfoundland, May 1997. [.ps]

A. Young and M. Yung, Deniable Password Snatching: On the Possibility of Evasive Electronic Espionage, Proceedings of the 1997 IEEE Symposium on Security and Privacy, pp 224-235, May 5-7, IEEE Computer Society Press, 1997. [.ps]

X. Zhang, Y. Zheng, and H. Imai, Duality of Boolean Functions and Its Cryptographic Significance; Information and Communications Security --- Proceedings of 1997 International Conference on Information and Communications Security (ICICS'97), Beijing, Lecture Notes in Computer Science, Vol. 1334, pp. 159-169, Springer-Verlag, 1997. [.ps]

X. Zhang, Y. Zheng, and H. Imai, Non-existence of Certain Quadratic S-boxes and Two Bounds on Nonlinear Characteristics of General S-boxes; Proceedings of the Forth Annual Workshop on Selected Areas in Cryptography (SAC'97), pp. 27-39, August 1997. [.ps] [.ps.Z]

X. Zhang and Y. Zheng, New Lower Bounds on Nonlinearity and A Class of Highly Nonlinear Functions; Information Security and Privacy --- ACISP'97, Lecture Notes in Computer Science, Vol. 1270, pp. 90-101, Springer-Verlag, 1997. [.ps]

X. Zhang and Y. Zheng, Cryptographically Resilient Functions; IEEE Transactions on Information Theory, Vol.43, No.5, pp.1740-1747, September 1997 [.ps] [.ps.Z]

Y. Zheng, Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption); Advances in Cryptology -- Crypto'97, Lecture Notes in Computer Science, Vol. 1294, pp. 165-179, Springer-Verlag, 1997. (revised version) [.ps] [.ps.Z]

Y. Zheng, The SPEED Cipher; Financial Cryptography --- First International Conference FC'97, Anquilla, the British West Indies, 24-28 February 1997, Lecture Notes in Computer Science, Vol.1318, pp.71-89, Springer-Verlag. [.tar.Z]

Y. Zheng, Signcryption and Its Applications in Efficient Public Key Solutions; Proceedings of 1997 Information Security Workshop (ISW'97), Lecture Notes in Computer Science, Springer-Verlag, 1997. (invited lecture) [.ps] [.ps.Z]

X. Zhu and H. M. Heys, The Analysis of a New Class of Unbalanced CAST Ciphers, presented at IEEE Canadian Conference on Electrical and Computer Engineering (CCECE '97), St. John's, Newfoundland, May 1997. [.ps]

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