Crypto Bibliography

R. Cramer, I. Dåard, S. Dziembowski, M. Hirt, and T. Rabin, Efficient multiparty computations secure against an adaptive adversary, Advances in Cryptology -- EUROCRYPT '99, LNCS v. 1592, 1999, pp. 309-323. [.ps.gz]

J. Buchmann, Düllmann, and Williams, On the complexity and efficiency of a new key exchange system; (EuroCrypt 1989) [.ps.gz]

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

C. Burwick, D. Coppersmith, E. D'Avignon, R. Gennaro, S. Halevi, C. Jutla, S. Matyas Jr., L. O'Connor, M. Peyravian, D. Safford, and N. Zunic, MARS - a candidate cipher for AES, First AES conference, 1998. [.pdf] [.ps]

J. Daemen, L. Van Linden, R. Govaerts, and J. Vandewalle, Propagation properties of multiplication modulo 2n-1, Proceedings 13th Symposium on Information Theory in the Benelux, Enschede (NL), June 1-2, 1992, pp. 111-118. [.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, 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, M. Peeters, V. Rijmen, and G. Van Assche, The Noekeon Block Cipher, Nessie Proposal, First Open Nessie Workshop, November 2000.

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]

J. Daemen, R. Govaerts, and J. Vandewalle, Correlation matrices, Fast Software Encryption, LNCS 1008, B. Preneel, Ed., Springer-Verlag, 1995, pp. 275-285. [.ps.gz]

J. Daemen, R. Govaerts, and J. Vandewalle, A hardware design model for cryptographic algorithms, Computer Security - ESORICS'92, Proceedings 2nd European Symposium on Research in Computer Security, LNCS 648, Y. Deswarte, G. Eizenberg and J.-J. Quisquater, Eds., Springer-Verlag, 1992, pp. 419-434. [.ps.gz]

J. Daemen, Cipher and hash function design. Strategies based on linear and differential cryptanalysis, Doctoral Dissertation , March 1995.

J. Daemen, R. Govaerts, and J. Vandewalle, An efficient nonlinear shift-invariant transformation, Proceedings of the Fifteenth Symposium on Information Theory in the Benelux, Louvain-la-Neuve (B), May 30-31, 1994, pp. 82-89. [.ps.gz]

J. Daemen, R. Govaerts, and J. Vandewalle, Resynchronization weaknesses in synchronous stream ciphers, Advances in Cryptology, Proceedings Eurocrypt'93, LNCS 765, T. Helleseth, Ed., Springer-Verlag, 1994, pp. 159-169. [.ps.gz]

J. Daemen, M. Peeters, and G. Van Assche, Bitslice Ciphers and Power Analysis Attacks, Fast Software Encryption 2000.

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]

J. Daemen, R. Govaerts, and J. Vandewalle, Weak keys of IDEA, Advances in Cryptology, Proceedings Crypto'93, LNCS 773, D. Stinson, Ed., Springer-Verlag, 1994, pp. 224-231. [.ps.gz]

J. Daemen and V. Rijmen, J. Daemen and V. Rijmen, The Block Cipher Rijndael, Proc. of CARDIS'98, LNCS, Springer-Verlag.

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

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]

V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers, and E. De Win, The cipher SHARK, Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp. 99-112. [.ps]

J. Daemen, R. Govaerts, and J. Vandewalle, A practical approach to the design of high speed self-synchronizing stream ciphers, Singapore ICCS/ISITA '92 Conference Proceedings, P.Y. Kam and O. Hirota, Eds., IEEE, 1992, pp. 279-283. [.ps.gz]

J. Daemen, R. Govaerts, and J. Vandewalle, A new approach towards block cipher design, Fast Software Encryption, LNCS 809, R. Anderson, Ed., Springer-Verlag, 1994, pp. 18-32. [.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]

R. Cramer and I. Damgård, New Generation of Secure and Practical RSA-based Signatures, CRYPTO '96, Springer Verlag LNCS, vol. 1109, pp. 173--185 [.ps]

I. Damgård, T. Pedersen, and B. Pfitzmann, Statistical Secrecy and Multi-Bit Commitments; BRICS Report Series RS-96-45, Computer Science Department, Aarhus University, Nov. 1996. [.ps.gz]

I. Damgård, O. Goldreich, T. Okamoto, and A. Wigderson, Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs; (Extended Abstract), September 1995. [.ps]
See also partial version by Damgård, Goldreich, and Wigderson, November 1994. [.ps]

