Crypto Bibliography

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

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

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

S. Haber, W. Stornetta, How to Time-Stamp a Digital Document, Journal of Cryptology, Vol. 3, No. 2, pp. 99-111 (1991). [.ps]

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

G. Hachez, F. Koeune, and J.-J. Quisquater, cAESar results: Implementation of Four AES Candidates on Two Smart Cards, Proc. of the Second AES Conference, March 1999. [.pdf]

S. Hada, and T. Tanaka, On the Existence of 3-Round Zero-Knowledge Protocols, CRYPTO'98.

S. Hada, and T. Tanaka, A Relationship between One-Wayness and Correlation Intractability, PKC'99.

T. Sato, M. Haga, and K. Kurosawa, Towards secure and fast hash functions, IEICE, Trans. on Fundamentals. [.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]

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.

S. Halevi and S. Micali, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing, Advances in Cryptography -- CRYPTO '96, Springer-Verlag, pp. 201-215. [.ps.gz]

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

M. Bellare, S. Halevi, A. Sahai, and S. Vadhan, Many-to-one trapdoor functions and their relation to public-key cryptosystems, Extended abstract in Advances in Cryptology -- Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed, Springer-Verlag, 1998.

R. Canetti, O. Goldreich, and S. Halevi, The Random Oracle Methodology, Revisited, March 1998.

S. Halevi and E. Petrank, Storing Classified Files [.ps.gz]

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]

S. Halevi and H. Krawczyk, Public-key cryptography and password protocols, Proceedings of the Fifth ACM Conference on Computer and Communications Security, 1998. [.ps]

