Please click our sponsor

Crypto Bibliography Year 1997

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

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

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.

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.

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

R. Anderson and M. Roe, The GCHQ Protocol and its Problems, Eurocrypt 97.

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.

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.

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.

D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, Locally Random Reductions: Improvements and Applications, Journal of Cryptology, 10 (1997), pp. 17-36.

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, 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. 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, 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 Note on Negligible Functions, Technical Report CS97-529, Department of Computer Science and Engineering, UCSD, March 1997.

M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proofs; August 1991. Addendum, May 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 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, 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, 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, A Note on Negligible Functions; Technical Report CS97-529, Department of Computer Science and Engineering, UCSD, March 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, 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 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 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.

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.

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

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

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

E. Biham and A. Shamir, Differential Fault Analysis of Secret Key Cryptosystems, CS 0910, Proceedings of Crypto'97.

E. Biham and T. Mor, Bounds on Information and the Security of Quantum Cryptography, Physical Review Letters, Vol. 79, No. 20, pp. 4024-4037, November 1997.

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

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

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

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.

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.

M. Blaze and M. Strauss, Proxy Cryptography. Draft, May 1997.

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.

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.

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.

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.

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

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.

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.

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

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 and C. Crépeau, Oblivious Transfers and Privacy Amplification; Advances in Cryptology: Proceedings of Eurocrypt '97, Springer-Verlag, pages 334-347, 1997.

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.

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

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

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

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

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

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.

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.

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.

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

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.

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

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

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

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

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

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

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

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.

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.

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.

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

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

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

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.

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

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.

J. Feigenbaum, S. Rudich, M. Blaze, and K. McCurley, Security and Privacy in the Information Economy, Proceedings of the National Academy of Sciences, 94 (1997), pp. 2789-2792.

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.

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.

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, Lower Bounds for the Signature Size of Incremental Schemes, IEEE Symposium on Foundations of Computer Science (FOCS), pp.438-447, 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, 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. 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. Franklin and D. Malkhi, Auditable metering with lightweight security, Journal of Computer Security, to appear. Earlier version in Proc. Financial Cryptography '97, Springer-Verlag.

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

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.

J. Garay, R. Gennaro, C. Jutla, and T. Rabin, Secure Distributed Storage and Retrival, Theoretical Computer Science, to appear. A preliminary version appers in WDAG'97.

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

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

E. Gerck, Certification: Intrinsic, Extrinsic and Combined; Published on the Internet by MCG 1997.

E. Gerck, Overview of Certification Systems: X.509, CA, PGP and SKIP ; Published on the Internet by MCG 1997/98.

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

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. Zuckerman, Another proof that BPP subseteq PH (and more); September 1997.

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

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

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

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

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

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

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

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

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

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.

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

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

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

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.

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

H. Handschuh and H. Gilbert, X2 Cryptanalysis of the SEAL Encryption Algorithm, Fast Software Encryption - FSE4, LNCS, volume 1267, pp. 1-12, 1997.

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.

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

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.

Y. Ishai and E. Kushilevitz, Private Simultaneous Messages Protocols with Applications, ISTCS97.

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

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.

M. Jakobsson, Applying Anti-Trust Policies to Increase Trust in a Versatile E-Money System; Financial Cryptography '97

M. Jakobsson, Distributed Magic Ink DSS Signatures; Eurocrypt '97

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.

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.

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.

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

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

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.

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

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.

L. Knudsen and T. Jakobsen, The Interpolation Attack on Block Ciphers, Proc. Fast Software Encryption '97, to appear.

L. Knudsen, J. Daemen, and V. Rijmen, The block cipher SQUARE, Proc. Fast Software Encryption '97, to appear.

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.

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.

K. Kurosawa and S. Obana, Combinatorial Bounds of Authentication Codes with Arbitration, EUROCRYPT '95, revised version, December 8, 1997.

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.

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

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

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.

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

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

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

W. Mao, Publicly Verifiable Partial Key Escrow, Information and Communications Security, ICICS '97, Springer-Verlag, pp. 409-413.

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

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

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

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

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

A. Mayer and M. Yung, Generalized Secret-Sharing and Group-Key Distribution using Short Keys, Proc. SEQUENCES, 1997.

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

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

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

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

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.

M. Naor and B. Pinkas, Visual Authentication; Crypto 97.

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

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

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.

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

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.

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

J. Patarin and L. Goubin, Asymmetric Cryptography with S-Boxes, Proceedings of ICICS'97, Springer, Lecture Notes in Computer Science, Vol. 1334, November 1997, pp. 369-380.

J. Patarin and L. Goubin, Trapdoor one-way permutations and multivariate polynomials, Proceedings of ICICS'97, Springer, Lecture Notes in Computer Science, Vol. 1334, November 1997, pp. 356-368.

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

H. Petersen and G. Poupard, Efficient Scalable Fair Cash with Off-line Extortion Prevention; Technischer Report, ENS, April, (1997), 33 Seiten, Kurzfassung Proc. ICICS'97, Peking, LNCS 1334, Springer Verlag, S. 463 - 477.

H. Petersen and M. Michels, A note on "Magic Ink Signatures"; Manuskript, Juni, (1997), 4 Seiten.

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

H. Petersen and M. Michels, On signature schemes with threshold verification detecting malicious verifiers; Proc. Security Protocols Workshop, Paris, April, (1997), LNCS 1361, Springer Verlag, S. 67 - 78

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

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

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.

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

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.

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.

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

R. Rivest, Perspectives on Financial Cryptography; iinvited talk given at the Financial Cryptography '97 conference, (PowerPoint slides)

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

R. Rivest, All-Or-Nothing Encryption and The Package Transform; To appear in the Proceedings of the 1997 Fast Software Encryption Conference

R. Rivest, Electronic Lottery Tickets as Micropayments; rump session talk given at the Financial Cryptography '97 conference, and to appear in the proceedings of that conference

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

A. Rubin, An Experience Teaching a Graduate Course in Cryptography; Cryptologia (April, 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.

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.

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.

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.

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

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.

Y. Tsiounis, Balancing Anonymity and Accountability; as part of a panel discussion given at the University of Wisconsin at Milwaukee, December 12th, 1997. An abstract is available. A relevant article on anonymous cash appeared in the Milwaukee Journal of 12/15/97.

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, 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. Powerpoint 4.0 slides are also available.

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.

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.

A. Young and M. Yung, Encryption Tools for Mobile Agents: Sliding Encryption, Proceedings of the 1997 Fast Software Encryption Workshop, 1997.

A. Young and M. Yung, The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems, CRYPTO '97, pp 264-276, Springer-Verlag.

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.

A. Young and M. Yung, Kleptography: Using Cryptography Against Cryptography, Eurocrypt '97, pages 62-74, Springer-Verlag.

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

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)

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)

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.

J. Zhou and D. Gollmann, An Efficient Non-repudiation Protocol, Proceedings of 10th IEEE Computer Security Foundations Workshop, pages 126--132, Rockport, Massachusetts, June 1997, IEEE Computer Society Press.

J. Zhou and D. Gollmann, Evidence and Non-repudiation, Journal of Network and Computer Applications, 20(3):267--281, London: Academic Press, July 1997.

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.