R. Cramer and I. Damgård, Zero-Knowledge for Finite Field Arithmetic. Or: Can Zero-Knowledge be for Free?, Proceedings of CRYPTO '98, Springer Verlag LNCS, vol. 1462, pp. 424-441, 1998. [.ps]

R. Cramer, I. Damgård, and U. Maurer, General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme, manuscript, Jan. 1999. Older version: BRICS Report Series RS-97-28, available from http://www.brics.dk, 1997.

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.

J. Camenisch and I. Damgård, Verifiable Encryption and Applications to Group Signatures and Signature Sharing [.pdf], BRICS Technical Report, RS-98-32, 1998. [.pdf] [.ps.gz]

I. Damgård, T. Pedersen, and B. Pfitzmann, On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures; Crypto '93, LNCS 773, Springer-Verlag, Berlin 1994, 250-265. [.ps.gz]

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

I. Damgård, O. Goldreich, and A. Wigderson, Information Theory versus Complexity Theory: Another Test Case; September 1995. [.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. Knudsen and I. Damgaard, The breaking of the AR Hash Function, Advances in Cryptology -- EuroCrypt '93, Springer Verlag, Lecture Note Series 765, pp.286-292, Berlin Heidelberg 1994. [.ps.Z]

D. Chaum, C. Crépeau, and I. Damgaard, Multiparty unconditionally secure protocols; In 19th Symp. on Theory of Computing, pages 11-19. ACM, 1988. [.ps.gz]

L. Knudsen and I. Damgaard, Multiple Encryption with Minimum Key, Cryptography: Policy and Algorithms, International Conference, Brisbane, Queensland, Australia, July 1995, LNCS 1029, Springer Verlag, Berlin Heidelberg, pp. 156-164. [.ps.Z]

N. Daswani, D. Boneh, H. Gracia-Molina, S. Ketchpel, and A. Paepcke, A Generalized Wallet Architecture, Proceedings of the 3rd USENIX Workshop on Electronic Commerce, 1998.

D. Boneh and N. Daswani, Experimenting with electronic commerce on the PalmPilot, Proceedings of Financial Cryptography '99, Lecture Notes in Computer Science, Vol. 1648, Springer-Verlag, pp. 1--16, 1999.

G. Davida, Chosen Signature Cryptanalysis of the RSA (MIT) Public Key Cryptosystem, TR-CS-82-2, Department of EECS, University of Wisconsin-Milwaukee, 1982.

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.

D. Davis, D. Geer, and T. Y. Ts'o, Kerberos With Clocks Adrift: History, Protocols, and Implementation, USENIX Computing Systems 9:1 (Jan. '96). [.pdf] [.ps]

D. Geer and D. Davis, Token-Mediated Certification and Electronic Commerce, Proc. 2nd USENIX Workshop on Electronic Commerce, (Oakland, CA, 1996), pp. 13-22. [.ps]

D. Davis, Defective Sign & Encrypt in S/MIME, PKCS#7, MOSS, PEM, PGP, and XML, Proceedings of Usenix Technical Conference 2001. [.ps]

D. Davis, Kerberos Plus RSA for World Wide Web Security, Proc. 1st USENIX Workshop on Electronic Commerce, (NYC, July 1995).. [.pdf] [.ps] [.txt]

D. Davis, R. Ihaka, and P.R. Fenstermacher, Cryptographic Randomness from Air Turbulence in Disk Drives, Advances in Cryptology -- CRYPTO '94 Conf Proc, ed by Yvo G. Desmedt, pp.114--120. Lecture Notes in Computer Science #839. Heidelberg: Springer-Verlag, 1994. [.pdf] [.ps]

D. Davis, Compliance Defects in Public-Key Cryptography, Proc. 6th Usenix Security Symp, (San Jose, CA, 1996), pp. 171-178. [.pdf] [.ps]

D. Davis and R. Swick, Workstation Services and Kerberos Authentication at Project Athena, MIT Laboratory for Computer Science Technical Memorandum #424 (Feb. 1990). [.ps]