J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway, UMAC: Fast and Secure Message Authentication, J. Black, S. Halevi, H. Krawczyk, T. Krovetz, P. Rogaway, Proceedings of Crypto 99, 1999. [.pdf] [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, Using Lattice Problems in Cryptography.

O. Goldreich, S. Goldwasser, and S. Halevi, Public-key Cryptosystems from Lattice Problems, Proceedings of CRYPTO'97.

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

R. Canetti, O. Goldreich, and S. Halevi, The Random Oracle Methodology, Revisited, March 1998.

O. Goldreich, S. Goldwasser, and S. Halevi, Collision-Free Hashing from Lattice Problems; Available as Theory of Cryptography Library: Record 96-09. [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, and Public-Key Cryptosystems from Lattice Reduction Problems, CRYPTO '97.

A. Ben-Dor, S. Halevi, and A. Schuster, Potential Function Analysis of Greedy Hot-Potato Routing, Proceedings of 13th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, 1994, pp. 225-234. [.ps.gz]

S. Halevi, Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver, Advances in Cryptography - CRYPTO '95, Springer-Verlag, 1995. [.ps.gz]

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, and C. Hall, On the Twofish Key Schedule, Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, pp. 27-42.

J. Kelsey, B. Schneier, and C. Hall, An Authenticated Camera, 12th Annual Computer Security Applications Conference, ACM Press, December 1996, pp. 24-30.

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, N. Ferguson, T. Kohno, M. Stay, The Twofish Team's Final Comments on AES Selection, May 15, 2000.

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.

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

C. Ellison, C. Hall, R. Milbert, and B. Schneier, Protecting Secret Keys with Personal Entropy, Future Generation Computer Systems.

D. Whiting, J. Kelsey, B. Schneier, D. Wagner, N. Ferguson, and C. Hall, Further Observations on the Key Schedule of Twofish, Twofish Technical Report #4, March 16, 1999.

C. Hall, J. Kelsey, B. Schneier, and D. Wagner, Cryptanalysis of SPEED (Extended Abstract), Financial Cryptography '98, Springer-Verlag, 1998, 309-310.

C. Hall, J. Kelsey, V. Rijmen, B. Schneier, and D. Wagner, Cryptanalysis of SPEED, Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, pp. 318-338.

C. Hall, J. Kelsey, B. Schneier, and D. Wagner, Building Pseudo-Random Functions from Pseudo-Random Permutations, Advances in Cryptology--CRYPTO '98 Proceedings, Springer-Verlag, August 98, 370-389.

J. Kelsey, B. Schneier, D. Wagner, and C. Hall, Cryptanalytic Attacks on Pseudorandom Number Generators, Fast Software Encryption, Fifth International Workshop Proceedings (March 1998), Springer-Verlag, 1998, pp. 168-188.

C. Hall, I. Goldberg, and B. Schneier, Reaction Attacks Against Several Public-Key Cryptosystems, Counterpane Systems Report, 1998.

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, J. Kelsey, D. Whiting, D. Wagner, C. Hall, and N. Ferguson, Performance Comparison of the AES Submissions, Proc. Second AES Candidate Conference, NIST, March 1999, pp. 15-34.

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

J. Kelsey, B. Schneier, D. Wagner, and C. Hall, Side Channel Cryptanalysis of Product Ciphers, ESORICS '98 Proceedings, Springer-Verlag, September 1998, 97-110.

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, and N. Ferguson, New Results on the Twofish Encryption Algorithm, Second AES Candiate Conference, April 1999.

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

D. Hamer, G-312: An Abwehr Enigma, Cryptologia, Vol.23(1), January 2000, pp. 41-54. [.zip]

D. Hamer, M2114: A Naval Enigma, Cryptologia, Vol.XXII(3), July 1998, p.130. [.zip]

D. Hamer, G. Sullivan, and F. Weierud, Enigma Variations: An Extended Family of Machines, Cryptologia Vol.XXII(3), July 1998, pp 211-229. [.zip]

G. Hanaoka, Y. Zheng, and H. Imai, LITESET: a Light-Weight Secure Electronic Transaction Protocol; Information Security and Privacy --- ACISP'98, Lecture Notes in Computer Science, Vol. xxxx, pp. xxx-xxx, Springer-Verlag, 1998. [.pdf]

H. Handschuh and H. Heys, A Timing Attack on RC5 (merged paper), SAC'98 - Workshop on Selected Areas in Cryptography, Kingston, Canada, LNCS, Springer-Verlag, 1998. [.ps]

H. Handschuh, A Timing Attack on RC5, Preproceedings of SAC'98 - Workshop on Selected Areas in Cryptography, Kingston, Canada, 1998. [.ps.gz]

O. Baudron, H. Gilbert, L. Granboulan, H. Handschuh, A. Joux, P. Nguyen, F. Noilhan, D. Pointcheval, T. Pornin, G. Poupard, J. Stern, and S. Vaudenay, Report on the AES Candidates, Proceedings of the Second AES Candidate Conference, Rome, Italy, 1999. [.pdf]

H. Handschuh and B. Preneel, On the Security of Double and 2-key Triple Modes of Operation, Fast Software Encryption, 6th International Workshop, LNCS 1636, Springer Verlag, 1999, pp. 231-244. [.ps.gz]

H. Handschuh and P. Paillier, Reducing the collision probability of Alleged Comp128, CARDIS'98, Louvain-la-Neuve, Belgique, LNCS, Springer-Verlag, 1998. [.ps.gz]

H. Handschuh, Y. Tsiounis, and M. Yung, Decision oracles are equivalent to Matching oracles, PKC'99 - Workshop on Theory and Practice of Public Key Cryptography, Kamakura, Japan, LNCS, Springer-Verlag, 1999. [.ps.gz]

R. Anderson, V. Matyas, F. Petitcolas, I. Buchan, and R. Hanka, On the Importance of Trusted Distribution and Authentic Channels for the Distribution of Medical Knowledge,

Y. Zheng, T. Hardjono, and J. Seberry, Reusing shares in secret sharing schemes; The Computer Journal, Vol. 37, No. 3, pp. 199-205, 1994. [.ps] [.ps.Z]

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

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

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

C. Harpes, Partitioning Cryptanalysis, Post-Diploma Thesis, Signal and Information Processing Lab., Swiss Federal Institute of Technology, Zurich, March 1995. [.ps]

C. Harpes, G. Kramer, and J. Massey, A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-up Lemma, Eurocrypt '95. [.ps]

T. Jakobsen and C. Harpes, Non-Uniformity Measures for Generalized Linear Cryptanalysis and Partitioning Cryptanalysis, Proceedings of Pragocrypt '96, 1996. [.ps] [.ps.gz]

C. Harpes, A Generalization of Linear Cryptanalysis Applied to SAFER, Internal report, Signal and Information Processing Lab., Swiss Federal Institute of Technology, Zurich, March 9, 1995. [.ps]

R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan, and P. Rohatgi, The Random Oracle Hypothesis is False; July 1992. [.ps]

G. Ateniese, D. Hasse, O. Chevassut, Y. Kim, and G. Tsudik, The Design of a Group Key Agreement API, IBM Research Report. Also in DARPA Information Survivability Conference And Exposition (DISCEX) 2000.

Y. Amir, G. Ateniese, D. Hasse, Y. Kim, C. Nita-Rotaru, T. Schlossnagle, J. Schultz, J. Stanton, and G. Tsudik, Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments, 2000 International Conference on Distributed Computing Systems. [.pdf]

N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple Constructions of Almost $k$-wise Independent Random Variables; June 1992. [.ps] Addendum: [.ps]

J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, A Pseudorandom generator from any one-way function, SIAM J. on Computing. [.ps]

R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan, and P. Rohatgi, The Random Oracle Hypothesis is False; July 1992. [.ps]

J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a pseudo-random generator from any one-way function, SIAM Journal on Computing. [.ps]

B. Chor, J. Freidmann, O. Goldreich, J. Hastad, S. Rudich, and R. Smolensky, The Bit Extraction Problem or t-Resilient Functions; 1985. [.ps]

M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, and M. Waidner, iKP - A Family of Secure Electronic Payment Protocols, Proc. First USENIX Workshop on Electronic Commerce, New York City, July 1995.

M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, E. Van Herreweghen, and M. Waidner, Design, Implementation and Deployment of the iKP Secure Electronic Payment System, IEEE Journal of Selected Areas in Communications. [.ps]

M. Abadi, E. Allender, A. Broder, J. Feigenbaum, and L. Hemachandra, On Generating Solved Instances of Computational Problems, Advances in Cryptology -- CRYPTO '88, Springer-Verlag (August 1988), 297-310. [.ps]

D. Fox, T. Henn, K. Reichel, and C. Ruland, Guarded Authentic Local Area Network - GALAN; In: Brüggemann, H.-H.; Gerhardt, W. (Hrsg.): Proceedings der Fachtagung Verläßliche IT-Systeme VIS '95. DuD-Fachbeiträge 22, Vieweg-Verlag, Braunschweig, April 1995, S. 163-180.

H. Petersen, A. Herrigel, J. O'Ruanaidh, S. Pereira, and T. Pun, Secure Copyright Protection Techniques for Digital Images; Proc. Workshop on Information Hiding, April, (1998), 12 Seiten, erscheint in LNCS, Springer. [.ps.zip]

O. Goldreich, A. Herzberg, and A. Segall, A Quantitative Approach to Dynamic Networks; 1992. [.ps]

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.

A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, Proactive Secret Sharing, Or: How To Cope With Perpetual Leakage, Proceedings of CRYPTO'95, Springer Verlag, LNCS 963, pp. 339-352. [.ps]

A. Herzberg, H. Krawczyk, M. Yung, and S. Jarecki, Proactive Secret Sharing and Public Key Cryptosystems; MIT M.Eng. Thesis: Feb'96 [.ps.gz]

A. De Santis, C. Blundo, A. Herzberg, S. Kutten, M. Yung, and U. Vaccaro, Perfectly-Secure Conference Key Distribution. An extended abstract of this paper appeared in: Advances in Cryptology -- CRYPTO '92, E. Brickell (Ed.), v. 740, Lectures Notes in Computer Science, 1993, Springer-Verlag, pp. 471-486. [.ps.gz]

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

M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, E. Van Herreweghen, and M. Waidner, Design, Implementation and Deployment of the iKP Secure Electronic Payment System, IEEE Journal of Selected Areas in Communications. [.ps]

P. Cheng, J. Garay, A. Herzberg, and H. Krawczyk, Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX, Proc. 5th USENIX UNIX Security Symposium, Salt Lake City, Utah, June 1995. [.ps]

P. Chen, J. Garay, A. Herzberg, and H. Krawczyk, A Security Architecture for the Internet Protocol, IBM Systems Journal 37, No. 1 (1998).

M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, and M. Waidner, iKP - A Family of Secure Electronic Payment Protocols, Proc. First USENIX Workshop on Electronic Commerce, New York City, July 1995.

H. Heys and S. Tavares, Cryptanalysis of Substitution-Permutation Networks Using Key-Dependent Degeneracy, Cryptologia, v. XX, n. 3, 1996, pp. 258-274. [.ps]

H. Heys and S. Tavares, On the Design of Secure Block Ciphers, Proceedings of Queen's 17th Biennial Symposium on Communications, Kingston, Ontario, May 1994. [.ps]

H. Heys and S. Tavares, Key Clustering in Substitution-Permutation Network Cryptosystems, Proceedings of SAC '94 - Workshop on Selected Area in Cryptography, Kingston, Ontario, May 1994. [.ps]

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]

J. Lee, H. Heys, and S. Tavares, Resistance of a CAST-like Encryption Algorithm to Linear and Differential Cryptanalysis, Designs, Codes, and Cryptography, Sep. 1996. [.ps]

H. Heys and S. Tavares, On the Security of the CAST Encryption Algorithm, Proceedings of Canadian Conference on Electrical and Computer Engineering, Halifax, Nova Scotia, Sep. 1994 (also presented at rump session of CRYPTO '94, Santa Barbara, Calif., Aug. 1994). [.ps]

H. Handschuh and H. Heys, A Timing Attack on RC5 (merged paper), SAC'98 - Workshop on Selected Areas in Cryptography, Kingston, Canada, LNCS, Springer-Verlag, 1998. [.ps]

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

H. Heys and S. E. Tavares, Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis, Journal of Cryptology, v. 9, n. 1, 1996, pp. 1-19. (Also presented at 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, Nov. 1994). [.ps]

M. Riaz and H. Heys, The FPGA Implementation of the RC6 and CAST-256 Encryption Algorithms, in Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, Edmonton, Alberta, May 1999. [.ps]

C. Adams, H. Heys, S. Tavares, and M. Wiener, An Analysis of the CAST-256 Cipher, Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, 1999. [.ps]

H. Handschuh and H. Heys, A Timing Attack on RC5, Workshop on Selected Areas in Cryptography, Springer-Verlag, 1998. [.ps]

H. Heys and S. Tavares, Known Plaintext Cryptanalysis of Tree-Structured Block Ciphers, IEE Electronics Letters, v. 31, n. 10, 1995, pp. 784-785. (Also presented at TRIO Researcher's Retreat, Kingston, Ontario, May 1994). [.ps]

H. Heys and S. Tavares, Avalanche Characteristics of Substitution-Permutation Encryption Networks, IEEE Trans. on Computers, v. 44, n. 9, pp. 1131-1139, 1995. [.ps]

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]

H.M. Heys, Avalanche Characteristics of DES-like Ciphers, Proceedings of SAC '96 - Workshop on Selected Areas in Cryptography, Queen's University, Kingston, Ontario, Aug. 1996. [.ps]

M. Jakobsson, E. Shriver, B. Hillyer, and A. Juels, A Practical Secure Physical Random Bit Generator, ACM Security 1998. [.pdf] [.ps]

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]

M. Fitzi, M. Hirt, and U. Maurer, Trading Correctness for Privacy in Unconditional Multi-Party Computation, Advances in Cryptology -- Crypto '98, 1998. [abstract - .txt] [.pdf] [.ps]

M. Fitzi, M. Hirt, and U. Maurer, General adversaries in unconditional multi-party computation, Advances in Cryptology - Asiacrypt '99, Lecture Notes in Computer Science, 1999. [.ps.gz]

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]

K. Martin, B. Preneel, C. Mitchell, H. Hitz, G. Horn, A. Poliakova, and P. Howard, Secure billing for mobile information services in UMTS, 5th International Conference in Services and Networks, IS&N'98, LNCS 1430, Springer-Verlag, 1998, pp. 535-548. [.ps.gz]

M. Franklin, H. Buhrman, J. Garay, J. Hoepman, J. Tromp, and P. Vitanyi, Mutual search, Proc. 9th ACM Symposium on Discrete Algorithms (SODA 1998). [.ps]

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

K. Martin, B. Preneel, C. Mitchell, H. Hitz, G. Horn, A. Poliakova, and P. Howard, Secure billing for mobile information services in UMTS, 5th International Conference in Services and Networks, IS&N'98, LNCS 1430, Springer-Verlag, 1998, pp. 535-548. [.ps.gz]

G. Horn, B. Preneel, Authentication and payment in future mobile systems, Proceedings ESORICS '98, LNCS 1485, J.-J. Quisquater, Y. Deswarte, C. Meadows, D. Gollmann, Eds., Springer-Verlag, 1998, pp. 277-293. [.ps]

H. Petersen, P. Horster, and M. Michels, Breaking and repairing a convertible undeniable signature scheme; Proc. 3rd ACM Comference on Computer and Communications Security, New Delhi, ACM Press, (1996), S. 148 - 152. [.zip]

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, Meta signature schemes giving message recovery based on the discrete logarithm problem; Proc. 2nd Int. Workshop on IT-Security, Wien, Oldenbourg Verlag, (1994), S. 82 - 92. [.ps.gz]