D. Davis and R. Swick, Network Security via Private-Key Certificates, USENIX 3rd Security Symposium Proc., (Baltimore; Sept. '92). Also in ACM Operating Systems Review, v.24, #4 (Oct. 1990). [.ps]

D. Wagner, L. Simpson, E. Dawson, J. Kelsey, W. Millan and B. Schneier, Cryptanalysis of ORYX, Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, pp. 296-305.

P. De Gersem and E. De Win, Analysis and implementation of arithmetic operations in GF(2n), Thesis, K.U.Leuven, 1995.

J.-P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjolsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallee, and M. Waidner, The ESPRIT Project CAFE: High Security Digital Payment Systems; In ESORICS 94 (Third European Symposium on Research in Computer Security), volume 875 of Lecture Notes in Computer Science, pages 217-230, Berlin, 1994. Springer-Verlag. [.ps.gz]

J.-P. Boly, A. Bosselaers, R. Cramer, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmaker, L. Vallée, and M. Waidner, Digital Payment Systems in the ESPRIT Project CAFE; Securicom 94, Paris 1.-3.6.1994, 35-45. [.ps.gz]

J.P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallée, and M. Waidner, The ESPRIT project CAFE - High security digital payment systems, Proceedings ESORICS'94, LNCS 875, D. Gollmann, Ed., Springer-Verlag, 1994, pp. 217-230. [.pdf]

A. De Santis and G. Persiano, Zero-Knowledge Proofs of Knowledge Without Interaction, Proceedings of the 33rd Symposium on Foundations of Computer Science 1992 (FOCS '92), 1992, pp. 427-437. [.ps.gz]

A. De Santis, G. Crescenzo, and G. Persiano, Zero-Knowledge Arguments and Public-Key Cryptography, Information and Computation, v. 121, n. 1, 1995, pp. 23-40 [.ps.gz]

A. De Santis, C. Blundo, and U. Vaccaro, Randomness in Distribution Protocols. An extended abstract of this paper appeared in Proc. of the 21 International Colloquium on Automata, Languages, and Programming (ICALP '94), S. Abiteboul and E. Shamir (Eds.), Lectures Notes in Computer Science v. 820, Springer-Verlag, 1994, pp. 568-579. [.ps.gz]

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

A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung, On Monotone Formula Closure of SZK, Proceedings of the 35th Symposium on Foundations of Computer Science 1994, (FOCS '94), pp. 454-465. [.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]

A. De Santis, C. Blundo, D. R. Stinson, and U. Vaccaro, Graph Decompositions and Secret Sharing Schemes, Journal of Cryptology, v. 8, 1995, 39-64. [.ps.gz]

G. Ateniese, C. Blundo, A. De Santis, and D. Stinson, Visual cryptography for general access structures; Information and Computation 129 (1996), 86-106. [.ps]

A. De Santis, G. Ateniese, C. Blundo, and D. R. Stinson, Constructions and Bounds for Visual Cryptography, ICALP '96. [.ps]

A. De Santis, C. Blundo, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, Theoretical Computer Science, v. 154, 1996, pp. 283-306. [.ps.gz]

A. De Santis, M. Carpenteri, and U. Vaccaro, Size of Shares and Probability of Cheating in Threshold Schemes, Advances in Cryptology -- EUROCRYPT '93, T. Helleseth (Ed.), Lectures Notes in Computer Science, v. 765, Springer-Verlag, 1994, pp. 118-125. [.ps.gz]

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

C. Blundo, A. De Santis, K. Kurosawa, and W. Ogata, On a Fallacious Bound for Authentication Codes, Journal of Cryptology. [.ps]

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]

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]

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

A. De Santis, C. Blundo, G. Persiano, and U. Vaccaro, On the Number of Random Bits in Totally Private Computation. An extended abstract of this paper appeared in Proc. of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP '95), Z. Fülöp and F. Gecseg (Eds.), Lectures Notes in Computer Science, vol. 944, Springer-Verlag, 1995, pp. 171-182. [.ps.gz]

A. De Santis, M. Blum, S. Micali, and G. Persiano, NonInteractive Zero-Knowledge, SIAM Journal on Computing, 20(6):1084-1118, 1991. [.ps.gz]

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

A. De Santis, C. Blundo, G. Persiano, and U. Vaccaro, On the Number of Random Bits in Totally Private Computation, ICALP '95. [.ps.gz]

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

A. De Santis, C. Blundo, L. Gargano, and U. Vaccaro, Secret Sharing Schemes with Veto Capabilities, Proceedings of French-Israeli Workshop in Algebraic Coding, G. Cohen, S. Litsyn, A. Lobstein, and G. Zemor, (Eds), Lectures Notes in Computer Science v. 781, Springer-Verlag, 1994, pp. 82-89. [.ps.gz]

A. De Santis, Tight Upper and Lower Bounds on the Path Length of Binary Tree, SIAM Journal on Computing, 23(1):12--23, 1994 (with G. Persiano). [.ps.gz]

A. De Santis, C. Blundo, G. Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, IEEE Transactions on Information Theory, v. 41, n. 2, 1995, 549-554. [.ps.gz]

E. De Win and B. Preneel, Elliptic curve public-key cryptosystems - an introduction, State of the Art in Applied Cryptography, LNCS 1528, B. Preneel and V. Rijmen, Eds., Springer-Verlag, 1998, pp. 131-141. [.ps]

V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers, and E. De Win, The cipher SHARK, Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp. 99-112. [.ps]

P. De Gersem and E. De Win, Analysis and implementation of arithmetic operations in GF(2n), Thesis, K.U.Leuven, 1995.

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.

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

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]

P. Delsarte, Y. Desmedt, A. Odlyzko, and P. Piret, Fast cryptanalysis of the Matsumoto-Imai public key scheme, Advances in Cryptology: Proceedings of EUROCRYPT 84, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985, pp. 142-149. [.pdf] [.ps]

J. Benaloh and M. deMare, One-way Accumulators: A Decentralized Alternative to Digital Signatures, Advances in Cryptology, Proceedings of EuroCrypt `93, Lofthus, Norway, May 1993. Lecture Notes in Computer Science, ed. G. Goos and J. Hartmanis, v. 765, pp. 274--285, Springer-Verlag, New York, 1994.

J. Benaloh and M. deMare, Efficient Broadcast Time-Stamping, Clarkson University Department of Mathematics and Computer Science Technical Report number TR-MCS-91-1, April 1991. [.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.

R. Deng, L. Gong, A. Lazar, and W. Wang, Authenticated Key Distribution and Secure Broadcast Using No Conventional Encryption: A Unified Approach Based on Block Codes, Proceedings of IEEE Globecom'95, Singapore, November 1995. [.ps.Z]

R. Deng, L. Gong, and A. Lazar, Secure Data Transfer in Asynchronous Transfer Mode Networks, Proceedings of IEEE Globecom'95, Singapore, November 1995. [.ps.Z]

R. Deng, L. Gong, A. Lazar, and W. Wang, Practical Protocols for Certified Electronic Mail, Journal of Network and Systems Management, 4(3):279--297, 1996. [.ps.gz]

D. Denning, An Intrusion-Detection Model [RTF], IEEE Trans. on Software Eng., February 1987. [.rtf]

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. 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, A. Desai, D. Pointcheval, and P. Rogaway, Relations among notions of security for public-key encryption schemes; Advances in Cryptology - CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462, H. Krawczyk, ed., Springer-Verlag.

K. Kurosawa, T. Yoshida, Y. Desmedt, and M. Burmester, Some Bounds and a Construction for Secure Broadcast Encryption, Advances in Cryptology - ASIACRYPT'98, LNCS 1514, 1998, pp. 420-333. [.ps]

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

Y. Desmedt, S. Huo, and J.-J. Quisquater, Audio and Optical Cryptography, Asiacrypt '98. [.ps]

Y. Desmedt, Simmons' protocol is not free of subliminal channels; In Proceedings: 9th IEEE Computer Security Foundations Workshop, p. 170--175, Kenmare, Ireland, June 10--12, 1996. [.ps]

Y. Desmedt and A. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, Advances in Cryptology - CRYPTO '85, H. C. Williams (ed.), Springer Verlag, Lecture Notes in Computer Science #218, 1986, pp. 516-522. [.pdf] [.ps]

Y. Desmedt, Establishing Big Brother using covert channels and other covert techniques, R. Anderson, ed., Information Hiding, First International Workshop, Proceedings (Lecture Notes in Computer Science 1174), pp. 65-71. Springer-Verlag, 1996. Cambridge, U.K., May/June.

Y. Desmedt, B. King, W. Kishimoto, and K. Kurosawa, A comment on the efficiency of secret sharing scheme over any finite Abelian group, Information and Privacy, 3rd Australasian Conference, ACISP'98, LNCS 1438, 1998, pp. 391-402. [.ps]

Y. Desmedt and K. Kurosawa, Practical and proven zero-knowledge constant round variants of GQ and Schnorr, IEICE, Trans. on Fundamentals. [.ps]

P. Delsarte, Y. Desmedt, A. Odlyzko, and P. Piret, Fast cryptanalysis of the Matsumoto-Imai public key scheme, Advances in Cryptology: Proceedings of EUROCRYPT 84, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985, pp. 142-149. [.pdf] [.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.

K. Kurosawa and Y. Desmedt, Optimum traitor tracing and new direction for asymmetricity, Advances in Cryptology - EUROCRYPT '98, LNCS 1403, 1998, pp. 145-157. [.ps]

Y. Frankel and Y. Desmedt, Parallel reliable threshold multisignature, Tech. Report TR-92-04-02, Dept. of EE & CS, Univ. of Wisconsin-Milwaukee, April 1992. [.ps]

H. Luiijf, A. Dey, J. Watson, C. Muckenhirn , and M. Garnsey, Fortezza-enabled Multi-level Sensitive Simulations, The 1998 Spring Simulation Interoperability Workshop, Position Papers, Volume I, March 9-13, 1998, pp. 119-132. [.doc]

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]

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]

J.-F. Dhem, F. Koeune, P.-A. Leroux, P. Mestré, J.-J. Quisquater, and J.-L. Williams, A practical implementation of the Timing Attack, Proc. of CARDIS 1998, 14-16th September 1998. [.ps.gz]

G. Di Crescenzo, N. Ferguson, R. Impagliazzo, and M. Jakobsson , How to Forget a Secret, In STACS 99, Lecture Notes in Computer Science 1563, pp. 500-509, Springer Verlag, 1999.

M. Bellare, G. Di Crescenzo, and P. Rogaway, On the construction of variable-input-length ciphers, Proc. Fast Software Encryption '99. [.ps]

A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung, On Monotone Formula Closure of SZK, Proceedings of the 35th Symposium on Foundations of Computer Science 1994, (FOCS '94), pp. 454-465. [.ps.gz]

W. Aiello, M. Bellare, G. Di Crescenzo, and R. Venkatesan, Security amplification by composition: The case of doubly-iterated, ideal ciphers, Extended abstract in Advances in Cryptology -- Crypto 98 Proceedings, Lecture Notes in Computer Science v. 1462, H. Krawczyk ed, Springer-Verlag, 1998. Full version available.

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]

D. Dienst, D. Fox, and C. Ruland, Transparente Sicherheitsmechanismen für ISDN-Anwendungen; ITG-Fachtagung Nutzung und Technik von Kommunikationsendgeräten. ITG-Fachbericht 131, vde-verlag, Offenbach 1994, S. 81-95.

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.

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

M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, and M. Weiner, Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security, January 1996.

Y. Ding and P. Horster, Undetectable On-line Password Guessing Attacks; Operating Systems Review, Vol. 29, No. 4, (1995), S. 77 - 86. [.ps.Z]

Y. Ding, H. Petersen, and P. Horster, A new approach for delegation using hierarchical delegation tokens; Proc. 2nd Int. Conference on Computer and Communications Security, Essen, Chapman and Hall, (1996), S. 128 - 143. [.ps.Z]

Y. Ding and H. Petersen, Eine Klassifikation von Authentifikationsmodellen; Proc. Trust Center'95, Siegen, Vieweg Verlag, (1995), S. 292 - 302. [.ps.Z]

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

H. Dobbertin, A. Bosselaers, and B. Preneel, RIPEMD-160, a strengthened version of RIPEMD, Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp. 71-82. [.pdf]

B. Preneel, A. Bosselaers, and H. Dobbertin, The cryptographic hash function RIPEMD-160, CryptoBytes, Vol. 3, No. 2, 1997, pp. 9-14. [.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]

E. Biham, A. Biryukov, O. Dunkelman, E. Richardson, and A. Shamir, Initial Observations on Skipjack: Cryptanalysis of Skipjack-3XOR, Proceedings of SAC'98. [.ps.gz]

C. Duraiappan and Y. Zheng, Enhancing security in GSM; 1994 International Computer Symposium, December 1994, Taiwan. [.ps] [.ps.Z]

D. Boneh and G. Durfee , New results on the cryptanalysis of low private exponent RSA, Submitted to Eurocrypt '99.

D. Boneh, G. Durfee, and N. Howgrave-Graham, Factoring N = prq for Large r, Crypto '99.

D. Boneh, G. Durfee, and N. Howgrave-Graham, Factoring N=p^rq for large r, Crypto '99.

D. Boneh and G. Durfee, Cryptanalysis of RSA with private key d less than N^0.292, Proceedings Eurocrypt '99, Lecture Notes in Computer Science, Vol. 1592, Springer-Verlag, pp. 1-11, 1999.

D. Boneh, G. Durfee, and Y. Frankel, An attack on RSA given a small fraction of the private key bits, Proceedings of AsiaCrypt '98, Lecture Notes in Computer Science, Vol. 1514, Springer-Verlag, pp. 25-34, 1998.

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.

R. Cramer, I. Dåard, S. Dziembowski, M. Hirt, and T. Rabin, Efficient multiparty computations secure against an adaptive adversary, Advances in Cryptology -- EUROCRYPT '99, LNCS v. 1592, 1999, pp. 309-323. [.ps.gz]

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