H. Petersen, P. Horster, and M. Michels, Taxonomie digitaler Signaturkonzepte; Proc. Digitale Signaturen, Darmstadt, Vieweg Verlag, (1996), S. 63 - 79. [.zip]

D. Fox, P. Horster, and P. Kraaibeek, Grundüberlegungen zu Trust Centern; In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 1-10.

H. Petersen, P. Horster, and M. Michels, Blind multisignature schemes and their relevance to electronic voting; Proc. 11th Annual Computer Security Applications Conference, New Orleans, IEEE Press, (1995), S. 149 - 155. [.zip]

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]

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]

H. Petersen, P. Horster, and M. Michels, Meta Message recovery and Meta Blind signature schemes based on the discrete logarithm problem and their applications; Proc. Asiacrypt'94, Lecture Notes in Computer Science 917, Springer Verlag, (1994), S. 224 - 237. [.ps.gz]

H. Petersen, P. Horster, and M. Michels, Meta-ElGamal signature schemes; Proc. 2nd ACM Computer and Communications Security Conference, Fairfax, ACM Press, (1994), S. 96 - 107. [.ps.gz]

D. Boneh and J. Horwitz, Generating a Product of Three Primes With an Unknown Factorization, Proceedings of the third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, Springer-Verlag, 1998, pp. 237-251.

K. Martin, B. Preneel, C. Mitchell, H. Hitz, G. Horn, A. Poliakova, and P. Howard, Secure billing for mobile information services in UMTS, 5th International Conference in Services and Networks, IS&N'98, LNCS 1430, Springer-Verlag, 1998, pp. 535-548. [.ps.gz]

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.

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

E. Biham, B. Huttner, and T. Mor, Quantum Cryptographic Network based on Quantum Memories, Physical Review A, Vol. 54, No. 4, pp. 2651-2658, October 1996 [.ps.gz]

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