Disclaimer: This information comes from sources that cannot be verified. As such, make no
assumptions about its completeness or accuracy. We endeavor to keep this information up to date
as much as possible. Feel free to send comments/ updates to the Security News Editor.
Authors who wish to be listed here should send their publication list
in a HTML format that can be easily inserted into this list. Please do
not state anything which isn't available online !
By Author:
You are visitor since 15/4/98
Martín Abadi et al.
- Martín Abadi, Phillip Rogaway: Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) ;
To appear in Proceedings of the First IFIP International Conference on
Theoretical Computer Science, Springer-Verlag (August 2000).
- Martín Abadi: Taming the Adversary ; To appear in Advances in Cryptology -- CRYPTO 2000, Springer-Verlag (August 2000).
- Martín Abadi, Pankaj Kakkar, Carl A. Gunter: Reasoning about Secrecy for Active Networks ; To appear in Proceedings of the 13th IEEE Computer Security Foundations Workshop (July 2000).
- Martín Abadi: Security Protocols and their Properties ;
Foundations of Secure Computation (F.L. Bauer and R. Steinbrueggen,
eds.), NATO Science Series, IOS Press (2000), 39-60. Volume for the
20th International Summer School on Foundations of Secure Computation,
held in Marktoberdorf, Germany (1999).
- Martín Abadi, C�dric Fournet, Georges Gonthier: Authentication Primitives and their Compilation ; Proceedings of the 27th ACM Symposium on Principles of Programming Languages (January 2000), 302-315.
- Martín Abadi, C�dric Fournet, Georges Gonthier: A Top-Down Look at a Secure Message ;
Proceedings of the 19th International Conference on Foundations of
Software Technology and Theoretical Computer Science, Springer-Verlag
(December 1999), 122-141.
- Martín Abadi, C�dric Fournet, Georges Gonthier: Secure Communications Processing for Distributed Languages ; Proceedings of the 1999 IEEE Symposium on Security and Privacy (May 1999), 74-88.
- Martín Abadi: Security Protocols and Specifications ;
Foundations of Software Science and Computation Structures: Second
International Conference, FOSSACS '99 Springer-Verlag (March 1999),
1-13.
- Martín Abadi: Protection in Programming-Language Translations ;
Automata, Languages and Programming: 25th International Colloquium,
ICALP'98, Springer-Verlag (July 1998), 868-883. Also appeared as SRC
Research Report 154 (April 1998).
- Martín Abadi, C�dric Fournet, Georges Gonthier: Secure Implementation of Channel Abstractions ; Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (June 1998), 105-116.
- Martín Abadi: Two Facets of Authentication ;
Proceedings of the 11th IEEE Computer Security Foundations Workshop
(June 1998), 25-32. Also appeared as SRC Technical Note 1998-007 (March
1998).
- Martín Abadi, Andrew Birrell, Raymie Stata, Edward Wobber: Secure Web Tunneling ;
Proceedings of the Seventh International World Wide Web Conference.
Computer Networks and ISDN Systems 30, 1-7 (April 1998), 531-539.
- Martín Abadi: Secrecy by Typing in Security Protocols ; Journal of the ACM 46, 5 (September 1999), 749-786.
- Martín Abadi, Andrew D. Gordon: A Bisimulation Method for Cryptographic Protocols ; Nordic Journal of Computing 5, 4 (Winter 1998), 267-303.
- Martín Abadi, Andrew D. Gordon: A Calculus for Cryptographic Protocols: The Spi Calculus;
To appear in Information and Computation. SRC Research Report 149
(January 1998), in preliminary form as Technical Report 414, University
of Cambridge Computer Laboratory (January 1997).
- Martín Abadi: Explicit Communication Revisited: Two New Attacks on Authentication Protocols; IEEE Transactions on Software Engineering 23, 3 (March 1997), 185-186.
- Martín Abadi, Roger Needham: Prudent Engineering Practice for Cryptographic Protocols; IEEE Transactions on Software Engineering 22, 1 (January 1996), 6-15.
- Martín Abadi, Edward Wobber, Michael Burrows, Butler Lampson: Authentication in the Taos Operating System; ACM Transactions on Computer Systems 12, 1 (February 1994), 3-32. Also appeared as SRC Research Report 117.
- Martín Abadi, Michael Burrows, Charles Kaufman, Butler Lampson: Authentication and Delegation with Smart-Cards; Science of Computer Programming 21, 2 (October 1993), 93-113.
- Martín Abadi, Michael Burrows, Butler Lampson, Gordon Plotkin: A Calculus for Access Control in Distributed Systems;
ACM Transactions on Programming Languages and Systems 15, 4 (September
1993), 706-734. Also appeared as SRC Research Report 70.
- Martín Abadi, Butler Lampson, Michael Burrows, Edward Wobber: Authentication in Distributed Systems: Theory and Practice; ACM Transactions on Computer Systems 10, 4 (November 1992), 265-310. Also appeared as SRC Research Report 83.
- Martín Abadi, Joan Feigenbaum: Secure Circuit Evaluation: A Protocol Based on Hiding Information from an Oracle; Journal of Cryptology 2, 1 (May 1990), 1-12.
- Martín Abadi, Michael Burrows, Roger Needham: A Logic of Authentication;
Proceedings of the Royal Society, Series A, 426, 1871 (December 1989),
233-271. Also appeared as SRC Research Report 39 and, in a shortened
form, in ACM Transactions on Computer Systems 8, 1 (February 1990),
18-36.
- Martín Abadi, Joan Feigenbaum, Joe Kilian: On Hiding Information from an Oracle; Journal of Computer and System Sciences 39, 1 (August 1989), 21-50.
- Martín Abadi, Cédric Fournet, Georges Gonthier: Secure Implementation of Channel Abstractions; To appear in the Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (June 1998).
- Martín Abadi: Two Facets of Authentication;
To appear in the Proceedings of the 11th IEEE Computer Security
Foundations Workshop (June 1998). Also appeared as SRC Technical Note
1998-007 (March 1998).
- Martín Abadi, Andrew Birrell, Raymie Stata, Edward Wobber: Secure Web Tunneling; To appear in the Proceedings of the Seventh International World Wide Web Conference (April 1998).
- Martín Abadi, Andrew D. Gordon: A Bisimulation Method for Cryptographic Protocols; Programming Languages and Systems: 7th European Symposium on Programming, ESOP '98 (April 1998), 12-26.
- Martín Abadi: Secrecy by Typing in Security Protocols; Theoretical Aspects of Computer Software, Springer-Verlag (September 1997), 611-638.
- Martín Abadi, Leendert van Doorn, Mike Burrows, Edward Wobber: Secure Network Objects; Proceedings of the 1996 IEEE Symposium on Security and Privacy (May 1996), 211-221.
- Martín Abadi, Eric Allender, Andrei Broder, Joan Feigenbaum, Lane Hemachandra: On Generating Solved Instances of Computational Problems; Advances in Cryptology -- CRYPTO '88, Springer-Verlag (August 1988), 297-310.
- Martín Abadi, T. Mark, A. Lomas, Roger Needham: Strengthening Passwords; SRC Technical Note 1997-033 (September/December 1997).
Ross Anderson et al.
Donald Beaver et al.
- D. Beaver: Quorum-Based Secure Multi-Party Computation (extended abstract); To appear, Eurocrypt '98.
- D. Beaver: Plug and Play Cryptography (extended abstract); Advances in Cryptology - Crypto '97 Proceedings, Springer-Verlag LNCS 1294, 1997, 75-89.
- D. Beaver: Commodity-Based Cryptography (extended abstract); Proceedings of the 29th STOC, ACM, 1997, 446-455.
- D. Beaver: Adaptive Zero Knowledge and Computational Equivocation (extended abstract); Proceedings of the 28th STOC, ACM, 1996, 629-638.
- D. Beaver: Equivocable Oblivious Transfer (extended abstract); Advances in Cryptology - Eurocrypt '96 Proceedings, Springer-Verlag LNCS 1070, 1996, 119-130.
- D. Beaver: Correlated Pseudorandomness and the Complexity of Private Computations (extended abstract); Proceedings of the 28th STOC, ACM, 1996, 479-488.
- D. Beaver: Plausible Deniability (extended abstract); Pragocrypt '96 Proceedings, 1996.
- D. Beaver: Precomputing Oblivious Transfer (extended abstract); Advances in Cryptology - Crypto '95 Proceedings, Springer-Verlag LNCS 963, 1995, 97-109.
- D. Beaver: A Universal Molecular Computer;
Penn State University Tech Report CSE-95-001. From work done while at
the University of Wollongong, NSW, Australia, November, 1994.
- D. Beaver: Factoring: The DNA Solution; Advances in Cryptology - Asiacrypt '94, Springer-Verlag, to appear in 1995.
- D. Beaver, N. So: Global, Unpredictable Bit Generation Without Broadcast (extended abstract); Advances in Cryptology - Eurocrypt '93, Springer-Verlag, 1994, 424-434.
- D. Beaver: How to Break a `Secure' Oblivious Transfer Protocol (extended abstract); Advances in Cryptology - Eurocrypt '92, Springer-Verlag, 1993, 285-296.
- D. Beaver, J. Feigenbaum, R. Ostrovsky, V. Shoup: Instance-Hiding Proof Systems (extended abstract);
Hiding Instances in Zero-Knowledge Proof Systems. D. Beaver, J.
Feigenbaum, V. Shoup. Advances in Cryptology - Crypto '90 Proceedings,
Springer-Verlag, 1991, 326-338.
- D. Beaver, S. Haber: Cryptographic Protocols Provably Secure Against Dynamic Adversaries (extended abstract); Advances in Cryptology - Eurocrypt '92, Springer-Verlag, 1993, 307-323.
- D. Beaver: Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority; J. Cryptology 4:2 (1991), 75-122.
- D. Beaver: Efficient Multiparty Protocols Using Circuit Randomization (extended abstract); Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag, 1992, 420-432.
- D. Beaver: Foundations of Secure Interactive Computing (extended abstract); Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag, 1992, 377-391.
- D. Beaver, J. Feigenbaum, J. Kilian, P. Rogaway: Security with Low Communication Overhead (extended abstract); Advances in Cryptology - Crypto '90 Proceedings, Springer-Verlag, 1991, 62-76.
- D. Beaver, J. Feigenbaum: Hiding Instances in Multioracle Queries (extended abstract); Proceedings of the the 7th STACS, Springer-Verlag LNCS 415, 1990, 37-48.
- D. Beaver, S. Micali, P. Rogaway: The Round Complexity of Secure Protocols (extended abstract); Proceedings of the 22nd STOC, ACM, 1990, 503-513.
- D. Beaver, S. Goldwasser: Multiparty Computation with Faulty Majority (extended abstract); Proceedings of the 30th FOCS, IEEE, 1989, 468-473.
- D. Beaver: Perfect Privacy for Two-Party Protocols (extended abstract);
Proceedings of the DIMACS Workshop on Distributed Computing and
Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt
(eds.).
- D. Beaver: Formal Definitions for Secure Distributed Protocols (extended abstract);
Proceedings of the DIMACS Workshop on Distributed Computing and
Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt
(eds.).
- J. Bar-Ilan, D. Beaver: Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction (extended abstract); Proceedings of PODC, ACM, 1989, 201-209.
Mihir Bellare et al.
- M. Bellare, S. Goldwasser, S. Micali: Identification Protocols Secure Against Reset Attacks;
- M. Bellare, D. Pointcheval, P. Rogaway: Authenticated Key Exchange Secure Against Dictionary Attacks ;
Extended abstract in Advances in Cryptology - Eurocrypt 2000
Proceedings, Lecture Notes in Computer Science Vol. ??, B. Preneel ed,
Springer-Verlag, 2000.
- M. Bellare, A. Boldyreva, S. Micali: Public-key Encryption in a Multi-User Setting: Security Proofs and Improvements ;
Extended abstract in Advances in Cryptology - Eurocrypt 2000
Proceedings, Lecture Notes in Computer Science Vol. ??, B. Preneel ed,
Springer-Verlag, 2000.
- M. Bellare, A. Sahai: Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization;
Extended abstract in Advances in Cryptology - Crypto 99 Proceedings,
Lecture Notes in Computer Science Vol. 1666, M. Wiener ed,
Springer-Verlag, 1999.
- M. Bellare, S. Miner: A forward-secure digital signature scheme ;
Extended abstract in Advances in Cryptology - Crypto 99 Proceedings,
Lecture Notes in Computer Science Vol. 1666, M. Wiener ed,
Springer-Verlag, 1999.
- M. Bellare, O. Goldreich, H. Krawczyk: Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier;
Extended abstract in Advances in Cryptology - Crypto 99 Proceedings,
Lecture Notes in Computer Science Vol. 1666, M. Wiener ed,
Springer-Verlag, 1999.
- J. An, M. Bellare: Constructing VIL-MACs from FIL-MACs: Message authentication under weakened assumptions ;
Extended abstract in Advances in Cryptology - Crypto 99 Proceedings,
Lecture Notes in Computer Science Vol. 1666, M. Wiener ed,
Springer-Verlag, 1999.
- M. Bellare, P. Rogaway: On the Construction of Variable-Input-Length Ciphers ;
In Proceedings of 6th Workshop on Fast Software Encryption , Lecture
Notes in Computer Science Vol. 1636, Ed. L. Knudsen, Springer-Verlag,
1999.
- M. Abdalla, M. Bellare, P. Rogaway: DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem;
- M. Bellare, J. Garay, C. Jutla, M. Yung: VarietyCash : A Multi-purpose Electronic Payment System; Appears in Proceedings of the 3rd Usenix Workshop on Electronic Commerce, Usenix, 1998.
- M. Bellare, S. Halevi, A. Sahai, S. Vadhan: Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems ;
Extended abstract was in Advances in Cryptology- Crypto 98 Proceedings,
Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed,
Springer-Verlag, 1998.
- M. Bellare, A. Desai, D. Pointcheval, P. Rogaway: Relations among notions of security for public-key encryption schemes;
Extended abstract in Advances in Cryptology - Crypto 98 Proceedings,
Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed,
Springer-Verlag, 1998.
- W. Aiello, M. Bellare, G. Di Crescenzo, R. Venkatesan: Security amplification by composition: The case of doubly-iterated, ideal ciphers ;
Extended abstract was in Advances in Cryptology- Crypto 98 Proceedings,
Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed,
Springer-Verlag, 1998.
- M. Bellare, Ran Canetti, Hugo Krawczyk: A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols; Extended abstract in Proceedings of 30th Annual Symposium on the Theory of Computing, ACM, 1998.
- M. Bellare, J. Garay, T. Rabin: Fast batch verification for modular exponentiation and digital signatures;
Extended abstract in Advances in Cryptology- Eurocrypt 98 Proceedings,
Lecture Notes in Computer Science Vol. ??, K. Nyberg ed,
Springer-Verlag, 1998.
- M. Bellare, A. Desai, E. Jokipii, 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, R. Impagliazzo, 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, 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, S. Goldwasser, 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: A Note on Negligible Functions; Technical Report CS97-529, Department of Computer Science and Engineering, UCSD, March 1997.
- M. Bellare, 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, M. Jakobsson, 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, S. Goldwasser: Encapsulated key escrow; Early version was MIT Laboratory for Computer Science Technical Report 688, April 1996.
- M. Bellare, S. Goldwasser: Verifiable partial key escrow;
Proc. 4th ACM Conference on Computer and Communications Security, April
1997. Report CS95-447, Department of Computer Science and Engineering,
UCSD, October 1995.
- M. Bellare, R. Canetti, H. Krawczyk: Pseudorandom functions revisited: The cascade construction and its concrete security; Extended abstract in Proc. 37th Annual Symposium on the Foundations of Computer Science, IEEE, 1996.
- M. Bellare, R. Canetti, H. Krawczyk: Keying hash functions for message authentication;
Extended abstract in Advances in Cryptology - Crypto 96 Proceedings,
Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed,
Springer-Verlag, 1996.
- M. Bellare, P. Rogaway: The exact security of digital signatures: How to sign with RSA and Rabin;
Extended abstract in Advances in Cryptology - Eurocrypt 96 Proceedings,
Lecture Notes in Computer Science Vol. 1070, U. Maurer ed,
Springer-Verlag, 1996.
- M. Bellare, R. Rivest: Translucent cryptography -- An alternative to key escrow, and its implementation via fractional oblivious transfer; Early version was MIT Laboratory for Computer Science Technical Memo No. 683, February 1996.
- M. Bellare, R. Guerin, P. Rogaway: XOR MACs: New methods for message authentication using finite pseudorandom functions;
Extended abstract in Advances in Cryptology - Crypto 95 Proceedings,
Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed,
Springer-Verlag, 1995.
- M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, M. Waidner: iKP - A Family of Secure Electronic Payment Protocols; Proc. First USENIX Workshop on Electronic Commerce, USENIX, 1995.
- M. Bellare, P. Rogaway: Provably secure session key distribution: the three party case; Proc. 27th Annual Symposium on the Theory of Computing, ACM, 1995.
- M. Bellare, O. Goldreich, S. Goldwasser: Incremental cryptography with application to virus protection; Proc. 27th Annual Symposium on the Theory of Computing, ACM, 1995.
- M. Bellare, J. Kilian, P. Rogaway: The security of cipher block chaining;
Extended abstract in Advances in Cryptology - Crypto 94 Proceedings,
Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed,
Springer-Verlag, 1994.
- M. Bellare, O. Goldreich, S. Goldwasser: Incremental cryptography: the case of hashing and signing;
Advances in Cryptology - Crypto 94 Proceedings, Lecture Notes in
Computer Science Vol. 839, Y. Desmedt ed, Springer-Verlag, 1994.
- E. Basturk, M. Bellare, C. S. Chow, R. Guerin: Secure transport protocols for high-speed networks; IBM Research Report 19981, March, 1994.
- M. Bellare, P. Rogaway: Optimal asymmetric encryption -- How to encrypt with RSA;
Extended abstract was in Advances in Cryptology - Eurocrypt 94
Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis
ed, Springer-Verlag, 1995.
- M. Bellare, P. Rogaway: Random oracles are practical: A paradigm for designing efficient protocols; Extended abstract in Proc. First Annual Conference on Computer and Communications Security, ACM, 1993.
- M. Bellare, P. Rogaway: Entity Authentication and key distribution;
Extended abstract in Advances in Cryptology - Crypto 93 Proceedings,
Lecture Notes in Computer Science Vol. 773, D. Stinson ed,
Springer-Verlag, 1994.
- M. Bellare, O. Goldreich: On defining proofs of knowledge;
Extended abstract in Advances in Cryptology - Crypto 92 Proceedings,
Lecture Notes in Computer Science Vol. 740, E. Brickell ed,
Springer-Verlag, 1993.
- M. Bellare, O. Goldreich: Proving computational ability; Manuscript, August 1992.
- M. Bellare, M. Yung: Certifying permutations: Non-interactive zero-knowledge based on any trapdoor permutation; Journal of Cryptology Vol. 9, No. 1, pp. 149--166, 1996.
- M. Bellare, S. Micali: How to sign given any trapdoor permutation; Journal of the ACM, Vol. 39, No. 1, January 1992, pp. 214--233.
Steven M. Bellovin et al.
- D. Whiting, B. Schneier, S. Bellovin: AES Key Agility Issues in High-Speed IPsec Implementations ;
- J.S. Denker, S.M. Bellovin, H. Daniel, N.L. Mintz, T. Killian, M.A. Plotnick: Moat: A Virtual Private Network Appliance and Services Platform ; Proceedings of LISA XIII, November 1999, pp.251-260.
- Steven M. Bellovin: Cryptography and the Internet; in Proceedings of CRYPTO '98, August 1998.
- Hal Abelson, Ross Anderson, Steven M. Bellovin, et al.: The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption; May 1997.
- Steven M. Bellovin: Probable Plaintext Cryptanalysis of the IP Security Protocols; in Proceedings of the Symposium on Network and Distributed System Security, San Diego, CA, pp. 155-160, February 1997.
- Uri Blumenthal, Steven M. Bellovin: A Better Key Schedule for DES-like Ciphers; in Proceedings of PRAGOCRYPT '96, Prague, September 1996.
- Steven M. Bellovin: Problem Areas for the IP Security Protocols; in Proceedings of the Sixth Usenix Unix Security Symposium, pp. 1-16, San Jose, CA, July 1996.
- Steven M. Bellovin: Defending Against Sequence Number Attacks; RFC 1948, May 1996.
- David A. Wagner, Steven M. Bellovin: A "Bump in the Stack" Encryptor for MS-DOS Systems; in Proceedings of the Symposium on Network and Distributed System Security, San Diego, CA, pp. 155-160, February 1996.
- Matt Blaze, Steven M. Bellovin: Session-Layer Encryption; in Proceedings of the Fifth Usenix UNIX Security Symposium, Salt Lake City, UT, June, 1995.
- Steven M. Bellovin: Using the Domain Name System for System Break-Ins; in Proceedings of the Fifth Usenix UNIX Security Symposium, Salt Lake City, UT, June, 1995.
- David A. Wagner, Steven M. Bellovin: A Programmable Plaintext Recognizer; 1994.
- Steven M. Bellovin: On Many Addresses per Host; RFC 1681, August 1994.
- Steven M. Bellovin: Security Concerns for IPng; RFC 1675, August 1994.
- Steven M. Bellovin; Firewall-Friendly FTP; RFC 1579, February 1994.
- Steven M. Bellovin, Michael Merritt: An Attack on the Interlock Protocol When Used for Authentication; " in IEEE Transactions on Information Theory 40:1, pp. 273-275, January 1994.
- Steven M. Bellovin, Michael Merritt: Augmented Encrypted Key Exchange; in Proceedings of the First ACM Conference on Computer and Communications Security, pp. 244-250, November 1993.
- Steven M. Bellovin: Packets Found on an Internet; in Computer Communications Review 23:3, pp. 26-31, July 1993.
- Steven M. Bellovin: There Be Dragons; in Proceedings of the Third Usenix UNIX Security Symposium, pp. 1-16, 1992.
Steven M. Bellovin, Michael Merritt: Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks; in Proc. IEEE Computer Society Symposium on Research in Security and Privacy, pp. 72--84, May 1992.
- Steven M. Bellovin: A Best-Case Network Performance Model; February 1992.
- Steven M. Bellovin, Michael Merritt: Limitations of the Kerberos Authentication System; in USENIX Conference Proceedings, pp. 253--267, Winter 1991.
- Steven M. Bellovin: Security Problems in the TCP/IP Protocol Suite; in Computer Communications Review 2:19, pp. 32-48, April 1989.
Eli Biham et al.
- Eli Biham: Comment on Selecting the Ciphers for the AES Second Round ; Submitted as a comment to the AES first round, April 15, 1999.
- Ross Anderson, Eli Biham, Lars Knudsen: Serpent and Smartcards ; Submitted as a comment to the AES first round, April 15, 1999.Proceedings of Cardis'98.
- Eli Biham, Adi Shamir: Power Analysis of the Key Scheduling of the AES Candidates ; Second AES conference, 1999.
- Eli Biham: A Note on Comparing the AES Candidates ; Second AES conference, 1999. Revised Version ; Slides
- Eli Biham, Alex Biryukov, Niels Ferguson, Lars R. Knudsen, Bruce Schneier, Adi Shamir: Cryptanalysis of Magenta ; Distributed at the first AES conference, August 20, 1998; Second AES conference, 1999. Slides
- Eli Biham, Alex Biryukov, Adi Shamir: Cryptanalysis of Skipjack Reduced to 31 Rounds using Impossible Differentials ; CS0947
- Eli Biham, Alex Biryukov, Orr Dunkelman, Eran Richardson, Adi Shamir: Initial Observations on Skipjack: Cryptanalysis of Skipjack-3XOR ; CS0946, Proceedings of SAC'98.
- Roy Friedman, Eli Biham, Ayal Itzkovitz, Assaf Schuster: Symphony: Managing Virtual Servers in the Global Village ; CS 0939
- Eli Biham, Lars R. Knudsen: Cryptanalysis of the ANSI X9.52 CBCM Mode; Proceedings of Eurocrypt'98
- Eli Biham, Adi Shamir: Differential Fault Analysis of Secret Key Cryptosystems; Proceedings of Crypto'97
- Eli Biham: A Fast New DES Implementation in Software; Fast Software Encryption 4, 1997
- Eli Biham: Cryptanalysis of Ladder-DES; Fast Software Encryption 4, 1997
- Eli Biham, Tal Mor: On the Security of Quantum Cryptography Against Collective Attacks; Physical Review Letters, Vol. 78, No. 11, pp. 2256-2259, March 1997
- Eli Biham, Bruno Huttner, Tal Mor: Quantum Cryptographic Network based on Quantum Memories, (Figure 1); Physical Review A, Vol. 54, No. 4, pp. 2651-2658, October 1996
- Eli Biham: Cryptanalysis of Triple-Modes of Operation; August 1996
- Eli Biham: How to Forge DES-Encrypted Messages in $2^{28}$ Steps; August 1996
- Ross Anderson, Eli Biham: Tiger: A Fast New Hash Function; Fast Software Encryption 3, 1996, LNCS 1039
For more information on Tiger look here
- Ross Anderson, Eli Biham: Two Practical and Provably Secure Block Ciphers: BEAR and LION; December 1995; Fast Software Encryption 3, 1996, LNCS 1039
- Eli Biham, Paul C. Kocher: A Known Plaintext Attack on the PKZIP Stream Cipher; December 1994; Fast Software Encryption 2, Proceedings of the Leuven Workshop, LNCS 1008
- Eli Biham: Cryptanalysis of Multiple Modes of Operation; October 1994; Proceedings of Asiacrypt'94, LNCS 917; Journal of Cryptology, Vol. 11, No. 1, pp. 45-58, 1998
- Eli Biham, Alex Biryukov: An Improvement of Davies' Attack on DES; May 1994; Proceedings of Eurocrypt'94, LNCS 950; Journal of Cryptology, Vol. 10, No. 3, pp. 195-206, 1997
- Eli Biham, Alex Biryukov: How to Strengthen DES Using Existing Hardware; May 1994; Proceedings of Asiacrypt'94, LNCS 917; A revised version!!!
- Eli Biham: On Matsui's Linear Cryptanalysis; April 1994; Proceedings of Eurocrypt'94, LNCS 950
- Eli Biham: On Modes of Operation; Proceedings of Fast Software Encryption 1, Cambridge Security Workshop, 1993, LNCS 809
- Ishai Ben-Aroya, Eli Biham: Differential Cryptanalysis of Lucifer; October 1993; Proceedings of Crypto'93, LNCS 773; Journal of Cryptology, Vol. 9, No. 1, pp. 21-34, 1996
- Eli Biham: New Types of Cryptanalytic Attacks Using Related Keys; September 1992; Proceedings of Eurocrypt'93, LNCS 765; Journal of Cryptology, Vol. 7, No. 4, pp. 229-246, 1994
- Eli Biham, Adi Shamir: Differential Cryptanalysis of the Full 16-Round DES; December 1991; Proceedings of Crypto'92, LNCS 740
Daniel Bleichenbacher et al.
- Bleichenbacher D. and Nguyen P.: Noisy Polynomial Interpolation and Noisy Chinese Remaindering ; Advances in Cryptology -- Proceedings of EUROCRYPT '2000, LNCS vol. 1807, Springer-Verlag, pages 53-69, 2000.
- Bleichenbacher D., Patel S.: SOBER cryptanalysis ; Fast Software Encryption Workshop 1999, LNCS vol. 1636, Springer-Verlag, pages 305-316, 1999.
- Bleichenbacher D.: Chosen Ciphertext Attacks against Protocols Based on RSA Encryption Standard PKCS #1 ; in Advances in Cryptology -- CRYPTO'98, LNCS vol. 1462, pages: 1--12, 1998. Slides
- Bleichenbacher D., Joye M., Quisquater J.-J.: A new and optimal chosen-message attack on RSA-type cryptosystems; in Information and Communications Security - ICICS'97, LNCS vol. 1334. Springer-Verlag, pages: 302-313, 1997.
- Bleichenbacher D.: On the Security of the KMOV Public Key cryptosystem; in Advances in Cryptology - CRYPTO '97, LNCS vol. 1294. Springer-Verlag, pages: 235-248, 1997.
- Bleichenbacher D., Maurer U.: On the efficiency of one-time digital signatures; in Advances in Cryptology - ASIACRYPT '96, LNCS vol. 1163. Springer-Verlag, pages: 145-158, 1996.
- Bleichenbacher D., Maurer U.: Optimal Tree-Based One-time Digital Signature Schemes; STACS 96, LNCS vol. 1046, Springer-Verlag, pages: 363-374, 1996.
- Bleichenbacher D.: Generating ElGamal signatures without knowing the secret key; Advances in Cryptology - EUROCRYPT '96 (corrected version), LNCS vol. 1070, Springer Verlag, pages: 10-18, 1996.
- Bleichenbacher D., Maurer U.: Directed Acyclic Graphs, One-way Functions and Digital Signature; Advances in Cryptology - CRYPTO '94, LNCS vol. 839, Springer-Verlag, pages: 75-82, 1994.
Gerrit Bleumer et al.
- Gerrit Bleumer, Birgit Pfitzmann, Michael Waidner: A Remark on a Signature Scheme where Forgery can be Proved; Eurocrypt '90, LNCS 473, Springer-Verlag, Berlin 1991, 441-445.
- Thilo Baldin, Gerrit Bleumer: CryptoManager++ -- An object oriented software library for cryptographic mechanisms; 12th IFIP International Conference on Information Security (IFIP/Sec '96), Chapman & Hall, London 1996, 489-491.
- Gerrit Bleumer: Security for Decentralised Health Information Systems; in: Caring for Health Information -- Safety, Security, Secrecy; Elsevier Science, Amsterdam 1994, 139-146.
- Gerrit Bleumer: Security for Decentralised Health Information Systems; International Journal of Biomedical Computing 35/Suppl. 1 (Feb. 1994) 139-145.
- Joachim Biskup, Gerrit Bleumer: Reflections on Security of Database and Datatransfer Systems in Health Care;
Proc. IFIP 13th World Computer Congress, Volume II: Applications and
Impacts; North-Holland 1994, 549-556. Also published as Hildesheimer
Informatik-Berichte 10/94 (April 1994).
- Joachim Biskup, Gerrit Bleumer: Cryptographic Protection of Health Information: Cost and Benefit;
IMIA, International Medical Information Association (WG4), Data
Protection and Security Working Conference, Helsinki, 30.9.-3.10.1995,
Preproceedings, 60-67.
- Alison Treacher, Gerrit Bleumer: An Overview of SEISMED;
Studies in Health Technology and Informatics, Volume 27, Towards
Security in Medical Telematics, IOS Press, Amsterdam 1996, 4-8.
- Gerrit Bleumer, Matthias Schunter: Privacy Oriented Clearing for the German Healthcare System; Personal Medical Information -- Security, Engineering, and Ethics, Springer-Verlag, Berlin 1997, 175-194.
- Andreas Ort, Ralf Aßmann, Gerrit Bleumer, Manfred Böttger, Dirk Fox, Andreas Pfitzmann, Birgit Pfitzmann, Michael Waidner: Schutz in verteilten Systemen durch Kryptologie - Ein Praktikum im Informatik-Hauptstudium; Datenschutz und Datensicherung DuD 16/11 (1992) 571-579.
- Thilo Baldin, Gerrit Bleumer, Ralf Kanne: CryptoManager - Eine intuitive Programmierschnittstelle für kryptographische Systeme;
Sicherheitsschnittstellen - Konzepte, Anwendungen und Einsatzbeispiele,
Proc. Workshop Security Application Programming Interfaces 94,
Deutscher Universitäts Verlag, München 1994, 79-94.
- Gerrit Bleumer, Matthias Schunter: Datenschutzorientierte Abrechnung medizinischer Leistungen; Datenschutz und Datensicherung DuD 21/2 (1997) 88-97.
Dan Boneh et al.
- D. Boneh, and M. Franklin: Anonymous authentication with subset queries ; In proceedings of the 6th ACM conference on Computer and Communications Security, pp. 113--119.
- D. Boneh and M. Franklin: An efficient public key traitor tracing scheme ; In Proceedings Crypto '99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, pp. 338--353, 1999.
- T. Wu, M. Malkin, and D. Boneh: Building intrusion tolerant applications ; In proceedings of the 8th USENIX Security Symposium, pp. 79--91, 1999.
- D. Boneh, G. Durfee, and N. Howgrave-Graham: Factoring N=prq for large r ; In Proceedings Crypto '99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, pp. 326--337, 1999.
- D. Boneh and G. Durfee: Cryptanalysis of RSA with private key d less than N0.292 ; In Proceedings Eurocrypt '99, Lecture Notes in Computer Science, Vol. 1592, Springer-Verlag, pp. 1--11, 1999.
- D. Boneh and N. Daswani: Experimenting with electronic commerce on the PalmPilot; In proceedings of Financial Cryptography '99, Lecture Notes in Computer Science, Vol. 1648, Springer-Verlag, pp. 1--16, 1999.
- Dan Boneh: The decision Diffie-Hellman problem; In Proceedings of the Third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, Springer-Verlag, pp. 48--63, 1998.
- Dan Boneh: Twenty years of attacks on the RSA cryptosystem; In Notices of the American Mathematical Society (AMS), Vol. 46, No. 2, pp. 203--213, 1999.
- Dan Boneh, G. Durfee: New results on the cryptanalysis of low private exponent RSA; To appear in Eurocrypt '99.
- Dan Boneh, M. Malkin, T. Wu: Experimenting with Shared Generation of RSA keys; To appear in the Internet Society's 1999 Symposium on Network and Distributed System Security (SNDSS).
- Dan Boneh, G. Durfee, Y. Frankel: An attack on RSA given a small fraction of the private key bits; In proceedings AsiaCrypt '98, Lecture Notes in Computer Science, Vol. 1514, Springer-Verlag, pp. 25--34, 1998.
- Dan Boneh, J. Horwitz: Generating a Product of Three Primes With an Unknown Factorization; In Proceedings of the third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, Springer-Verlag, pp. 237--251, 1998.
- Dan Boneh, R. Venkatesan: Breaking RSA may not be equivalent to factoring; In Proceedings Eurocrypt '98, Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, pp. 59--71, 1998.
- Eli Biham, Dan Boneh, O. Reingold: Generalized Diffie-Hellman modulo a composite is not weaker than factoring; To appear in Information Processing Letters (IPL).
- Dan Boneh, Matt Franklin: Efficient generation of shared RSA keys; In Proceedings Crypto' 97, Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, pp. 425--439, 1997.
- Dan Boneh, Richard Lipton, Rich DeMillo: On the Importance of Checking Cryptographic Protocols for Faults; In Proceedings of Eurocrypt '97, Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, pp. 37--51, 1997.
- Dan Boneh, R. Venkatesan: Rounding in lattices and its cryptographic applications; In Proceedings of SODA 1997, pp. 675--681.
- Dan Boneh, Richard Lipton: A revocable backup system; In Proceedings 6th USENIX Security Conference, pp. 91--96, 1996.
- Dan Boneh, R. Venkatesan: Hardness of computing most significant bit of Diffie-Hellman and related schemes; In Proceedings Crypto '96, Lecture Notes in Computer Science, Vol. 1109, Springer-Verlag, pp. 129--142, 1996.
- Dan Boneh, Richard Lipton: Algorithms for Black-Box fields and their application to cryptography; In Proceedings Crypto '96, Lecture Notes in Computer Science, Vol. 1109, Springer-Verlag, pp. 283--297, 1996.
- Dan Boneh, James Shaw: Collusion Secure Fingerprinting of Digital Data; Extended abstract in Proceedings of Crypto '95, Lecture Notes in Computer Science, Vol. 963, Springer-Verlag, pp. 452--465, 1995.
- Dan Boneh, Richard Lipton: Quantum Cryptoanalysis of Hidden Linear Functions; In Proceedings of Crypto '95, Lecture Notes in Computer Science, Vol. 963, Springer-Verlag, pp. 424--437, 1995.
Colin Boyd et al.
- Chris Pavlovski and Colin Boyd: Efficient Batch Signature Generation using Tree Structures ; International Workshop on Cryptographic Techniques and E-Commerce (CrypTEC'99), City University of Hong Kong Press, pp.70-77.
- Colin Boyd and DongGook Park: Public Key Protocols for Wireless Communications ; Proceedings of ICISC'98, Korea Institute of Information Security and Cryptology, pp.47-57.
- Colin Boyd and Ernest Foo: Off-Line Fair Payment Protocol Using Convertible Signatures ; ASIACRYPT'98, LNCS, Springer-Verlag 1998, pp. 271-285.
- Colin Boyd and Anish Mathuria: Key Establishment Protocols for Secure Mobile Communications: A Selective Survey ; nformation Security and Privacy (ACISP98), Lecture Notes in Computing Science, Vol. 1438, Springer-Verlag, 1998, pp. 344-355.
- Colin Boyd: A Class of Flexible and Efficient Key Management Protocols; Proceedings of 9th IEEE Computer Security Foundations Workshop, IEEE Computer Society, 1996, pp.2-8.
- Colin Boyd, J.G. Cleary, S.A. Irvine, I. Rinsma-Melchert, I.H.Witten: Integrating Error Detection into Arithmetic Coding; IEEE Transactions on Communications, January 1997, Volume 45, Number 1, pp.1-3.
- Colin Boyd: On Key Agreement and Conference Key Agreement; Information Security and Privacy, LNCS 1270, pp.294-302, Springer-Verlag 1997.
- Colin Boyd: Extensional Goals for Authentication Protocols; DIMACS Workshop on Cryptographic Protocol Design and Verification, 1997.
- Colin Boyd: Digital Signature and Public Key Cryptosystem in a Prime Order Subgroup of Zn*; ICICS'97, Springer-Verlag, 1997; The algorithms in this paper have been broken by Henk Meijer.
Stefan Brands et al.
Gilles Brassard et al.
- Bennett, C. H., Bessette, F., Brassard, G., Salvail, L. and Smolin, J.: Experimental quantum cryptography;
Journal of Cryptology, vol. 5, no. 1, 1992, pp. 3 - 28. Preliminary
version in Advances in Cryptology - Eurocrypt '90 Proceedings, May
1990, Springer - Verlag, pp. 253 - 265.
- Bennett, C. H., Brassard, G., Cr�peau, C. and Skubiszewska, M.-H.: Practical quantum oblivious transfer; Advances in Cryptology | Crypto '91 Proceedings, August 1991, Springer - Verlag, pp. 351 - 366.
- Brassard, G., Cr�peau, C., Jozsa, R. and Langlois, D.: A quantum bit commitment scheme provably unbreakable by both parties; Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, November 1993, pp. 362 - 371.
- Brassard, G. and Cr�peau, C.: Quantum bit commitment and coin tossing protocols; Advances in Cryptology | Crypto '90 Proceedings, August 1990, Springer - Verlag, pp. 49 - 61.
- Bennett, C. H., Brassard, G. and Mermin, N. D.: Quantum cryptography with-out Bell's theorem; Physical Review Letters, vol. 68, no. 5, 3 February 1992, pp. 557 - 559.
- Brassard, G., Chaum, D. and Cr�peau, C.: Minimum disclosure proofs of knowledge; Journal of Computer and System Sciences, vol. 37, 1988, pp. 156 - 189.
- Bennett, C. H., Brassard, G., Cr�peau, C., Jozsa, R., Peres, A. and Wootters, W. K.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels; Physical Review Letters, vol. 70, 29 March 1993, pp. 1895 - 1899.
- Brassard, G. and Salvail, L.: Secret-key reconciliation by public discussion; Advances in Cryptology | Eurocrypt '93 Proceedings, May 1993, to appear.
- Bennett, C. H., Brassard, G., Cr�peau, C. and Maurer, U. M.: Generalized privacy amplification; to appear in IEEE Transactions on Information Theory, 1995.
- Brassard, G.: A bibliography of quantum cryptography.
Johannes Buchmann et al.
- Biehl, Buchmann, Thiel: Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic orders; (CRYPTO94)
- Buchmann, Biehl, Meyer, Thiel, Thiel: Tools for proving zero knowledge; (EuroCrypt 1992)
- Buchmann, Düllmann, Williams: On the complexity and efficiency of a new key exchange system; (EuroCrypt 1989)
- Ingrid Biehl, Johannes Buchmann: An analysis of the reduction algorithms for binary quadratic forms; Technical Report No. TI-26/97, 07.11.1997
- Johannes Buchmann, Sachar Paulus: A one way function based on ideal arithmetic in number fields; Technical Report No. TI-5/97
- Johannes Buchmann, Stefan Neis: Algorithms for Linear Algebra Problems over Principal Ideal Rings; Technical Report No. TI-7/96, 28.11.96
- Johannes Buchmann, Friedrich Eisenbrand: On Factor Refinement in Number Fields; Technical Report No. TI-5/96
- Johannes Buchmann, Michael Jacobson, Edlyn Teske: On some computational problems in finite abelian groups; Technical Report No. TI-2/96, 17.07.96 to appear in Mathematics of Computation 1996
Christian Cachin et al.
- Christian Cachin, Ueli Maurer: Linking information reconciliation and privacy amplification; Journal of Cryptology, 10(2):97-110, 1997.
- Christian Cachin, Claude Crépeau, Julien Marcil: Oblivious transfer with a memory-bounded receiver; In Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), 1998. To appear.
- Christian Cachin: An information-theoretic model for steganography; In David Aucsmith, editor, Proc. 2nd Workshop on Information Hiding, Lecture Notes in Computer Science. Springer-Verlag, 1998. To appear.
- Christian Cachin: On the foundations of oblivious transfer; In Kaisa Nyberg, editor, Advances in Cryptology: EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 361-374. Springer-Verlag, 1998.
- Christian Cachin, Ueli Maurer: Unconditional security against memory-bounded adversaries; In Burt Kaliski, editor, Advances in Cryptology: CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 292-306. Springer-Verlag, 1997.
- Christian Cachin: Smooth entropy and Rényi entropy; In Walter Fumy, editor, Advances in Cryptology: EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 193-208. Springer-Verlag, 1997.
- Christian Cachin: On-line secret sharing; In Colin Boyd, editor, Cryptography and Coding: 5th IMA Conference, Cirencester, UK, volume 1025 of Lecture Notes in Computer Science, pages 190-198. Springer, 1995.
- Matthias Rauterberg, Christian Cachin: Locating the primary attention focus of the user; In Thomas Grechenig and Manfred Tscheligi, editors, Vienna Conference on Human Computer Interaction, volume 733 of Lecture Notes in Computer Science, pages 129-140. Springer, 1993.
- Christian 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).
- Christian Cachin, Ueli Maurer: Sicherheit im Internet: Illusion oder Realität?; INFORMATIK / INFORMATIQUE, 2(2):18-23, 1995.
- Christian Cachin: Hashing a source with an unknown probability distribution; Preprint (Abstract in Proc. 1998 IEEE International Symposium on Information Theory, Boston), 1998.
- Christian Cachin, Ueli Maurer: Smoothing probability distributions and smooth entropy; Preprint (Abstract in Proc. 1997 IEEE International Symposium on Information Theory, Ulm), 1997.
Jan Camenisch et al.
- Jan Camenisch, Markus Stadler: Efficient Group Signature Schemes for Large Groups;
In Advances in Cryptology - CRYPTO '97, volume 1294 of Lecture Notes in
Computer Science, pages 410-424, Springer Verlag, 1997.
- Jan Camenisch, Ueli Maurer, Markus Stadler: Digital Payment Systems with Passive Anonymity-Revoking Trustees; In Journal of Computer Security, volume 5, number.1, IOS Press, 1997.
- Jan 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.
- Jan Camenisch, Markus Stadler: Proof Systems for General Statements about Discrete Logarithms; Techreport TR 260, 13 pages, Institute for Theoretical Computer Science, ETH Zürich, March 1997.
- Jan Camenisch, Ueli Maurer, Markus Stadler: Digital Payment Systems with Passive Anonymity-Revoking Trustees;
In proceedings of Computer Security - ESORICS '96, volume 1146 of
Lecture Notes in Computer Science, pages 31-43, Springer Verlag, 1996.
- Jan Camenisch, Jean-Marc Piveteau, Markus Stadler: An Efficient Fair Payment System; In proceedings of 3rd ACM Conference on Computer Communications Security, pages 88-94, ACM press, March 1996.
- Jan Camenisch, Jean-Marc Piveteau, Markus Stadler: Fair Anonyme Zahlungssysteme;
In proceedings of GISI 95 - Herausforderungen eine globalen
Informationsverbundes für die Informatik, Informatik aktuell, pages
254-265, Springer Verlag, 1995
- Markus Stadler, Jean-Marc Piveteau, Jan Camenisch: Fair Blind Signatures;
In Advances in Cryptology - EUROCRYPT '95, volume 921 of Lecture Notes
in Computer Science, pages 209-219, Springer Verlag, 1995.
- Jan Camenisch, Jean-Marc Piveteau, Markus Stadler: Blind Signatures Based on the Discrete Logarithm Problem;
In Advances in Crypology - EUROCRYPT '94, volume 950 of Lecture Notes
in Computer Science, pages 428-432, Springer Verlang, 1995.
- Jan Camenisch, Jean-Marc Piveteau, Markus Stadler: An Efficient Electronic Payment System Protecting Privacy; In Computer Security - ESORICS 94, volume 875 of Lecture Notes in Computer Science, pages 207-215, Springer Verlag, 1994.
David Chaum et al.
- D. Chaum: Achieving Electronic Privacy; Scientific American, August 1992, pp. 96-101
- D. Chaum: Online Cash Checks; Advances in Cryptology EUROCRYPT 89, Springer-Verlag, pp. 288-293
- D. Chaum: Prepaid Smart Card Techniques. A Brief Introduction and Comparison; 1993
- D. Chaum: Security Without Identification: Transaction Systems to Make Big Brother Obsolete;
Communications of the ACM, vol. 28 no. 10, October 1985 pp. 1030-1044;
Revised version (in Dutch) Informatie, pp. 213, 1987. Extended and
revised version: Subtitled "Card Computers to Make Big Brother
Obsolete" (in German), Informatik-Spektrum, vol. 10, pp.262-277 1987;
& Datenschutz und Datensicherung, no. 1, 1988, pp. 26-41
Nicolas T. Courtois et al.
- Nicolas T. Courtois:Isomorphism of Polynomials and Asymmetric Cryptography;
Rapport du Magist�re MMFAI, Paris 6 University, Ecole Normale
Sup�rieure, November 1997, mainly in french and quite out of date.
- Nicolas T. Courtois, Jacques Patarin, Louis Goubin: Improved Algorithms for Isomorphism of Polynomials; To appear in Eurocrypt'98, Springer-Verlag and on Iacr cdrom.
- Nicolas T. Courtois, Jacques Patarin, Louis Goubin: C*-+ and HM - Variations around two schemes of T. Matsumoto and H. Imai''; To appear in Asiacrypt'98, Springer-Verlag.
- Nicolas T. Courtois: The Hidden Fields Equations (HFE) public key cyptosystem.; An oline document kept up-to-date that presents or links to all available knowledge regarding HFE.
Ronald Cramer et al.
Claude Cr�peau et al.
- G. Brassard, C. Cr�peau and M. Sántha: Oblivious Transfers and Intersecting Codes;
IEEE Transaction on Information Theory, special issue in coding and
complexity, Volume 42, Number 6, pp. 1769-1780, November 1996.
- C.H. Bennett, G. Brassard, C. Cr�peau, U. Maurer: Generalized Privacy Amplification; IEEE Transaction on Information Theory, Volume 41, Number 6, pp. 1915-1923, November 1995.
- C. Cr�peau, L. Salvail: Oblivious Verification of Common String; CWI Quarterly, special issue for Crypto Course 10th Anniversary. Volume 8, Number 2, pp. 97-109, June 1995.
- C. Cr�peau: Quantum Oblivious Transfer;
Journal of Modern Optics, special issue on Quantum Communication and
Cryptography. Volume 41, Number 12, pp. 2445-2454, December 1994.
- C.H. Bennett, G. Brassard, C. Cr�peau, R. Jozsa, A. Peres, W. Wootters: Teleporting an unkown quantum state by dual classical and EPR channels; Physical Review Letter, 70:1895-1898, 1993.
- G. Brassard, C. Cr�peau, M. Yung: Constant-round perfect zero-knowledge computationally convincing protocols; Theoretical Computer Science, 84:23-52, 1991.
- P. Beauchemin, G. Brassard, C. Cr�peau, C. Goutier, C. Pomerance: The generation of random numbers that are probably prime; Journal of Cryptology, 1(1):53-64, 1988.
- G. Brassard, D. Chaum, C. Cr�peau: An introduction to minimum disclosure; Quarterly, 1:3-17, 1988.
- G. Brassard, D. Chaum, C. Cr�peau: Minimum disclosure proofs of knowledge; JCSS, 37:156-189, 1988.
- G. Brassard, C. Crépeau, D. Mayers and L. Salvail: Defeating classical Bit Commitment Schemes with a Quantum Computer; Submitted to Advances in Cryptology: Proceedings of Crypto '98, Springer-Verlag, 1998.
- C. Cr�peau: Efficient Cryptographic Protocols Based on Noisy Channels; Advances in Cryptology: Proceedings of Eurocrypt '97, Springer-Verlag, pages 306-317, 1997.
- G. Brassard, C. Cr�peau: Oblivious Transfers and Privacy Amplification; Advances in Cryptology: Proceedings of Eurocrypt '97, Springer-Verlag, pages 334-347, 1997.
- C. Cr�peau: What is going on with Quantum Bit Commitment?; invited paper in Proceedings of Pragocrypt '96, Czech Technical University Publishing House, Prague, pages 193-203, 1996.
- C. Cr�peau, J. van de Graaf, A. Tapp: Committed Oblivious Transfer and Private Multi-Party Computations; Advances in Cryptology: Proceedings of Crypto '95, Springer-Verlag, pages 110-123, 1995.
- C. Cr�peau, L. Salvail: Quantum Oblivious Mutual Identification; Advances in Cryptology: Proceedings of Eurocrypt '95, Springer-Verlag, pages 133-147, 1995.
- C.H. Bennett, G. Brassard, C. Cr�peau, U. Maurer: Generalized Privacy Amplification (Abstract); Proceedings of the IEEE Symposium on Information Theory, page 350. IEEE, 1994.
- G. Brassard, C. Cr�peau, R. Jozsa, D. Langlois: A quantum bit commitment scheme provably unbreakable by both parties.; In 34th Symp. on Found. of Computer Sci., pages 42-52. IEEE, 1993.
- C. Cr�peau, J. Kilian: Discreet solitary games; In Advances in Cryptology: Proceedings of Crypto '93, Lecture Notes in Computer Science. Springer-Verlag, pages 319-330,1993.
- C. Cr�peau: Cryptographic primitives and quantum theory; In Proceedings of the second Physics of Computation Workshop, PhysComp '92, pages 200-204, 1993.
- C.H. Bennett, G. Brassard, C. Cr�peau, M.-H. Skubiszewska: Practical quantum oblivious transfer protocols;
In Advances in Cryptology: Proceedings of Crypto '91, volume 576 of
Lecture Notes in Computer Science, pages 351-366. Springer-Verlag,
1992.
- C. Cr�peau, M. Sántha: Efficient reductions among oblivious transfer protocols based on new self-intersecting codes; In Sequences II, Methods in Communications, Security, and Computer Science, pages 360-368. Springer-Verlag, 1991.
- G. Brassard, C. Cr�peau: Quantum bit commitment and coin tossing protocols;
In Advances in Cryptology: Proceedings of Crypto '90, volume 537 of
Lecture Notes in Computer Science, pages 49-61. Springer-Verlag, 1991.
- G. Brassard, C. Cr�peau, S. Laplante, C. L�ger: Computationally convincing proofs of knowledge; In Proceedings of STACS '91, volume 480 of Lecture Notes in Computer Science, pages 251-262. Springer-Verlag, 1991.
- C. Cr�peau, M. Sántha: On the reversibility of oblivious transfer;
In Advances in Cryptology: Proceedings of Eurocrypt '91, volume 547 of
Lecture Notes in Computer Science, pages 106-113. Springer-Verlag,
1991.
- G. Brassard, C. Cr�peau: Sorting out zero-knowledge;
In Advances in Cryptology: Proceedings of Eurocrypt '89, volume 434 of
Lecture Notes in Computer Science, pages 150-154. Springer-Verlag,
1990.
- C. Cr�peau: Verifiable disclosure of secrets and applications;
In Advances in Cryptology: Proceedings of Eurocrypt '89, volume 434 of
Lecture Notes in Computer Science, pages 181-191. Springer-Verlag,
1990.
- G. Brassard, C. Cr�peau, M. Yung: Everything in NP can be argued in perfect zero-knowledge in a constant number of rounds; In 16th ICALP, volume 372 of Lecture Notes in Computer Science, pages 123-136. Springer-Verlag, 1989.
- D. Chaum, C. Cr�peau, I. Damgaard: Multiparty unconditionally secure protocols; In 19th Symp. on Theory of Computing, pages 11-19. ACM, 1988.
- C. Cr�peau, J. Kilian: Achieving oblivious transfer using weakened security assumptions; In 29th Symp. on Found. of Computer Sci., pages 42-52. IEEE, 1988.
- C. Cr�peau, J. Kilian: Weakening security assumptions and oblivious transfer;
In S. Goldwasser, editor, Advances in Cryptology: Proceedings of Crypto
'88, volume 403 of Lecture Notes in Computer Science, pages 2-7.
Springer-Verlag, 1990.
- C. Cr�peau: Equivalence between two flavours of oblivious transfers (abstract);
In C. Pomerance, editor, Advances in Cryptology: Proceedings of Crypto
'87, volume 293 of Lecture Notes in Computer Science, pages 350-354.
Springer-Verlag, 1988.
- P. Beauchemin, G. Brassard, C. Cr�peau, C. Goutier, C. Pomerance: Two observations on probabilistic primality testing;
In Advances in Cryptology: Proceedings of Crypto '86, volume 263 of
Lecture Notes in Computer Science, pages 443-450. Springer-Verlag,
1987.
- G. Brassard, C. Cr�peau: Zero-knowledge simulation of boolean circuits (extended abstract);
In Advances in Cryptology: Proceedings of Crypto '86, volume 263 of
Lecture Notes in Computer Science, pages 223-233. Springer-Verlag,
1987.
- G. Brassard, C. Cr�peau, J.-M. Robert: All-or-nothing disclosure of secrets (extended abstract);
In Advances in Cryptology: Proceedings of Crypto '86, volume 263 of
Lecture Notes in Computer Science, pages 234-238. Springer-Verlag,
1987.
- C. Cr�peau: A
zero-knowledge poker protocol that achieves confidentiality of the
players' strategy or how to achieve an electronic poker face; In
Advances in Cryptology: Proceedings of Crypto '86, volume 263 of
Lecture Notes in Computer Science, pages 239-247. Springer, 1987.
- G. Brassard, C. Cr�peau: Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond; In 27th Symp. of Found. of Computer Sci., pages 188-195. IEEE, 1986.
- G. Brassard, C. Cr�peau, J.-M. Robert: Information theoretic reductions among disclosure problems; In 27th Symp. of Found. of Computer Sci., pages 168-173. IEEE, 1986.
- C. Cr�peau: A secure poker protocol that minimizes the effects of player coalitions; In Advances in Cryptology: Proceedings of Crypto '85, vol 218 of LNCS pages 73-86. Springer, 1986.
- C. Cr�peau: Correct and Private Reductions among Oblivious Transfers;
PhD thesis, Department of Elec. Eng. and Computer Science,
Massachusetts Institute of Technology, 1990. Supervised by Silvio
Micali.
- C. Cr�peau: Protocole cryptographique de poker à l'aveugle permettant la confidentialit� de la strat�gie; Master's thesis, D�partement d'Informatique et de R.O., Universit� de Montr�al, 1986. Supervised by Gilles Brassard.
- G. Brassard, C. Cr�peau, D. Mayers, 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. Cr�peau: La cryptographie : pour que les secrets le restent; Les grands Dossiers, "Nouvelles Technologies de l'information", CyberSciences, June 1997.
- G. Brassard, C. Cr�peau: Cryptology Column -- 25 Years of Quantum Cryptography; SIGACT News, Volume 27, Number. 3, Whole Number 100, pp. 13-24, September 1996.
- C. Cr�peau: calcul partagé à base d'encryption probabiliste; Prepared for the "Camps Mathématique", AMQ, 2 pages, June 1996.
- C. Cr�peau: Réconcilliation et Distillation publiques de secret; unpublished manuscript, 13 pages, 1995.
- C. Cr�peau: Une solution au Cube de Rubik 5X5X5; Upublished manuscript, 4 pages, 1994.
Paul Crowley et al.
- Crowley, P. and Lucks, S.:Bias in the LEVIATHAN stream cipher;
Mitsuru Matsui, editor, Fast Software Encryption: 8th International
Workshop, Lecture Notes in Computer Science, Yokohama, Japan, April
2001. Springer-Verlag. To appear.
- Crowley, P.:Mercy: A fast large block cipher for disk sector encryption;
Bruce Schneier, editor, Fast Software Encryption: 7th International
Workshop, volume 1978 of Lecture Notes in Computer Science, pages
49-63, New York, USA, April 2000. Springer-Verlag.
Don Davis et al.
- D. E. Geer, D. Davis: Token-Mediated Certification and Electronic Commerce; Proc. 2nd USENIX Workshop on Electronic Commerce, (Oakland, CA, 1996), pp. 13-22.
- D. Davis: Compliance Defects in Public-Key Cryptography; Proc. 6th Usenix Security Symp., (San Jose, CA, 1996), pp. 171-178.
- D. Davis: Kerberos Plus RSA for World Wide Web Security; Proc. 1st USENIX Workshop on Electronic Commerce, (NYC, July 1995).
- D. Davis, D. E. Geer, T.Y. Ts'o: Kerberos With Clocks Adrift: History, Protocols, and Implementation;
USENIX Computing Systems 9:1 (Jan. '96). An early version of this paper
appeared in: Proc. 5th USENIX UNIX Security Symposium, Salt Lake City,
June 5-7, 1995.
- D. Davis, R. Ihaka, P.R. Fenstermacher: Cryptographic Randomness from Air Turbulence in Disk Drives ,
in Advances in Cryptology -- CRYPTO '94 Conference Proceedings, ed. by
Yvo G. Desmedt, pp.114--120. LNCS #839. Heidelberg: Springer-Verlag,
1994.
- D. Davis, R. Swick: Network Security via Private-Key Certificates, USENIX 3rd Security Symposium Proceedings, (Baltimore; Sept. '92). Also in: ACM Operating Systems Review, v.24, #4 (Oct. 1990).
- D. Davis, R. Swick: Workstation Services and Kerberos Authentication at Project Athena, MIT Laboratory for Computer Science Technical Memorandum #424 (Feb. 1990).
Dorothy E. Denning et al.
Ivo G. Desmedt et al.
Yun Ding et al.
- Yun Ding, Holger Petersen: Eine Klassifikation von Authentifikationsmodellen; Proc. Trust Center'95, Siegen, Vieweg Verlag, (1995), S. 292 - 302.
- Yun Ding, Patrick Horster, Markus Michels, Holger Petersen: Selbstzertifizierende öffentliche Schlüssel; Proc. Trust Center'95, Siegen, Vieweg Verlag, (1995), S. 307 - 325.
- Yun Ding, Holger Petersen, Patrick 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.
- Yun Ding, Patrick Horster: Undetectable On-line Password Guessing Attacks; Operating Systems Review, Vol. 29, No. 4, (1995), S. 77 - 86.
Joan Feigenbaum et al.
- M. Blaze, J. Feigenbaum, P. Resnick, 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.)
- L. Cowen, J. Feigenbaum, S. Kannan: A Formal Framework for Evaluating Heuristic Programs;
Annals of Mathematics and Artificial Intelligence, to appear. Extended
abstract appears in Proceedings of the 1996 International Colloquium on
Automata, Languages, and Programming.
- Y.-h. Chu, J. Feigenbaum, B. LaMacchia, P. Resnick, 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.)
- J. Feigenbaum, S. Rudich, M. Blaze, K. McCurley: Security and Privacy in the Information Economy; Proceedings of the National Academy of Sciences, 94 (1997), pp. 2789-2792.
- D. Beaver, J. Feigenbaum, J. Kilian, P. Rogaway: Locally Random Reductions: Improvements and Applications; Journal of Cryptology, 10 (1997), pp. 17--36.
- A. Condon, J. Feigenbaum, C. Lund, P. Shor: Random Debaters and the Hardness of Approximating Stochastic Functions;
SIAM Journal on Computing, 26 (1997), pp. 369-400. Extended abstract
appears in Proceedings of the 1994 IEEE Conference on Structure in
Complexity Theory.
- J. Feigenbaum, S. Kannan: Dynamic Graph Algorithms; in Handbook of Discrete and Combinatorial Mathematics, CRC Press, Boca Raton, to appear.
- J. Feigenbaum, L. Fortnow, S. Laplante, A. Naik: On Coherence, Random-Self-Reducibility, and Self-Correction;
to appear in Computational Complexity. Extended abstract appears in
Proceedings of the 1996 IEEE Conference on Computational Complexity.
(The first ten in this series of conferences were called ``Structure in
Complexity Theory.'')
- J. Feigenbaum, D. Koller, P. Shor: A Game-Theoretic Classification of Interactive Complexity Classes;
submitted for journal publication. Extended abstract appears in
Proceedings of the 1995 IEEE Conference on Structure in Complexity
Theory.
- D. Beaver, J. Feigenbaum, R. Ostrovsky, V. Shoup: Instance-Hiding Proof Systems; submitted for journal publication. Available as DIMACS Technical Report 93-65, Rutgers University, Piscataway, 1993.
- J. Feigenbaum, G. D. Forney, Jr., B. H. Marcus, R. J. McEliece, A. Vardy: Introduction to the Special Issue on Codes and Complexity; IEEE Transactions on Information Theory, 42 (1996), pp. 1649--1659.
- A. Condon, J. Feigenbaum, C. Lund, P. Shor: Probabilistically Checkable Debate Systems and Nonapproximability Results for PSPACE-Hard Functions, Chicago Journal of Theoretical Computer Science, volume 1995, number 4.
- J. Feigenbaum: The Use of Coding Theory in Computational Complexity;
in Different Aspects of Coding Theory, Proceedings of Symposia on
Applied Mathematics, American Mathematical Society, Providence, 1995,
pp. 207--233.
- J. Feigenbaum, L. Fortnow, C. Lund, D. Spielman: The Power of Adaptiveness and Additional Queries in Random-Self-Reductions;
Computational Complexity, 4 (1994), pp. 158--174. Extended abstract
appears in Proceedings of the 1992 EEE Conference on Structure in
Complexity Theory.
- J. Feigenbaum, N. Reingold: Universal Traversal Sequences; American Mathematical Monthly, 101 (1994), pp. 262--265.
- J. Feigenbaum: Locally Random Reductions in Interactive Complexity Theory;
in Advances in Computational Complexity Theory, DIMACS Series on
Discrete Mathematics and Theoretical Computer Science, volume 13,
American Mathematical Society, Providence, 1993, pp. 73--98.
- J. Feigenbaum, L. Fortnow: Random-Self-Reducibility of Complete Sets;
SIAM Journal on Computing, 22 (1993), pp. 994--1005. Extended abstract
appears in Proceedings of the 1991 IEEE Conference on Structure in
Complexity Theory.
- R. Beigel, J. Feigenbaum: On Being Incoherent Without Being Very Hard; Computational Complexity, 2 (1992), pp. 1--17.
- J. Feigenbaum, M. Liberman, R. Wright: Cryptographic Protection of Databases and Software;
in Distributed Computing and Cryptography, DIMACS Series on Discrete
Mathematics and Theoretical Computer Science, volume 2, American
Mathematical Society, Providence, 1991, pp. 161--172.
- J. Feigenbaum, M. Merritt: Open Questions, Talk Abstracts, and Summary of Discussions;
in Distributed Computing and Cryptography, DIMACS Series on Discrete
Mathematics and Theoretical Computer Science, volume 2, American
Mathematical Society, Providence, 1991, pp. 1--45.
- M. Abadi, J. Feigenbaum: Secure Circuit Evaluation: A Protocol Based on Hiding Information from an Oracle;
Journal of Cryptology, 2 (1990), pp. 1-12. Extended abstract appears in
Proceedings of the 1988 Symposium on Theoretical Aspects of Computer
Science.
- M. Abadi, J. Feigenbaum, J. Kilian: On Hiding Information from an Oracle;
Journal of Computer and System Sciences, 39 (1989), pp. 21--50.
(Special issue of selected papers from the 1987 ACM Symposium on Theory
of Computing.) Extended abstract appears in Proceedings of the 1987 ACM
Symposium on Theory of Computing and of the 1987 IEEE Conference on
Structure in Complexity Theory.
- M. Blaze, J. Feigenbaum, M. Strauss: Compliance Checking in the PolicyMaker Trust Management System;
in Proceedings of the 2nd Financial Crypto Conference, Lecture Notes in
Computer Science, Springer, Berlin, 1998, to appear. Available in
preprint form as AT&T Technical Report 98.3.2.
- J. Feigenbaum, S. Kannan, M. Vardi, M. Vishwanathan: Complexity of Graph Problems Represented by OBDDs (Extended Abstract);
in Proceedings of the 15th Symposium on Theoretical Aspects of Computer
Science, Lecture Notes in Computer Science, vol. 1373, Springer,
Berlin, 1998, pp. 216-226. Technical Report 97.1.2.
- J. Feigenbaum: Talk Abstracts: DIMACS Research and Educational Institute on Cryptography and Network Security (DREI '97); DIMACS Technical Report 97-80, Rutgers University, Piscataway NJ, 1998.
- J. Feigenbaum, M. Strauss: An Information-Theoretic Treatment of Random-Self-Reducibility;
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.
- M. Blaze, J. Feigenbaum, J. Lacy: Decentralized Trust Management;
in Proceedings of the 17th Symposium on Security and Privacy, IEEE
Computer Society Press, Los Alamitos, 1996, pp. 164--173. Invited for
presentation at the SIAM Symposium on Networks and Information
Management, ACM Federated Computing Research Conference, May 27, 1996.
- M. Blaze, J. Feigenbaum, J. Lacy: Managing Trust in Medical Information Systems; AT&T Technical Report 96.14.1.
- R. Brayton, A. Emerson, J. Feigenbaum: Workshop Summary: Computational and Complexity Issues in Automated Verification; DIMACS Technical Report 96-15, Rutgers University, Piscataway, 1996.
- R. Beigel, M. Bellare, J. Feigenbaum, S. Goldwasser: Languages that are Easier than their Proofs;
in Proceedings of the 32nd Symposium on Foundations of Computer
Science, IEEE Computer Society Press, Los Alamitos, 1991, pp. 19--28.
- E. Allender, J. Cai, J. Feigenbaum: Workshop Summary: Structural Complexity and Cryptography; DIMACS Technical Report 91-36, Rutgers University, Piscataway, 1991.
- J. Feigenbaum, S. Kannan, N. Nisan: Lower Bounds on Random-Self-Reducibility;
in Proceedings of the 5th Structure in Complexity Theory Conference,
IEEE Computer Society Press, Los Alamitos, 1990, pp. 100-109.
- M. Blaze, J. Feigenbaum, A. Keromytis: The KeyNote Trust Management System; work in progress. Internet Draft, March 1998.
- J. Feigenbaum: In Defense of Metadata Platforms: Position Paper;
in Proceedings of the DIMACS Workshop on ``Design for Values:Ethical,
Social, and Political Dimensions of Information Technology,''February
1998, pp. 20-24.
- J. Feigenbaum, P. Lee: Trust Management and Proof-Carrying Code in Secure Mobile Code Applications: Position Paper; in Proceedings of the DARPA Workshop on ``Foundations for Secure Mobile Code,'' March 1997, pp. 48-55.
Dirk Fox et al.
- Fox, Dirk: 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.
- Fox, Dirk: Sichere digitale Signatursysteme;
In: Mit Sicherheit in die Informationsgesellschaft. Tagungsband 5.
Deutscher IT-Sicherheitskongreß des BSI 1997, SecuMedia Verlag,
Ingelheim 1997, S. 61-76.
- Fox, Dirk; Röhm, Alexander W.: Effiziente Digitale Signatursysteme auf der Basis Elliptischer Kurven;
In: Horster, P. (Hrsg.): Digitale Signaturen. Proceedings der
Arbeitstagung Digitale Signaturen 96, Vieweg-Verlag, Braunschweig,
September 1996, S. 201-220.
- Fox, Dirk: Zeitabhängiges Key Escrowing;
In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung
Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 232-245.
- Fox, Dirk; Horster, Patrick; Kraaibeek, Peter: Grundüberlegungen zu Trust Centern;
In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung
Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 1-10.
- Fox, Dirk; Müller, Maik: Neue Zertifikate für asymmetrische Sicherheitsprotokolle;
In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung
Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 165-172.
- Fox, Dirk; Henn, Torsten; Reichel, Klaus; Ruland, Christoph: 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.
- Fox, Dirk; Ruland, Christoph: Secure Common ISDN Application Programming Interface;
In: Fumy, W.; Meister, G.; Reitenspieß, M.; Schäfer, W. (Hrsg.):
Sicherheitsschnittstellen - Konzepte, Anwendungen und Einsatzbeispiele.
Proceedings des VIS-Workshops Security APIs '94, Deutscher
Universitäts-Verlag, Wiesbaden 1994, S. 195-210.
- Dienst, Detlef; Fox, Dirk; Ruland, Christoph: Transparente Sicherheitsmechanismen f�r ISDN-Anwendungen; ITG-Fachtagung Nutzung und Technik von Kommunikationsendgeräten. ITG-Fachbericht 131, vde-verlag, Offenbach 1994, S. 81-95.
- Fox, Dirk; Böttger, Manfred: SecuBoot - Authentisches remote boot für Client-Server-Netzwerke;
In: Bauknecht, K.; Teufel, S. (Hrsg.): Sicherheit in
Informationssystemen. Proceedings der Fachtagung SIS '94, vdf-Verlag,
Zürich 1994, S. 161-173.
- Fox, Dirk: Der 'Digital Signature Standard'. Aufwand, Implementierung und Sicherheit;
In: Weck, G.; Horster, P. (Hrsg.): Proceedings der Fachtagung
Verläßliche Informationssysteme - VIS '93. DuD-Fachberichte Nr. 16,
Vieweg-Verlag, Braunschweig 1993, S. 333-352.
- Fox, Dirk; Pfitzmann, Birgit: Effiziente Softwareimplementierung des GMR-Signatursystems;
In: Pfitzmann, A.; Raubold, E. (Hrsg.): Proceedings der Fachtagung
Verläßliche Informationssysteme - VIS '91. Informatik Fachberichte Nr.
271, Springer Verlag, Heidelberg 1991, S. 329-345.
Matthew K. Franklin et al.
- M. Franklin, D. Boneh: Efficient generation of shared RSA keys; Advances in Cryptology -- Crypto '97 Proceedings
- M. Franklin, M. Reiter: Fair exchange with a semi-trusted third party; Proc. ACM Conference on Computer and Communications Security, 1997
- M. Franklin, M. Reiter: The design and implementation of a secure auction service;
IEEE Transactions on Software Enginerring, Vol. 22, No. 5, May 1996,
302--312. Earlier version in Proc. 1995 IEEE Conference on Security and
Privacy
- M. Franklin, D. Coppersmith, J.Patarin, M. Reiter: Low exponent RSA with related messages; Advances in Cryptology -- Eurocrypt '96 Proceedings. Earlier version in IBM Research Report RC 20318, December 27, 1995
- M. Franklin, R. Cramer, B. Schoenmakers, M. Yung: Multi-authority secret ballot elections with linear work; Advances in Cryptology -- Eurocrypt '96 Proceedings. Earlier version in CWI Research Report CS-R9571, January 1996
- M. Franklin, M. Yung: Privacy from partial broadcast; Proc. 27th Annual ACM Symposium on Theory of Computing (STOC 1995)
- M. Franklin, M. Yung: The blinding of weak signatures; Advances in Cryptology -- Eurocrypt '94 Proceedings
- M. Franklin, Z. Galil, M. Yung: Eavesdropping games: a graph-theoretic approach to privacy in distributed systems'; Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS 1993)
- M. Franklin, M. Yung: Secure and efficient off-line digital money;
Proc. 20th International Colloquium on Automata, Languages and
Programming (ICALP 1993). Earlier version in Columbia University
Research Report, 1992
- M. Franklin, M. Yung: Varieties of secure distributed computing; Proc. Sequences II, Methods in Communications, Security and Computer Science, 1991
Peter Gemmell et al.
Rosario Gennaro et al.
- Rosario Gennaro, Pankaj Rohatgi: How to Sign Digital Streams; CRYPTO'97.
- Rosario Gennaro, Hugo Krawczyk, Tal Rabin: RSA-based Undeniable Signatures; CRYPTO'97.
- Ronald Cramer, Rosario Gennaro, Berry Schoenmakers: A Secure and Optimally Efficient Multi-Authorithy Election Scheme; Appears in European Transactions of Telecommunications Vol.8, No.5. A preliminary version appears at EUROCRYPT'97.
- Ran Canetti, Rosario Gennaro: Incoercible Multiparty Computation; 1996 IEEE Symposium on the Foundations of Computer Science (FOCS 96).
- Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin: Robust and Efficient Sharing of RSA Functions; The link above is to the final version of the paper that appeared in preliminary form at CRYPTO 1996.
- Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin: Robust Threshold DSS Signatures;
To appear in Information and Computation. The link above is to the
final version of the paper that appeared in preliminary form at
EUROCRYPT 1996.
- Rosario Gennaro, Silvio Micali: Verifiable Secret Sharing as Secure Computation; EUROCRYPT 1995.
- Rosario Gennaro: Achieving Independence Efficiently and Securely; 1995 ACM Conference on Principles of Distributed Computing Systems (PODC95).
- Scott Decatur, Rosario Gennaro: On Learning from Noisy and Incomplete Examples; 1995 ACM Conference on Computational Learning Theory (COLT95).
- Giuseppa Carra'-Ferro, Giovanni Gallo, Rosario Gennaro: Probabilistic Verification of Elementary Geometry Statements;
1995 IMACS Conference on Applications of Computer Algebra. Note: This
is a one-page abstract, the full paper is in preparation.
- Rosario Gennaro: PAC Learning PROLOG clauses with or without errors; MIT Laboratory for Computer Science. Number: Technical Memo n.500.
- Rosario Gennaro: On the definition and properties of Zero-Knowledge arguments; Master's thesis, MIT EECS Department.
- Rosario Gennaro: Theory and Practice of Verifiable Secret Sharing; Ph.D. Thesis MIT EECS Department.
Ed Gerck et al.
Oded Goldreich et al.
- N. Alon, O. Goldreich, J. Hastad, R. Peralta: Simple Constructions of Almost $k$-wise Independent Random Variables; June 1992. (See also an Addendum.)
- B. Awerbuch, O. Goldreich, D. Peleg, R. Vainish: A Trade-off between Information and Communication in Broadcast Protocols; June 1989.
- M. Bellare, O. Goldreich: On Defining Proofs of Knowledge; 1992. See also our notes on Proofs of Computational Ability (1992).
- M. Bellare, O. Goldreich, S. Goldwasser: Randomness in Interactive Proofs; August 1991. Addendum, May 1997.
- M. Bellare, O. Goldreich, S. Goldwasser: Incremental Cryptography; 1995.
- M. Bellare, O. Goldreich, M. Sudan: Free Bits, PCPs and Non-Approximability; 1995.
- S. Ben-David, B. Chor, O. Goldreich, M. Luby: On the Theory of Average Case Complexity; 1989.
- M. Ben-Or, R. Canetti, O. Goldreich: Asynchronous Secure Computation, 1993. See Ran Canetti's PhD Thesis, 1995. (over 100 pages, 1.4M)
- M. Blum, O. Goldreich: Towards a Computational Theory of Statistical Tests; 1992.
- R. Canetti, G. Even, O. Goldreich: Lower Bounds for Sampling Algorithms for Estimating the Average; October 1994.
- R. Canetti, U. Feige, O. Goldreich, M. Naor: Adaptively Secure Multi-party Computation; TR-682, LCS/MIT, 1996.
- R. Canetti, O. Goldreich: Bounds on Tradeoffs between Randomness and Communication Complexity; August 1990.
- R. Canetti, O. Goldreich, S. Halevi:The Random Oracle Methodology, Revisited; March 1998.
- R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan, P. Rohatgi: The Random Oracle Hypothesis is False; July 1992.
- B. Chor, J. Freidmann, O. Goldreich, J. Hastad, S. Rudich, R. Smolensky: The Bit Extraction Problem or t-Resilient Functions; 1985.
- B. Chor, O. Goldreich: On the power of two-points based sampling; 1985.
- B. Chor, O. Goldreich: Unbiased Bits From Sources of Weak Randomness and Probabilistic Communication Complexity; (file contains only Abstract and Introduction), 1986.
- B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan:Private Information Retrieval; 1995.
- I. Damgard, O. Goldreich, T. Okamoto, A. Wigderson: Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs; (Extended Abstract), September 1995. See also partial version by Damgard, Goldreich, and Wigderson, November 1994.
- I. Damgard, O. Goldreich, A. Wigderson: Information Theory versus Complexity Theory: Another Test Case; September 1995.
- S. Decatur, O. Goldreich, D. Ron: Computational Sample Complexity; April 1997.
- G. Even, O. Goldreich, M. Luby, N. Nisan, B. Velickovic: Approximations of General Independent Distributions; 1992.
- S. Even, O. Goldreich: On the Security of Multi-Party Ping-Pong Protocols; (file contains only Abstract and Introduction), 1985.
- S. Even, O. Goldreich, S. Micali: On-Line/Off-Line Digital Signatures; revised 1994.
- M. Furer, O. Goldreich, Y. Mansour, M. Sipser, S. Zachos: On Completeness and Soundness in Interactive Proof Systems, 1989.
- O. Goldreich: Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme; 1986.
- O. Goldreich: Randomness, Interaction, Proofs and Zero-Knowledge (a survey); 1987. See a revised version of the part on Computational Randomness; 1987 (rev. 1997).
- O. Goldreich: A Note on Computational Indistinguishability; 1989.
- O. Goldreich: Three XOR-Lemmas - An Exposition; July 1991.
- O. Goldreich: A Uniform-Complexity Treatment of Encryption and Zero-Knowledge; July 1991.
- O. Goldreich:Probabilistic Proof Systems (survey); 1995.
- O. Goldreich: The Graph Clustering Problem has a Perfect Zero-Knowledge Proof; October 1996.
- O. Goldreich: A Computational Perspective on Sampling (survey); May 1997.
- O. Goldreich:The Foundations of Cryptography -- An Essay; June 1997.
- O. Goldreich: Combinatorial Property Testing -- A Survey; 1997.
- O. Goldreich, S. Goldwasser: On the Limits of Non-Approximability of Lattice Problems; Sept. 1997.
- O. Goldreich, S. Goldwasser, S. Halevi: Using Lattice Problems in Cryptography
- O. Goldreich, S. Goldwasser, D. Ron: Property Testing and its connection to Learning and Approximation; 1996.
- O. Goldreich, S. Goldwasser, D. Ron: A Note on Testing Monotinicity; 1997.
- O. Goldreich, S. Goldwasser, N. Linial: Fault-tolerant Computation in the Full Information Model; revised October 1995.
- O. Goldreich, J. Hastad: On the Complexity of Interactive Proof with Bounded Communication; Feb. 1996. (rev. April 1997)
- O. Goldreich, A. Herzberg, A. Segall: A Quantitative Approach to Dynamic Networks; 1992.
- O. Goldreich, R. Impagliazzo, L.A. Levin, R. Venkatesan, D. Zuckerman: Security Preserving Amplification of Hardness; August 1990.
- O. Goldreich, A. Kahan: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP; March 1996.
- O. Goldreich, H. Krawczyk: On the Composition of Zero-Knowledge Proof Systems; revised 1994.
- O. Goldreich, L.A. Levin: Hard-core Predicates for any One-way Function, 1989. See Three XOR-Lemmas - An Exposition (1991) or extracts from a new book (to be published by Springer, end 1998). .
- O. Goldreich, L.A. Levin, N. Nisan: On Constructing 1-1 One-Way Functions; June 1995.
- O. Goldreich, B. Meyer: Computational Indistinguishability -- Algorithms vs. Circuits; December 1996.
- O. Goldreich, S. Micali: Increasing the Expansion of Pseudorandom Generators; 1984.
- O. Goldreich, N. Nisan, A. Wigderson: On Yao's XOR-Lemma; March 1995.
- O. Goldreich, R. Ostrovsky: Software Protection and Simulation on Oblivious RAMs; revised October 1995.
- O. Goldreich, R. Ostrovsky, E. Petrank: Computational Complexity and Knowledge Complexity; revised March 1995.
- O. Goldreich, E. Petrank: Quantifying Knowledge Complexity; revised July 1996.
- O. Goldreich, E. Petrank: The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols; October 1990.
- O. Goldreich, B. Pfitzmann, R.L. Rivest: Self-Delegation with Controlled Propagation; September 1997.
- O. Goldreich, D. Ron: A Universal Learning Algorithm; June 1996.
- O. Goldreich, D. Ron: Property Testing in Bounded-Degree Graphs; 1997.
- O. Goldreich, D. Ron: A Sublinear Bipartite Tester for Bounded Degree Graphs; 1997.
- O. Goldreich, R. Rubinfeld, M. Sudan: Learning polynomials with queries: the highly noisy case; FOCS95 version.
- O. Goldreich, S. Safra: A Combinatorial Consistency Lemma with application to the PCP Theorem; 1996.
- O. Goldreich, A. Sahai, S. Vadhan: Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge; 1998.
- O. Goldreich, M. Sudan: Computational Indistinguishability: A Sample Hierarchy; March 1998.
- O. Goldreich, R. Vainish: How to Solve any Protocol Problem - An Efficiency Improvement; 1987.
- O. Goldreich, A. Wigderson: Tiny Families of Functions with Random Properties:A Quality-Size Trade-off for Hashing; revised January 1996.
- O. Goldreich, A. Wigderson: On the Circuit Complexity of Perfect Hashing; July 1996.
- O. Goldreich, D. Zuckerman: Another proof that BPP subseteq PH (and more); September 1997.
Louis Goubin et al.
- J. Patarin, L. Goubin: Asymmetric Cryptography with Multivariate Polynomials over Finite Fields (abstract); Presented in the Dagstuhl Workshop on Cryptography, Germany, September 1997.
- J. Patarin, L. Goubin: Asymmetric Cryptography with Multivariate Polynomials over Finite Fields (transparencies); Presented in the Dagstuhl Workshop on Cryptography, Germany, September 1997.
- J. Patarin, 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.
- J. Patarin, 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, L. Goubin: La Génération d'Aléas sur Ordinateur; Quadrature, No 30, November 1997, pp. 27-36 (in French).
- J. Patarin, L. Goubin, N. Courtois: Improved Algorithms for Isomorphisms of Polynomials; Proceedings of EUROCRYPT'98, Springer, Lecture Notes in Computer Science, Vol. 1403, May 1998, pp. 184-200.
- J. Patarin, L. Goubin, N. Courtois: C*-+ and HM: Variations around two schemes of T. Matsumoto and H. Imai; Proceedings of ASIACRYPT'98, Springer, Lecture Notes in Computer Science, Vol. 1514, October 1998, pp. 35-49.
- A. Kipnis, J. Patarin, L. Goubin, N. Courtois: Unbalanced Oil and Vinegar Signature Schemes; Proceedings of EUROCRYPT'99, Springer, Lecture Notes in Computer Science, Vol. 1592, May 1999, pp. 206-222.
- L. Goubin, J. Patarin: DES and Differential Power Analysis (Paper); Proceedings of CHES'99, Springer, Lecture Notes in Computer Science, Vol. 1717, August 1999.
- L. Goubin, J. Patarin: DES and Differential Power Analysis (Transparencies); Presented at the CHES'99 Conference, August 1999.
Shai Halevi et al.
- O. Goldreich, S. Goldwasser, S. Halevi: Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem; To appear in CRYPTO '97. Available as ECCC Report TR97-018.
- O. Goldreich, S. Goldwasser, S. Halevi: Public-Key Cryptosystems from Lattice Reduction Problems; To appear in CRYPTO '97. Available as ECCC Report TR96-056.
- R. Canetti, S. Halevi, A. Herzberg: How to Maintain Authenticated Communication in the Presence of Break-ins; To appaer in PODC '97. Preliminiary version available as Theory of Cryptography Library: Record Arc-02.
- S. Halevi, H. Krawczyk: MMH: Message Authentication in Software in the Gbit/second Rates; In proceedings of the 4th Workshop on Fast Software Encryption, 1997. (slides in compressed PostScript format are available here).
- S. Halevi, S. Micali: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing; in Advances in Cryptography - CRYPTO '96, pages 201-215, Santa Barbara, CA USA, 1996. Springer-Verlag.
- S. Halevi: Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver; in Advances in Cryptography - CRYPTO '95, pages 84-96, Santa Barbara, CA USA, 1995. Springer-Verlag.
- A. Ben-Dor, S. Halevi, A. Schuster: Potential Function Analysis of Greedy Hot-Potato Routing;
in proceedings of 13'th Annual ACM Symposium on Principles of
Distributed Computing, pages 225-234, Los-Angeles, CA USA, 1994. ACM
Press.
- A. Ben-Dor, S. Halevi: 0-1 Permanent is #P-Complete, a Simpler Proof; in proceedings of the 2'nd Israeli Symposium on Theory and Computing Systems, pages 108-117, Netanya, Israel, 1993. IEEE.
- S. Halevi and S. Micali: A Stronger Notion of Proofs of Knowledge
- O. Goldreich, S. Goldwasser, S. Halevi: Collision-Free Hashing from Lattice Problems; Available as Theory of Cryptography Library: Record 96-09.
- S. Halevi, E. Petrank: Storing Classified Files
Carlo Harpes et al.
- Carlo Harpes, Gerhard G. Kramer, James L. Massey: A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-up Lemma; to be presented at Eurocrypt '95, May 1995.
- Carlo 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.
- Carlo Harpes: Partitioning Cryptanalysis; Post-Diploma Thesis, Signal and Information Processing Lab., Swiss Federal Institute of Technology, Zurich, March 1995.
Russell Impagliazzo et al.
David Jablon et al.
Markus Jakobsson et al.
Stanislaw Jarecki et al.
- Amir Herzberg, Hugo Krawczyk, Moti Yung, Stanislaw Jarecki: Proactive Secret Sharing and Public Key Cryptosystems; MIT M.Eng. Thesis: Feb'96
- Rosario Gennaro, Hugo Krawczyk, Tal Rabin, Stanislaw Jarecki: Robust Threshold DSS Signature; Eurocrypt'96
- Rosario Gennaro, Hugo Krawczyk, Tal Rabin, Stanislaw Jarecki: Robust and Efficient Sharing of RSA Functions; Crypto'96
- Amir Herzberg, Hugo Krawczyk, Markus Jakobsson, Moti Yung, Stanislaw Jarecki: Proactive Public Key and Signature Systems; ACM Security'97
- Andrew Odlyzk, Stanislaw Jarecki: An efficient micropayment system based on probabilistic polling; Financial Cryptography'97
Marc Joye et al.
- M. Joye, J.-J. Quisquater: Efficient computation of full Lucas sequences; Electronics Letters, Vol. 32, No. 6, pp. 537-538, March 1996.
- M. Joye, J.-J. Quisquater: Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams; Designs, Codes and Cryptography, Vol. 14, pp. 53-56, 1998.
- M. Joye:Common modulus attack against Lucas-based cryptosystems; Tech. Report CG-1996/10, UCL Crypto Group, Louvain-la-Neuve, December 1996.
- M. Joye, J.-J. Quisquater, F. Koeune:Further results on Chinese remaindering; Tech. Report CG-1997/1, UCL Crypto Group, Louvain-la-Neuve, March 1997.
- M. Joye, J.-J. Quisquater, F. Koeune:Takagi/Naito's algorithm revisited; Tech. Report CG-1997/3, UCL Crypto Group, Louvain-la-Neuve, March 1997.
- M. Joye, J.-J. Quisquater: Faulty RSA encryption; Tech. Report CG-1997/8, UCL Crypto Group, Louvain-la-Neuve, July 1997.
- M. Joye: Security analysis of RSA-type cryptosystems; PhD. thesis in Cryptography, UCL, October 1997 (118 pages)
Mike Just et al.
- M. Just: Some Timestamping Protocol Failures; To appear at the Internet Society Symposium on Network and Distributed System Security, San Diego, CA, Mar 11-13, 1998
- M. Just, S. Vaudenay: Authenticated Multi-Party Key Agreement;
In Advances in Cryptology - Asiacrypt '96, Lecture Notes in Computer
Science 1163, Springer-Verlag, pp. 36-49, November, 1996. Correction to above LNCS version - 1 page.)
- M. Just, E. Kranakis, D. Krizanc, P. Van Oorschot: On Key Distribution via True Broadcasting; In Proceedings of 2nd ACM Conference on Computer and Communications Security, pp. 81-88, November 1994
- M. Just: Methods of Multi-Party Cryptographic Key Establishment; Master's Thesis - September 1994
Seungjoo Kim et al.
- S.J.Kim, B.C.Kim, S.J.Park: Comments on password-based private key download protocol of NDSS'99 (Click here for Sung-Ming Yen's revised version), Electronics Letters 35(22), IEE Press, 1999, pp.1937-1938.
- M. Joye, S.J.Kim, N.-Y.Lee: Cryptanalysis of two group signature schemes,
Masahiro Mambo, Yuliang Zheng (Eds.): Proc. of ISW'99, Information
Security Workshop, Springer-Verlag, LNCS(Lecture Notes in Computer
Science) 1729, Kuala Lumpur, Malaysia, November 6-7 1999, pp.271-275.
- S.J.Kim, I.S.Lee, M.Mambo, S.J.Park: On the difficulty of key recovery systems,
Masahiro Mambo, Yuliang Zheng (Eds.): Proc. of ISW'99, Information
Security Workshop, Springer-Verlag, LNCS(Lecture Notes in Computer
Science) 1729, Kuala Lumpur, Malaysia, November 6-7 1999, pp.207-224.
- S.J.Kim: Improved privacy and authenticity in digital signatures / key management, PhD. thesis in Information Eng., Sungkyunkwan University, Korea, February 1999. (Supervised by Prof. Dong-Ho Won)
- S.J.Kim, S.H.Oh, S.J.Park and D.H.Won: Verifiable self-certified public keys Proc. of WCC'99, INRIA Workshop on Coding and Cryptography, 1999, pp.139-148 ; Proceedings published by INRIA, France ISBN 2-7261-1136-X.
- S.J.Kim, S.H.Oh, K.K.Kim and D.H.Won: One-time self-certified public keys, revisited Proc. of ICISC'98, International Conference on Information Security and Cryptology, Vol.1/No.1, 1998, pp.59-69 ; ISBN 89-85305-14-X.
- S.J.Park, S.J.Kim and D.H.Won: ID-based group signature Electronics Letters, Vol. 33/No. 19, 1997, pp.1616-1617. (in .PS format) (The algorithms in this paper have been broken by W.Mao and revised (in Korean) by the authors.)
- S.J.Kim, S.J.Park, and D.H.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.
- S.J.Kim, S.J.Park and D.H.Won: Group signatures for hierarchical multigroups Proc. of ISW'97, Information Security Workshop, Springer, Lecture Notes in Computer Science, LNCS 1396,1997,pp.273-281.
- S.J.Kim, S.J.Park and D.H.Won: Convertible group signatures Advanced in Cryptology - Asiacrypt'96, Springer, Lecture Notes in Computer Science, LNCS 1163, 1996,pp.311-321.
- S.J.Kim, S.J.Park and D.H.Won: Zero-knowledge nominative signatures (revised 19th November 1998), Proc. of Pragocrypt'96, International Conference on the Theory and Applications of Cryptology, 1996, pp.380-392 ; Proceedings published by CTU PUBLISHING HOUSE ISBN 80-01-01502-5.
Lars R. Knudsen et al.
- Lars R. Knudsen, Kaisa Nyberg: Provable Security Against a Differential Attack; The Journal of Cryptology, vol.8, No. 1, 1995
- Lars R. Knudsen, Ivan B. Damgaard: Two-Key Triple Encryption; To appear in the Journal of Cryptology
- Lars R. Knudsen, Eli Biham: Cryptanalysis of the ANSI X9.52 CBCM Mode; Advances in Cryptology - EuroCrypt'98, LNCS, Springer Verlag, 1998, to appear.
- Lars R. Knudsen, Thomas Jakobsen: The Interpolation Attack on Block Ciphers; Proc. Fast Software Encryption'97
- Lars R. Knudsen, Joan Daemen, Vincent Rijmen: The block cipher SQUARE; Proc. Fast Software Encryption'97
- Lars R. Knudsen, Bart Preneel: Hash Functions Based on Block Ciphers and Quaternary Codes; Advances in Cryptology - Proc. AsiaCrypt'96, LNCS 1163, pp. 77-90, Springer Verlag, 1996.
- Lars R. Knudsen, Willi Meier: Improved Differential Attack on RC5; Advances in Cryptology - Proc. CRYPTO'96, LNCS 1109, pp. 216-228, Springer Verlag, 1996.
- Lars R. Knudsen, Torben P. Pedersen: On the Difficulty of Software Key Escrow; Advances in Cryptology - Proc. EUROCRYPT'96, LNCS 1070, pp. 237-244, U.~Maurer, Springer Verlag, 1996.
- Lars R. Knudsen, Matt Robshaw: Non-linear Approximations in Linear Cryptanalysis; Advances in Cryptology - Proc. EUROCRYPT'96, LNCS 1070, pp. 224-236, Springer Verlag, 1996.
- Lars R. Knudsen, Tom Berson: Truncated Differentials of SAFER;
Fast Software Encryption, Third International Workshop, Cambridge, UK,
February 1996, LNCS 1039, pp. 15-26, D.,~Gollmann, Springer Verlag,
1995.
- Lars R. Knudsen: A Key-schedule Weakness in SAFER K-64; Advances in Cryptology - Proc. Crypto'95, LNCS 963, pp. 274-286, Springer Verlag, 1995.
- Lars R. Knudsen, Ivan B. Damgaard: Multiple Encryption with Minimum Key;
Cryptography: Policy and Algorithms. International Conference,
Brisbane, Queensland, Australia, July 1995, LNCS 1029, pp. 156-164,
Springer Verlag, Berlin Heidelberg.
- Lars R. Knudsen: Truncated and Higher Order Differentials; Fast Software Encryption - Second International Workshop, Leuven, Belgium, LNCS 1008, pp. 196-211, Springer Verlag, 1995.
- Lars R. Knudsen, Xuejia Lai: New attacks on all Double Block Length Hash Functions of Hash Rate 1, including the Parallel DM; Advances in Cryptology - EUROCRYPT'94, LNCS 950, pp. 410-418, Springer Verlag, 1995.
- Lars R. Knudsen: New potentially weak keys for DES and LOKI; Advances in Cryptology - EUROCRYPT'94, LNCS 950, A.~.De~Santis, pp. 419-424, Springer Verlag, 1995.
- Lars R. Knudsen: Practically Secure Feistel Ciphers;
Fast Software Encryption, The Cambridge Security Workshop, Cambridge,
U.K., December 1993. Springer Verlag, Lecture Note Series 809, pp.
211-221, Berlin Heidelberg 1994.
- Lars R. Knudsen, Xuejia Lai: Attacks on Double Block Length Hash Functions;
Fast Software Encryption, The Cambridge Security Workshop, Cambridge,
U.K., December 1993. Springer Verlag, Lecture Note Series 809, pp.
157-165, Berlin Heidelberg 1994.
- Lars R. Knudsen, Ivan B. 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.
- Lars R. Knudsen: Cryptanalysis of LOKI91; Advances in Cryptology - AusCrypt'92. Springer Verlag, Lecture Note Series 718, pp. 196-208, Berlin Heidelberg 1993.
- Lars R. Knudsen: Iterative characteristics of DES and s^{2}-DES; Advances in Cryptology - Crypto'92. Springer Verlag, Lecture Note Series 746, pp. 497-511, Berlin Heidelberg 1993.
- Lars R. Knudsen: Cryptanalysis of LOKI; Advances in Cryptology - AsiaCrypt'91. Springer Verlag, Lecture Note Series 739, pp. 22-35, Berlin Heidelberg 1993.
Markus Kuhn et al.
- Markus Kuhn: Soft Tempest: Hidden Data Transmission Using Electromagnetic Emanations; a paper that will appear in the proceedings of the Workshop on Information Hiding and presents a few interesting new twists on eavesdropping computers using their compromising electromagnetic emanations
- Markus Kuhn: Low Cost Attacks on Tamper Resistant Devices; appeared in M Lomas et al. (ed.), Security Protocols, 5th International Workshop, Paris, France, April 7-9, 1997, Proceedings, Springer LNCS 1361, pp 125-136, ISBN 3-540-64040-1.
- Markus Kuhn: Tamper Resistance - a Cautionary Note;
appeared in The Second USENIX Workshop on Electronic Commerce
Proceedings, Oakland, California, November 18-21, 1996, pp 1-11 and
describes new attack techniques on smartcards and other security
processors.
Matthew Kwan et al.
Helger Lipmaa et al.
- Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Villemson: Time-Stamping with Binary Linking Schemes ;
In Hugo Krawczyk, editor, Advances in Cryptology --- CRYPTO '98, volume
1462 of Lecture Notes in Computer Science, pages 486-501.
Springer-Verlag, 1998. A pdf version is available here.
- Helger Lipmaa: IDEA: A cipher for multimedia architectures? ; In Stafford Tavares and Henk Meijer, editors, Selected Areas in Cryptography '98 ,
volume 1556 of Lecture Notes in Computer Science, pages 253--268,
Kingston, Canada, 17--18 August 1998. Springer-Verlag. A pdf version is
available here.
- Helger Lipmaa: Secure and Efficient Time-Stamping Systems; PhD thesis, University of Tartu, 1999. A pdf version is available here.
Stefan Lucks et al.
Wenbo Mao et al.
- Mao W., C. Boyd: Towards formal analysis of security protocols; IEEE Computer Security Foundations Workshop VI. pages 147-158. IEEE Computer Society Press, Los Alamitos, CA. 1993.
- Boyd C., W. Mao: On a limitation of BAN logic; Advances in Cryptology, EUROCRYPT'93, LNCS(765):240-247. Springer-Verlag. Lofthus, Norway. May, 1993.
- Mao W., C. Boyd: Design of authentication and key management protocols;
In official document of International Organisation for Standardisation
(ISO) and International Electrotechnical Commission (IEC) JTC1, SC27,
WG2, Document N262: ``Papers on authentication and key management
protocols based on symmetric techniques''. February 1994.
- Mao W., C. Boyd: On the use of encryption in cryptographic protocols;
In official document of International Organisation for Standardisation
(ISO) and International Electrotechnical Commission (IEC) JTC1, SC27,
WG2, Document N262: ``Papers on authentication and key management
protocols based on symmetric techniques''. February 1994.
- Mao W: To Decrypt or not to Decrypt? That is the Question; 1994 Cambridge Workshop on Security Protocols. Cambridge. April 1994.
- Mao W., C. Boyd: Classification of cryptographic techniques in authentication protocols; Selected Areas in Cryptography. pages 95--106. Kingston, Ontario,Canada. May 1994.
- Mao W., C. Boyd: Development of authentication protocols: some misconceptions and a new approach; IEEE Computer Security Foundations Workshop VII. pages 178-186. IEEE Computer Society Press, Los Alamitos, CA. June 1994.
- Mao W., C. Boyd: On strengthening authentication protocols to foil cryptanalysis; 1994 European Symposium on Research in Computer Security (ESORICS'94), LNCS(875):193-204. Springer-Verlag, 1994.
- Mao W., C. Boyd: Methodical Use of Cryptographic Transformations in Authentication Protocols; IEE Proceedings, Comput. Digit. Tech., Vol. 142, No. 4, pp 272--278, July 1995.
- Mao W.: An Augmentation of BAN-Like Logics; in 8th IEEE Computer Security Foundations Workshop, pp 44--56, IEEE Computer Society Press, June 1995.
- Mao W., S. Zaba: The HP Protocol for Internet Secure Payment Transactions; 33rd Internet Engineering Task Force pp 493--496. Stockholm, Sweden. July 1995.
- Mao W.: A Secure, Cheap, Scalable and Exportable/Importable Method for Internet Electronic Payments;
Advanced Payment Systems for Open Networks. Workshop of the US
Government Advisory Committee on Internet Technologies. November 1-2,
1995. San Francisco, CA.
- Mao W.: On Cryptographic Techniques for On-line Bankcard Payment Transactions Using Open Networks;
1996 Cambridge Workshop on Security Protocols. The Isaac Newton
Institute, Cambridge. April 1996. LNCS(1189):1--17 Springer-Verlag.
- Mao W.: On two Proposals for On-line Bankcard Payments using Open Networks: Problems and Solutions; 1996 IEEE Symposium on Security and Privacy, pp 201--210, IEEE Computer Society Press. May 1996.
- Mao W.: Lightweight Micro-Cash for the Internet;
1996 Europian Symposium on Research in Computer Security (ESORICS'96),
LNCS(1146):15--32. Springer-Verlag, Rome, Italy. September 1996.
- Mao W.: Blind Certification of Public Keys; Data Security Letter. Number 73, July/August 1996. Trusted Information Systems Inc.
- Mao W.: Electronic Cash; Data Security Letter. Number 74, September 1996. Trusted Information Systems Inc.
- Mao W.: Verifiable Escrowed Signature; In Second Australian Conference in Information Security and Privacy. LNCS 1270, pp 240--248, Springer. Sydney, July, 1997.
- Mao W.: Publicly Verifiable Partial Key Escrow; In Information and Communications Security, ICICS'97. LNCS 1334, pages 409-413, Springer. Beijing, November, 1997.
- Mao W.: Necessity and Realization of universally verifiable secret sharing; To appear in 1998 IEEE Symposium on Security and Privacy. Oakland, CA, May 1998.
Ueli Maurer et al.
- Martin Hirt, Ueli Maurer: Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation; Computer Science Department, ETH Zürich. 1997. in Proceedings of PODC '97
- Christian Cachin, Ueli Maurer: Unconditional Security Against Memory-Bounded Adversaries; Computer Science Department, ETH Zürich. 1997.in Proceedings of CRYPTO '97
- Ueli Maurer, Stefan Wolf: Privacy Amplification Secure Against Active Adversaries; Computer Science Department, ETH Zürich. 1997. in Proceedings of CRYPTO '97
- Ueli Maurer: Information-theoretically secure secret-key agreement by NOT authenticated public discussion; Computer Science Department, ETH Zürich. 1997. in Proceedings of EUROCRYPT '97
- Ueli Maurer, Stefan Wolf: The intrinsic conditional mutual information and perfect secrecy; Computer Science Department, ETH Zürich. 1996.in Proceedings of ISIT '97 (abstract)
- Ueli M. Maurer: Modelling a public-key infrastructure;
Institute for Theoretical Computer Science, ETH Zürich. 1996.Proc.
European Symposium on Research in Computer Security (ESORICS' 96) (to
appear) Pages: 26
- Jan Camenisch, Ueli Maurer, Markus Stadler: Digital payment systems with passive anonymity-revoking trustees; Computer Science Department, ETH Zürich, Union Bank of Switzerland, Ubilab, 1997 in Journal of Computer Security
- Daniel Bleichenbacher, Ueli Maurer: On the efficiency of one-time digital signatures; Computer Science Department, ETH Zürich. 1996. in Advances in Cryptology - ASIACRYPT '96
- Ueli Maurer, Stefan Wolf: Towards Characterizing when Information-Theoretic Secret Key Agreement is Possible; Computer Science Department, ETH Zürich. 1996. in Advances in Cryptology - ASIACRYPT '96
- Ueli Maurer, Stefan Wolf: On the Complexity of Breaking the Diffie-Hellman Protocol; Institute for Theoretical Computer Science, ETH Zürich,. April 1996. Pages: 29.
- Ueli Maurer: A Unified and Generalized Treatment of Authentication Theory;
Institute for Theoretical Computer Science, ETH Zürich. 1996. Lecture
Notes in Computer Science: STACS 96. Vol. 1046. Springer-Verlag,
Berlin. Pages: 387-398.
- Ueli M. Maurer: Factoring with an Oracle; Institute for Theoretical Computer Science, ETH Zürich. 1996. in Computational Complexity. Birkhäuser, Basel. Pages: 12.
- Bleichenbacher D., Maurer U.: Optimal Tree-Based One-time Digital Signature Schemes;
Institute for Theoretical Computer Science, ETH Zürich. 1996. Lecture
Notes in Computer Science: STACS 96. Vol. 1046. Springer-Verlag,
Berlin. Pages: 363-374.
- Charles H. Bennett, Gilles Brassard, Claude Crépeau, Ueli M. Maurer: Generalized Privacy Amplification; 1995. IEEE Transactions on Information Theory. Vol. 41. Nr. 6.
- Ueli M. Maurer: Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters; Institute for Theoretical Computer Science, ETH Zürich. 1995. Journal of Cryptology. Vol. 8. Nr. 3. Pages: 123-156.
- Ueli M. Maurer, Y. Yacobi: A non-interactive public-key distribution system; Institute for Theoretical Computer Science, ETH Zürich. 1996. Designs, Codes and Cryptography (to appear).
- Ueli M. Maurer: Kryptologie: eine neuartige Anwendung der Mathematik; Institute for Theoretical Computer Science, ETH Zürich. 1995. Elemente der Mathematik. Vol. 50. Nr. 3. Birkhäuser, Basel.
Pages: 89-106. Language: German.
- Ueli M. Maurer: The Role of Information Theory in Cryptography;
Institute for Theoretical Computer Science, ETH Zürich. 1995. Codes and
Cyphers, Cryptography and Coding IV, (Proc. of 4th IMA Conference on
Cryptography and Coding, Cirencester, England). Pages: 49-71.
- C. Cachin, U.M. Maurer: Linking Information Reconciliation and Privacy Amplification; Institute for Theoretical Computer Science,ETH Zürich. 1995. Journal of Cryptology (to appear).
- Ueli M. Maurer: The Strong Secret Key Rate of Discrete Random Triples;
Institute for Theoretical Computer Science, ETH Zürich. 1994.
Communication and Cryptography -- Two Sides of One Tapestry. Kluwer
Academic Publishers. Pages: 271-285.
- Ueli M. Maurer: Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms;
Institute for Theoretical Computer Science, ETH Zürich. 1994. Lecture
Notes in Computer Science: Advances in Cryptology - CRYPTO '94. Vol.
839. Springer-Verlag, Berlin. Pages: 271-281.
- Bleichenbacher D., Maurer U.: Directed Acyclic Graphs, One-way Functions and Digital Signature;
Institute for Theoretical Computer Science, ETH Zürich. 1994. Lecture
Notes in Computer Science: Advances in Cryptology - CRYPTO '94. Vol.
839. Springer-Verlag, Berlin. Pages: 75-82.
- Ueli M. Maurer, Pierre E. Schmid: A Calculus for Secure Channel Establishment in Open Networks;
Institute for Theoretical Computer Science, ETH Zürich; Omnisec AG,
Regensdorf, Switzerland. Nov 1994. Lecture Notes in Computer Science:
Proc. 1994 European Symposium on Research in Computer Security
(ESORICS' 94), Brighton, England. Springer-Verlag, Berlin.
- Ueli M. Maurer: Secret key agreement by public discussion from common information;
Institute for Theoretical Computer Science, ETH Zürich. 1993. IEEE
Transactions on Information Theory. Vol. 39. Pages: 733-742.
- Ueli M. Maurer, James L. Massey: Cascade ciphers: the importance of being first;
nstitute for Theoretical Computer Science, ETH Zürich; Institute for
Signal and Information Processing, ETH Zürich. 1993. Journal of
Cryptology. Vol. 6. Nr. 1. Pages: 89-105.
- Ueli M. Maurer: A universal statistical test for random bit generators; Institute for Theoretical Computer Science, ETH Zürich. 1992. Journal of Cryptology. Vol. 5. Nr. 2.
- Ueli M. Maurer: Some number-theoretic conjectures and their relation to the generation of cryptographic primes;
Institute for Theoretical Computer Science, ETH Zürich. 1992.
Cryptography and Coding II. Oxford University Press. Pages: 173-191.
- Ueli M. Maurer: A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators;
Institute for Theoretical Computer Science, ETH Zürich. 1992. Lecture
Notes in Computer Science: Advances in Cryptology - EUROCRYPT '92. Vol.
658. Springer-Verlag, Berlin. Pages: 239-255.
- Ueli M. Maurer: Conditionally-perfect secrecy and a provably-secure randomized cipher; Institute for Theoretical Computer Science, ETH Zürich. 1992. Journal of Cryptology. Vol. 5. Nr. 1. Pages: 53-66.
- Ueli M. Maurer: Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs; Institute for Theoretical Computer Science, ETH Zürich. 1992. Discrete Applied Mathematics. Vol. 37. Pages: 421-436.
- Ueli M. Maurer, James L. Massey: Local randomness in pseudo-random sequences; Institute for Theoretical Computer Science, ETH Zürich. 1991. Journal of Cryptology. Vol. 4. Nr. 2. Pages: 135-149.
- Ueli M. Maurer: Factoring with an Oracle;
Institute for Theoretical Computer Science, ETH Zürich. May 1993.
Lecture Notes in Computer Science: Advances in Cryptology - Eurocrypt
'92. Vol. 658. Springer-Verlag, Berlin. Pages: 24-28.
- Ueli M. Maurer: Perfect cryptographic security from partially independent channels;
Institute for Theoretical Computer Science, ETH Zürich. May 1991.
Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC).
Pages: 561-572.
Daniele Micciancio et al.
Moni Naor et al.
- Mihir Bellare, Russell Impagliazzo, Moni Naor: Does Parallel Repetition Lower the Error in Computationally Sound Protocols?; Proceedings of 38th Annual Symposium on Foundations of Computer Science, IEEE, 1997.
- Matt Blaze, Joan Feigenabum, Moni Naor: A Formal Treatment of Remotely-Keyed Encryption; Eurocrypt 98.
- Cynthia Dwork, Jeff Lotspiech, Moni Naor: Digital Signets: Self-Enforcing Protection of Digital Information; Proc. 28th Ann. ACM Symp. on Theory of Computing, 1997, pp.
- Ron Fagin, Moni Naor, Peter Winkler: Comparing Inforamtion Without Leaking It; Communications of the ACM, vol 39, May 1996, pp. 77-85.
- Moni Naor, Kobbi Nissim: Certificate Revocation and Certificate Update; 7th USENIX Security Symposium, 1998.
- Moni Naor, Benny Pinkas: Secure and Efficient Metering; Eurocrypt 98.
- Moni Naor, Adi Shamir: Visual Cryptography; Eurocrypt 94.
- Moni Naor, Adi Shamir: Visual Cryptography II; Cambrdige Workshop on Protocols, 1996.
- Moni Naor, Benny Pinkas: Visual Authentication; Crypto 97.
- Moni Naor, Omer Reingold: Synthesizers and their application to the parallel construction of pseudo-random functions; Extended abstract in: Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 170-181.
- Moni Naor, Omer 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.
- Moni Naor, Omer 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
- Moni Naor, Omer Reingold: From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs;
- Moni Naor, Avishai Wool: The Load Capacity and Availability of Quorum Systems; to appear, SIAM J. on Computing (Prelim. version, 35th FOCS).
- Moni Naor, Avishai Wool: Acceess Control and Signatures via Quorum Secret Sharing; 5th ACM Conf. on Computer and Communication Security, 1996.
Jacques Patarin et al.
- Jacques Patarin: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms; Eurocrypt'96, Springer Verlag, pp. 33-48.
- Jacques Patarin, Louis Goubin, Nicolas T. Courtois: Improved Algorithms for Isomorphism of Polynomials; To appear in Eurocrypt'98, Springer-Verlag and on Iacr cdrom.
- Jacques Patarin, Louis Goubin, Nicolas T. Courtois: C*-+ and HM - Variations around two schemes of T. Matsumoto and H. Imai''; To appear in Asiacrypt'98, Springer-Verlag.
- Jacques Patarin, Aviad Kipnis, Louis Goubin: Unbalanced Oil and Vinegar Signature Schemes; To appear in Eurocrypt'99, Springer-Verlag.
- Jacques Patarin: Comments on cryptanalysis of HFE paper by Shamir and Kipnis from Crypto'99; Not published.
Holger Petersen et al.
- Holger Petersen, Patrick Horster, Markus Michels: Das Meta-ElGamal Signaturverfahren und seine Anwendungen; Proc. Verl�ssliche Informationssysteme VIS'95, Rostock, Vieweg Verlag, (1995), S. 207 - 228.
- Holger Petersen, Patrick Horster, Markus Michels: Ein neues Key Escrow System mit aktivem Abh�rer; Proc. Trust Center '95, Siegen, Vieweg Verlag, (1995), S. 246 - 260.
- Holger Petersen, Yun Ding: Eine Klassifikation von Authentifikationsmodellen; Proc. Trust Center'95, Siegen, Vieweg Verlag, (1995), S. 292 - 302.
- Holger Petersen, Yun Ding, Patrick Horster, Markus Michels: Selbstzertifizierende �ffentliche Schl�ssel; Proc. Trust Center'95, Siegen, Vieweg Verlag, (1995), S.307 - 325.
- Holger Petersen, Patrick Horster, Markus Michels: Taxonomie digitaler Signaturkonzepte; Proc. Digitale Signaturen, Darmstadt, Vieweg Verlag, (1996), S. 63 - 79.
- Holger Petersen: Man-in-the-middle-Angriff auf ein Schl�sselaustauschprotokoll; Anmerkung auf der Fachkonferenz Digitale Signaturen, Darmstadt, September (1996)
- Holger Petersen: Faires elektronisches Geld; 5.Deutscher IT-Sicherheitskongress, SecuMedia, (1997), S. 425 - 444.
- Holger Petersen, Patrick Horster, Markus Michels: Authenticated encryption schemes with low communication costs; Electronics Letters, Vol. 30, No. 15, (1994), S. 1230 - 1231.
- Holger Petersen, Patrick Horster, Markus Michels: Generalized ElGamal signatures for one message block; Proc. 2nd Int. Workshop on IT-Security, Wien, R.Oldenbourg Verlag, (1994), S. 66 - 81.
- Holger Petersen, Patrick Horster, Markus 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.
- Holger Petersen, Patrick Horster, Markus Michels: Meta-ElGamal signature schemes; Proc. 2nd ACM Computer and Communications Security Conference, Fairfax, ACM Press, (1994), S. 96 - 107.
- Holger Petersen, Patrick Horster, Markus 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.
- Holger Petersen, Patrick Horster, Markus Michels: Meta-Multisignatures schemes based on the discrete logarithm problem; Proc. IFIP/SEC'95, Kapstadt, Chapman and Hall, (1995), S. 128 - 142.
- Holger Petersen, Patrick Horster, Markus Michels: A new key escrow system with active investigator; Proc. Securicom'95, Paris, (1995), S. 15 - 28.
- Holger Petersen, Patrick Horster, Markus Michels: Comment: Digital signature scheme with (t,n) shared verification; Electronics Letters, Vol. 31, No. 14, Juli, (1995), S. 1137.
- Holger Petersen, Patrick Horster, Markus Michels: Hidden signature schemes based on the discrete logarithm problem and related concepts; Proc. 1st Int. Conference on Communications and Multimedia Security, Graz, Chapman and Hall, (1995), S. 160 - 177.
- Holger Petersen, Patrick Horster, Markus Michels: Digital signature scheme based on Lucas functions; Proc. 1st Int. Conference on Communications and Multimedia Security, Graz, Chapman and Hall, (1995), S. 178 - 190.
- Holger Petersen, Patrick Horster, Markus Michels: Comment: "Cryptanalysis" of the blind signatures based on the discrete logarithm problem; Electronics Letters, Vol. 31, No. 21, (1995), S. 1827.
- Holger Petersen, Patrick Horster, Markus 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.
- Holger Petersen, Patrick Horster, Markus 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.
- Holger Petersen, Patrick Horster, Yun Ding: 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.
- Holger Petersen, Markus Michels: GOST 34.10 - A brief overview about Russian's DSS; Computers and Security, Dezember, (1996).
- Holger Petersen, Markus Michels: On signature schemes with threshold verification detecting malicious verifiers; Proc. Security Protocols Workshop, Paris, April, (1997), LNCS 1361, Springer Verlag, S. 67 - 78
- Holger Petersen, Patrick Horster, Markus 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
- Holger Petersen, Patrick Horster: Self certified keys - Concepts and Applications; Proc. Communications and Multimedia Security'97, Athen, Chapman & Hall, (1997), S. 102 - 116
- Holger Petersen, Guillaume 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.
- Holger Petersen, Markus Michels: A note on "Magic Ink Signatures"; Manuskript, Juni, (1997), 4 Seiten.
- Holger Petersen, Markus Michels: Cryptanalysis and improvement of signcryption schemes; IEE Computers and Digital Communications, Vol. 145, No. 2, (1998), Seite 149 - 151.
- Holger Petersen, Alexander Herrigel, Joseph O'Ruanaidh, Shelby Pereira, Thierry Pun: Secure Copyright Protection Techniques for Digital Images; Proc. Workshop on Information Hiding, April, (1998), 12 Seiten, erscheint in LNCS, Springer.
Andreas Pfitzmann et al.
Birgit Pfitzmann et al.
- Andreas Pfitzmann, Birgit Pfitzmann, Michael Waidner: ISDN-MIXes - Untraceable Communication with very small Bandwidth Overhead;
Proc. Kommunikation in verteilten Systemen, Feb. 1991 Mannheim,
Informatik-Fachberichte 267, Springer-Verlag, Heidelberg 1991, 451-463;
Slightly extended in: Information Security, Proc. IFIP/Sec'91, Mai
1991, Brighton, D. T. Lindsay, W. L. Price (eds.), North-Holland,
Amsterdam 1991, 245-258.
- Birgit Pfitzmann, Michael Waidner: Formal Aspects of Fail-stop Signatures; Interner Bericht 22/90 der Fakultät für Informatik, Universität Karlsruhe, Dezember 1990.
- Gerrit Bleumer, Birgit Pfitzmann, Michael Waidner: A Remark on a Signature Scheme where Forgery can be Proved; Eurocrypt '90, LNCS 473, Springer-Verlag, Berlin 1991, 441-445.
- David Chaum, Eugène van Heijst, Birgit Pfitzmann: Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer; Interner Bericht 1/91, Fakultät für Informatik, Universität Karlsruhe, February 1991.
- Birgit Pfitzmann, Michael Waidner: Fail-stop Signatures and their Application;
SECURICOM 91; 9th Worldwide Congress on Computer and Communications
Security and Protection, 20.-22. March 1991, Paris La Défense, 145-160.
- Birgit Pfitzmann: Fail-stop Signatures: Principles and Applications; Proc. Compsec '91, 8th world conference on computer security, audit and control, Elsevier, Oxford 1991, 125-134.
- David Chaum, Eugène van Heijst, Birgit Pfitzmann: Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer (Extended abstract); Crypto '91, LNCS 576, Springer Verlag, Berlin 1992, 470-484.
- Eugène van Heijst, Torben Pedersen, Birgit Pfitzmann: New Constructions of Fail-Stop Signatures and Lower Bounds; Crypto '92, LNCS 740, Springer-Verlag, Berlin 1993, 15-30.
- Birgit Pfitzmann: Sorting Out Signature Schemes -- and some Theory of Secure Reactive Systems; Hildesheimer Informatik-Berichte 4/93 (Mai 1993), Institut für Informatik, Universität Hildesheim.
- Birgit Pfitzmann: Sorting Out Signature Schemes; 1st ACM Conference on Computer and Communications Security, 3.-5.11.1993, Fairfax, acm press 1993, 74-85.
- Ivan B. Damgård, Torben P. Pedersen, Birgit Pfitzmann: On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures; Crypto '93, LNCS 773, Springer-Verlag, Berlin 1994, 250-265.
- Birgit Pfitzmann: Fail-Stop Signatures Without Trees; Hildesheimer Informatik-Berichte 16/94 (Juni 1994), Institut für Informatik, Universität Hildesheim.
- Birgit Pfitzmann: Sorting Out Signature Schemes; CWI Quarterly 8/2 (1995) 147-172 (appeared March 1996).
- Niko Bari'c, Birgit Pfitzmann: Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees; Eurocrypt '97, LNCS 1233, Springer-Verlag, Berlin 1997, 480-494.
- Michael Waidner, Birgit Pfitzmann: Loss-Tolerance for Electronic Wallets; FTCS 20, 26-28th June 1990, Newcastle upon Tyne (UK), 140-147.
- Birgit Pfitzmann, Michael Waidner: Strong Loss Tolerance for Untraceable Electronic Coin Systems; Hildesheimer Informatik-Berichte 15/95 (June 1995), Institut für Informatik, Universität Hildesheim.
- Birgit Pfitzmann, Michael Waidner: Properties of Payment Systems - General Definition Sketch and Classification; IBM Research Report RZ 2823 (#90126) 05/06/96, IBM Research Division, Zürich, May 1996.
- Birgit Pfitzmann, Matthias Schunter, Michael Waidner: Optimal Efficiency of Optimistic Contract Signing; to appear in 17th Symposium on Principles of Distributed Computing (PODC), ACM, New York 1998.
-
Jean-Paul Boly, Antoon Bosselaers, Ronald Cramer, Stig Mjølsnes, Frank
Muller, Torben Pedersen, Birgit Pfitzmann, Peter de Rooij, Berry
Schoenmaker, Luc Vallée, Michael Waidner: Digital Payment Systems in the ESPRIT Project CAFE; Securicom 94, Paris 1.-3.6.1994, 35-45.
- Birgit Pfitzmann, Arnd Weber: News from CAFE -- High Security Digital Payment Systems --; Abstract of 5-minute Talk, distributed at 1995 IEEE Symposium on Research in Security and Privacy, Oakland.
- Birgit Pfitzmann, Matthias Schunter: Asymmetric Fingerprinting; Eurocrypt '96, LNCS 1070, Springer-Verlag, Berlin 1996, 84-95.
- Birgit Pfitzmann: Trials of Traced Traitors; Information Hiding, LNCS 1174, Springer-Verlag, Berlin 1996, 49-64.
- Birgit Pfitzmann (collected by): Information Hiding Terminology -- Results of an informal plenary meeting and additional proposals; Information Hiding, LNCS 1174, Springer-Verlag, Berlin 1996, 347-350.
- Birgit Pfitzmann, Michael Waidner: Asymmetric Fingerprinting for Larger Collusions; IBM Research Report RZ 2857 (#90805) 08/19/96, IBM Research Division, Zurich, August 1996.
- Birgit Pfitzmann, Michael Waidner: Anonymous Fingerprinting; IBM Research Report RZ 2881 (#90829) 11/18/96, IBM Research Division, Zürich, Nov. 1996.
- Birgit Pfitzmann, Michael Waidner: Asymmetric Fingerprinting for Larger Collusions; 4th ACM Conference on Computer and Communications Security, Zürich, April 1997, 151-160.
- Birgit Pfitzmann, Michael Waidner: Anonymous Fingerprinting; Eurocrypt '97, LNCS 1233, Springer-Verlag, Berlin 1997, 88-102.
- Birgit Pfitzmann, Andreas Pfitzmann: How to Break the Direct RSA-Implementation of MIXes; Eurocrypt '89, LNCS 434, Springer-Verlag, Berlin 1990, 373-381.
- Birgit Pfitzmann, Michael Waidner: Attacks on protocols for server-aided RSA computation; Eurocrypt '92, LNCS 658, Springer-Verlag, Berlin 1993, 153-162.
- Birgit Pfitzmann: Breaking an Efficient Anonymous Channel; Eurocrypt '94, LNCS 950, Springer-Verlag, Berlin 1995, 332-340.
- Birgit Pfitzmann, Michael Waidner: How to Break and Repair a "Provably Secure" Untraceable Payment System; Crypto '91, LNCS 576, Springer Verlag, Berlin 1992, 338-350.
- Birgit Pfitzmann, Matthias Schunter, Michael Waidner: How to Break Another "Provably Secure" Payment System; Eurocrypt '95, LNCS 921, Springer-Verlag, Berlin 1995, 121-132.
- Birgit Pfitzmann, Michael Waidner: How to Break Fraud-Detectable Key Recovery; IBM Research Report RZ 2970 11/03/1997, IBM Research Division, Zürich, Oct. 1997.
- Michael Waidner, Birgit Pfitzmann: Unconditional Sender and Recipient Untraceability in spite of Active Attacks - Some Remarks; Fakultät für Informatik, Universität Karlsruhe, Interner Bericht 5/89, March 1989.
- Michael Waidner, Birgit Pfitzmann:
The Dining Cryptographers in the Disco: Unconditional Sender and
Recipient Untraceability with Computationally Secure Serviceability; Universität Karlsruhe 1989; Abstract in: Eurocrypt '89, LNCS 434, Springer-Verlag, Berlin 1990, 690.
- Birgit Baum-Waidner, Birgit Pfitzmann, Michael Waidner: Unconditional Byzantine Agreement with Good Majority; STACS'91, LNCS 480, Springer-Verlag, Heidelberg 1991, 285-295.
- Birgit Pfitzmann, Michael Waidner: Unconditional Byzantine Agreement for any Number of Faulty Processors (Extended Abstract); STACS '92, LNCS 577, Springer-Verlag, Berlin 1992, 339-350.
- Birgit Pfitzmann, Michael Waidner: Unconditionally Untraceable and Fault-tolerant Broadcast and Secret Ballot Election; Hildesheimer Informatik-Berichte (Mai 1992), Institut für Informatik, Universität Hildesheim.
- Birgit Pfitzmann, Michael Waidner: A General Framework for Formal Notions of "Secure" System; Hildesheimer Informatik-Berichte 11/94 (April 1994), Institut für Informatik, Universität Hildesheim.
- Birgit Pfitzmann, Michael Waidner: Information-Theoretic Pseudosignatures and Byzantine Agreement for t &greaterequal; n/3; IBM Research Report RZ 2882 (#90830) 11/18/96, IBM Research Division, Zürich, Nov. 1996.
- Ivan B. Damgård, Torben P. Pedersen, Birgit Pfitzmann: Statistical Secrecy and Multi-Bit Commitments; BRICS Report Series RS-96-45, Computer Science Department, Aarhus University, Nov. 1996.
- Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest: Self-Delegation with Controlled Propagation -- or -- What If You Lose Your Laptop; Theory of Cryptography Library 97-12, September 1997.
- Ivan B. Damgård, Birgit 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.
- Andreas Pfitzmann, Birgit Pfitzmann: Technical Aspects of Data Protection in Health Care Informatics; Advances in Medical Informatics, J. Noothoven van Goor and J. P. Christensen (Eds.), IOS Press, Amsterdam 1992, 368-386.
- Andreas Pfitzmann, Birgit Pfitzmann, Matthias Schunter, Michael Waidner: Mobile User Devices and Security Modules: Design for Trustworthiness; IBM Research Report RZ 2784 (#89262) 02/05/96, IBM Research Division, Zurich, Feb. 1996.
- Andreas Pfitzmann, Birgit Pfitzmann, Michael Waidner: Telefon-MIXe: Schutz der Vermittlungsdaten für zwei 64-kbit/s-Duplexkanäle über den (2*64 + 16)-kbit/s-Teilnehmeranschluß; Datenschutz und Datensicherung DuD /12 (1989) 605-622.
- Birgit Pfitzmann: Neu und sicher: Digitale Fail-stop-Signaturen; KES - Zeitschrift für Kommunikations- und EDV-Sicherheit 7/5 (1991) 321-326.
- Michael Waidner, Birgit Pfitzmann: Anonyme und verlusttolerante elektronische Brieftaschen; Interner Bericht 1/87 der Fakultät für Informatik, Universität Karlsruhe 1987 (80 Seiten).
- Birgit Pfitzmann, Michael Waidner, Andreas Pfitzmann: Rechtssicherheit trotz Anonymität in offenen digitalen Systemen;
Datenschutz und Datensicherung DuD 14/5-6 (1990) 243-253, 305-315.
Nachgedruckt in: Kongreßband 1. Kieler Netztage '93, Verlag Claus
Schönleber, Kiel, ISBN 3-926986-18-2, 1993, 55-93.
- Birgit Pfitzmann: Vergleich der algebraischen und kryptographischen Modellierung von Kryptoprotokollen; Studienarbeit, Institut für Rechnerentwurf und Fehlertoleranz, Universität Karlsruhe 1988.
- Birgit Pfitzmann, Michael Waidner: Unbedingte Unbeobachtbarkeit mit kryptographischer Robustheit;
GI-Fachtagung Verläßliche Informationssysteme (VIS '91),
Informatik-Fachberichte 271, Springer-Verlag, Heidelberg 1991, 302-320.
- Dirk Fox, Birgit Pfitzmann: Effiziente Software-Implementierung des GMR-Signatursystems;
GI-Fachtagung Verläßliche Informationssysteme (VIS'91), März 1991,
Darmstadt, Informatik-Fachberichte 271, Springer-Verlag, Heidelberg
1991, 329-345.
- Andreas Ort, Ralf Aßmann, Gerrit Bleumer, Manfred Böttger, Dirk Fox, Andreas Pfitzmann, Birgit Pfitzmann, Michael Waidner: Schutz in verteilten Systemen durch Kryptologie - Ein Praktikum im Informatik-Hauptstudium; Datenschutz und Datensicherung DuD 16/11 (1992) 571-579.
- Michael Waidner, Birgit Pfitzmann, Andreas Pfitzmann: Über die Notwendigkeit genormter kryptographischer Verfahren; Datenschutz und Datensicherung DuD /6 (1987) 293-299.
- Andreas Pfitzmann, Birgit Pfitzmann, Michael Waidner: Weitere Aspekte fernmeldetechnischer Alternativen zum ISDN; PIK, Praxis der Informationsverarbeitung und Kommunikation 11/1 (1988) 5-7.
- Hannes Federrath, Anja Jerichow, Andreas Pfitzmann, Birgit Pfitzmann: Mehrseitig sichere Schlüsselerzeugung; Proc. Arbeitskonferenz Trust Center 95, DuD Fachbeiträge, Vieweg, Wiesbaden 1995, 117-131.
Bart Preneel et al.
Ronald L. Rivest et al.
- Ronald L. Rivest, M.J.B. Robshaw, R. Sidney, Y.L. Yin: The RC6 Block Cipher; a block cipher submitted for consideration as the new AES
- Ronald L. Rivest: Can We Eliminate Revocation Lists?; To appear in the Proceedings of Financial Cryptography 1998.
- Ronald L. Rivest: Chaffing and Winnowing: Confidentiality without Encryption; Version of March 18, 1998, ``Chaffing and Winnowing'' and Comments on Crypto Policy (Powerpoint slides)
- Ronald L. 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
- Ronald L. Rivest, Hal Abelson, Ross Anderson, Steven M.
Bellovin, Josh Benaloh, Matt Blaze, Whitfield Diffie, John Gilmore,
Peter G. Neumann, Jeffery I. Schiller, Bruce Schneier: The Risks of Key Recovery, Key Escrow, and Trusted Third Party Encryption; Report Home Page at CDT
- Ronald L. 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
- Ronald L. Rivest: Perspectives on Financial Cryptography; iinvited talk given at the Financial Cryptography '97 conference, (PowerPoint slides)
- Ronald L. Rivest, Butler Lampson: SDSI---A Simple Distributed Security Infrastructure; (See also the SDSI Page); [Version 1.0] (PowerPoint 4.0 slides for USENIX 96 presentation); (PowerPoint 4.0 slides for RSA Laboratories Colloquia 96 presentation); (PowerPoint 7.0 slides for CRYPTO 96 presentation);
- Ronald L. Rivest: All-Or-Nothing Encryption and The Package Transform; To appear in the Proceedings of the 1997 Fast Software Encryption Conference
-
Ronald L. Rivest, Matt Blaze, Whitfield Diffie, Ronald L. Rivest, Bruce
Schneier, Tsutomu Shimomura, Eric Thompson, Michael Wiener: Minimal Key Lenths for Symmetric Ciphers to Provide Adequate Commercial Security
- M. Bellare, R. L. Rivest: Translucent Cryptography---An Alternative to Key Escrow, and its Implementation via Fractional Oblivious Transfer; 18 Feb 1996 (MIT/LCS Technical Report 683)
- Ronald L. Rivest: Multi-grade cryptography; To appear.
- Ronald L. Rivest, Adi Shamir, David A. Wagner: Time-lock puzzles and timed-release Crypto; 10 Mar 1996, To appear.
- Mike Burmester, Ronald L. Rivest, Adi Shamir: Geometric Cryptography;
- R. L. Rivest, A. Shamir: PayWord and MicroMint--Two Simple Micropayment Schemes; To appear. PowerPoint slides for RSA '96 conference.
- Ronald L. Rivest: The RC5 Encryption Algorithm; To appear in Proceedings of the 1994 Leuven Workshop on Algorithms (Springer). Note on corrections; The RC5 Encryption Algorithm; revised 3/20/97.
- Ronald L. Rivest: The MD5 Message Digest Algorithm; Internet RFC 1321 (April 1992).
- Ronald L. Rivest: The MD4 Message Digest Algorithm; Internet RFC 1320 (April 1992).
- Ronald L. Rivest: Cryptography and Machine Learning; Proceedings ASIACRYPT '91 (Springer 1993), 427--439.
- Ronald L. Rivest: Finding Four Million Large Random Primes; Proc. CRYPTO 90 (Springer 1991), 625--626.
- Ronald L. Rivest: Cryptography; Chapter 13 of Handbook of Theoretical Computer Science, (ed. J. Van Leeuwen) vol. 1 (Elsevier, 1990), 717--755. (Note.)
- Benny Chor, Ronald L. Rivest: A Knapsack Type Cryptosystem Based on Arithmetic in Finite Fields; IEEE Trans. Information Theory 34,5 (Sep. 1988), 901--909. (Also in CRYPTO 84.)
- Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks; SIAM J. Computing 17,2 (April 1988), 281--308. (Note.)
- Ronald L. Rivest: Testing Implementations of DES; (unpublished, 2/85)
- R.L. Rivest, A. Shamir, L. Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems Communications of the ACM 21,2 (Feb. 1978), 120--126.
- David Gillman, Ronald L. Rivest: Complete Variable-Length `FixFree' Codes; Designs, Codes, and Cryptography 5,2 (March 1995), 109--114.
Phillip Rogaway et al.
- Mihir Bellare, Anand Desai, David Pointcheval, Phillip 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.
- Mihir Bellare, Ted Krovetz, Phillip Rogaway: Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible; Advances in Cryptology - EUROCRYPT '98, Lecture Notes in Computer Science, Vol. 1403, K. Nyberg, ed., Springer-Verlag.
- Mihir Bellare, Anand Desai, Eron Jokipii, Phillip 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.
- Mihir Bellare, Phillip Rogaway: Collision-resistant hashing: Towards making UOWHFs practical; Advances in Cryptology - CRYPTO '97, Lecture Notes in Computer Science, Vol. 1294, B. Kaliski, ed., Springer-Verlag, 1997.
- Phillip Rogaway, Don Coppersmith: A software-optimized encryption algorithm; Fast software encryption, Lecture Notes in Computer Science, Vol. 809, R. Anderson, ed., Springer-Verlag, 1993.
- Phillip Rogaway: Bucket hashing and its application to fast message authentication; Advances in Cryptology - CRYPTO '95, Lecture Notes in Computer Science, Vol. 963, D. Coppersmith, ed., Springer-Verlag, 1995.
- Don Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway: Locally random reductions: Improvements and applications; Journal of Cryptology, Winter 1997, pp. 17-36.
- Joe Kilian, Phillip Rogaway: How to protect DES against exhaustive key search;
Advances in Cryptology - CRYPTO '96, Lecture Notes in Computer Science,
Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996, pp. 252-267.
- Phillip Rogaway: The security of DESX; Less technical summary of the above article. RSA Laboratories' CryptoBytes, Summer 1996.
- Mihir Bellare, Phillip Rogaway: The exact security of digital signatures - How to sign with RSA and Rabin;
Advance in Cryptology - EUROCRYPT '96, Lecture Notes in Computer
Science, Vol. 1070, U. Maurer, ed., Springer-Verlag, pp. 399-416. 1996.
- Mihir Bellare, Roch Guerin, Phillip Rogaway: XOR MACs: New methods for message authentication using finite pseudorandom functions; Advances in Cryptology - CRYPTO '95, Lecture Notes in Computer Science, Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
- Mihir Bellare, Phillip Rogaway: Provably secure session key distribution - The three party case; Proc. 27th Annual Symposium on the Theory of Computing, ACM, 1995.
- Mihir Bellare, Phillip Rogaway: The complexity of approximating a nonlinear program; Journal of Mathematical Programming B, Vol. 69, No. 3, pp. 429-441, September 1995.
- Mihir Bellare, Joe Kilian, Phillip Rogaway: The security of the cipher block chaining message authentication code; Advances in Cryptology - CRYPTO '94, Lecture Notes in Computer Science, Vol. 839. Y. Desmedt, ed., Springer-Verlag, 1994.
- Mihir Bellare, Phillip Rogaway: Optimal asymmetric encryption - How to encrypt with RSA; Advances in Cryptology - EUROCRYPT '94, Lecture Notes in Computer Science, Vol. 950, A. De Santis, ed., Springer-Verlag, 1995.
- Mihir Bellare, Phillip Rogaway: Random oracles are practical: a paradigm for designing efficient protocols; Proc. First Annual Conference on Computer and Communications Security, ACM, 1993.
- Mihir Bellare, Phillip Rogaway: Entity authentication and key distribution; Advances in Cryptology - CRYPTO '93, Lecture Notes in Computer Science, Vol. 773, D. Stinson, ed., Springer-Verlag, 1994.
- Don Beaver, Silvio Micali, Phillip Rogaway: The round complexity of secure protocols; Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, (STOC 90), 1990, 503-513.
Aviel D. Rubin et al.
- Michael K. Reiter, Aviel D. Rubin: Crowds: Anonymity for Web Transactions; ACM Transactions on Information and System Security, (April, 1998).
- Aviel D. Rubin: An Experience Teaching a Graduate Course in Cryptography; Cryptologia (April, 1997).
- Aviel D. Rubin: Independent One-Time Passwords; USENIX Journal of Computer Systems (February, 1996).
- Dahlia Malkhi, Michael K. Reiter, Aviel D. Rubin: Secure Execution of Java Applets using a Remote Playground; Proc. IEEE Symposium on Security and Privacy (May, 1998).
- Aviel D. Rubin, Dan Boneh, Kevin Fu: Revocation of Unread E-mail in an Untrusted Network; Second Australasian Conference on Information Security and Privacy (July, 1997).
- Fabian Monrose, Aviel D. Rubin: Authentication via Keystroke Dynamics; 4th ACM Conference on Computer and Communcations Security (April, 1997).
- David M. Martin, Siviramakrishnan Rajagopalan, Aviel D. Rubin: Blocking Java Applets at the Firewall; Proc. ISOC Symposium on Network and Distributed System Security (February, 1997).
- Victor Shoup, Aviel D. Rubin: Session Key Distribution Using Smart Cards; Proc. of Eurocrypt '96 (May, 1996).
- Aviel D. Rubin, Peter Honeyman: Formal methods for the analysis of authentication protocols ; CITI Technical Report 93-7 (October, 1993).
Bruce Schneier et al.
- B. Schneier: Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish); Fast Software Encryption, Cambridge Security Workshop Proceedings (December 1993), Springer-Verlag, 1994, pp. 191-204.
- B. Schneier: Blowfish--One Year Later; Dr. Dobb's Journal, September 1995.
- M. Blaze, B. Schneier: The MacGuffin Block Cipher Algorithm; Fast Software Encryption, Second International Workshop Proceedings (December 1994), Springer-Verlag, 1995, pp. 97-110.
- J. Kelsey, B. Schneier, C. Hall: An Authenticated Camera; 12th Annual Computer Security Applications Conference, ACM Press, December 1996, pp. 24-30.
- B. Schneier, J. Kelsey: A Peer-to-Peer Software Metering System; The Second USENIX Workshop on Electronic Commerce Proceedings, USENIX Press, November 1996, pp. 279-286.
- D. Wagner, B. Schneier: Analysis of the SSL 3.0 Protocol; The Second USENIX Workshop on Electronic Commerce Proceedings, USENIX Press, November 1996, pp. 29-40.
- B. Schneier, J. Kelsey, J. Walker: Distributed Proctoring; ESORICS 96 Proceedings, Springer-Verlag, September 1996, pp. 172-182.
- J. Kelsey, B. Schneier: Authenticating Outputs of Computer Software Using a Cryptographic Coprocessor; Proceedings 1996 CARDIS, September 1996, pp. 11-24.
- J. Kelsey, B. Schneier, D. Wagner: Key-Schedule Cryptanalysis of 3-WAY, IDEA, G-DES, RC4, SAFER, and Triple-DES; Advances in Cryptology--CRYPTO '96 Proceedings, Springer-Verlag, August 1996, pp. 237-251.
- B. Schneier, J. Kelsey: Automatic Event Stream Notarization Using Digital Signatures; Security Protocols, International Workshop April 1996 Proceedings, Springer-Verlag, 1997, pp. 155-169.
- B. Schneier, J. Kelsey: Unbalanced Feistel Networks and Block Cipher Design; Fast Software Encryption, Third International Workshop Proceedings (February 1996), Springer-Verlag, 1996, pp. 121-144.
- M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, M. Weiner: Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security; January 1996.
- B. Schneier, C. Hall: An Improved E-mail Security Protocol; 13th Annual Computer Security Applications Conference, ACM Press, December 1997, pp. 232-238.
- C. Hall, B. Schneier: Remote Electronic Gambling; 13th Annual Computer Security Applications Conference, ACM Press, December 1997, pp. 227-230.
- J. Kelsey, B. Schneier, 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.
- D. Wagner, B. Schneier, J. Kelsey: Cryptanalysis of the Cellular Message Encryption Algorithm; Advances in Cryptology--CRYPTO '97 Proceedings, Springer-Verlag, August 1997, pp. 526-537.
- N. Ferguson, B. Schneier: Cryptanalysis of Akelarre; Fourth Annual Workshop on Selected Areas in Cryptography, August 1997, pp. 201-212.
-
H. Abelson, R. Anderson, S.M. Bellovin, J. Benaloh, M. Blaze, W.
Diffie, J.Gilmore, P. G. Neumann, R.L. Rivest, J.I. Schiller, B.
Schneier: The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption; World Wide Web Journal, v.2, n.3, 1997, pp. 241-257.
- J. Kelsey, B. Schneier: Conditional Purchase Orders; 4th ACM Conference on Computer and Communications Security, ACM Press, April 1997, pp. 117-124.
- J. Kelsey, B. Schneier, D. Wagner: Protocol Interactions and the Chosen Protocol Attack; Security Protocols, International Workshop April 1996 Proceedings, Springer-Verlag, 1997, to appear.
- B. Schneier, 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. Schneier: Why Cryptography is Harder than it Looks; Information Security Bulletin, v. 2, n. 2, March 1997, pp. 31-36.
- B. Schneier, 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: Cryptography, Security, and the Future; Communications of the ACM, v. 40, n. 1, January 1997, p. 138.
- J. Kelsey, B. Schneier, C. Hall, D. Wagner: Secure Applications of Low-Entropy Keys; 1997 Information Security Workshop (ISW'97), Proceedings (September 1997), Springer-Verlag, 1998, pp. 121-134.
- B. Schneier, J. Kelsey: Cryptographic Support for Secure Logs on Untrusted Machines; The Seventh USENIX Security Symposium Proceedings, USENIX Press, January 1998, 53-62.
- D. Coppersmith, D. Wagner, B. Schneier, J. Kelsey: Cryptanalysis of TwoPrime; Fast Software Encryption, Fifth International Workshop Proceedings (March 1988), Springer-Verlag, 1998, 32-48.
- J. Kelsey, B. Schneier, D. Wagner, 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, J. Kelsey, B. Schneier, D. Wagner: Cryptanalysis of SPEED (Extended Abstract); Financial Cryptography '98, Springer-Verlag, 1998, to appear.
- J. Riordan, B. Schneier: Environmental Key Generation towards Clueless Agents; Mobile Agents and Security, G. Vigna, ed., Springer-Verlag, 1998, to appear.
- C. Hall, J. Kelsey, B. Schneier, D. Wagner: Building Pseudo-Random Functions from Pseudo-Random Permutations; Advances in Cryptology--CRYPTO '98 Proceedings, Springer-Verlag, August 98, to appear.
- J. Kelsey, B. Schneier, D. Wagner, C. Hall: Side Channel Cryptanalysis of Product Ciphers; ESORICS '98 Proceedings, Springer-Verlag, September 1998, to appear
- B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall: Twofish: A 128-Bit Block Cipher; Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, to appear.
Berry Schoenmakers et al.
- Berry Schoenmakers: A Simple Publicly Verifiable Secret Sharing Scheme and its Application to Electronic Voting ;
In Advances in Cryptology-CRYPTO'99, volume 1666 of Lecture Notes in
Computer Science, pages 148-164, Berlin, 1999. Springer-Verlag.
- Berry Schoenmakers: Basic Security of the eCash™ Payment System;
To appear in: 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.
- Ronald Cramer, Rosario Gennaro, Berry Schoenmakers: A Secure and Optimally Efficient Multi-Authority Election Scheme;
In Advances in Cryptology-EUROCRYPT'97, volume 1233 of Lecture Notes in
Computer Science, pages 103-118, Berlin, 1997. Springer-Verlag. Journal
version appears in European Transactions on Telecommunications 8
(September-October 1997) 481-490.
- Berry 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.
- Ronald Cramer, Matthew Franklin, Berry Schoenmakers, Moti Yung: Multi-Authority Secret-Ballot Elections with Linear Work;
In Advances in Cryptology-EUROCRYPT'96, volume 1070 of Lecture Notes in
Computer Science, pages 72-83, Berlin, 1996. Springer-Verlag.
- Berry Schoenmakers: An Efficient Electronic Payment System Withstanding Parallel Attacks; Report CS-R9522, Centrum voor Wiskunde en Informatica (CWI), March 1995.
- Joost-Pieter Katoen, Berry Schoenmakers: Systolic Arrays for the Recognition of Permutation-Invariant Segments; Science of Computer Programming 27 (1996) 119-137.
- Berry Schoenmakers: A New Algorithm for the Recognition of Series Parallel Graphs; Report CS-R9504, Centrum voor Wiskunde en Informatica (CWI), January 1995.
- Ronald Cramer, Ivan Damgaard, Berry Schoenmakers: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols;
In Advances in Cryptology-CRYPTO'94, volume 839 of Lecture Notes in
Computer Science, pages 174-187, Berlin, 1994. Springer-Verlag.
- Jean-Paul Boly, Antoon Bosselaers, Ronald Cramer, Rolf
Michelsen, Stig Mjolsnes, Frank Muller, Torben Pedersen, Birgit
Pfitzmann, Peter de Rooij, Berry Schoenmakers, Matthias Schunter, Luc
Vallee, Michael 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.
- Berry Schoenmakers: A Systematic Analysis of Splaying; Information Processing Letters 45 (1993) 41-50.
- Berry Schoenmakers: Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space;
In Mathematics of Program Construction-MPC'92, volume 669 of Lecture
Notes in Computer Science, pages 291-301, Berlin, 1993.
Springer-Verlag.
- Anne Kaldewaij, Berry Schoenmakers: The Derivation of a Tighter Bound for Top-Down Skew Heaps; Information Processing Letters 37 (1991) 265-271.
- Anne Kaldewaij, Berry Schoenmakers: Searching by Elimination; Science of Computer Programming 14 (1990) 243-254.
- Joost-Pieter Katoen, Berry Schoenmakers: Recognizing Perfect-Shuffles
Victor Shoup et al.
- R. Cramer, V. Shoup: Signature schemes based on the Strong RSA Assumption; Preprint, December, 1998.
- V. Shoup: Why chosen ciphertext security matters; IBM Research Report RZ 3076, November, 1998. This is an expository paper.
- V. Shoup: Efficient Computation of Minimal Polynomials in Algebraic Extension of Finite Fields, Preprint, November, 1998.
- V. Shoup, R. Cramer: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack; May 1998.
- N. Asokan, V. Shoup, 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.
- N. Asokan, V. Shoup, M. Waidner: Asynchronous Protocols for Optimistic Fair Exchange;
In Proceedings of the IEEE Symposium on Research in Security and
Privacy, Research in Security and Privacy, pages 86-99, Oakland, CA,
May 1998. IEEE Computer Society Press.
- V. Shoup, R. Gennaro: Securing threshold cryptosystems against chosen ciphertext attack; IBM Research Report RZ 2974, 1997. Extended abstract in Proc. Eurocrypt '98.
- V. Shoup, E. Kaltofen: Faster polynomial factorization over high algebraic extensions of finite fields; in Proc. 1997 International Symposium on Symbolic and Algebraic Computation.
- V. Shoup, R. Ostrovsky: Private information storage; in Proc. 29th ACM Symposium on Theory of Computation, pp. 294-303, 1997.
- 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.
- V. Shoup: On fast and provably secure message authentication based on universal hashing; in Proc. Crypto '96, pp. 313-328, 1996. This contains some corrections to the conference version.
- V. Shoup: On the security of a practical identification scheme, in Proc. Eurocrypt '96, pp. 344-353, 1996.
- V. Shoup, A. Rubin: Session-key distrubution using smart cards; in Proc. Eurocrypt '96, pp. 321-31, 1996.
- V. Shoup: A note on session-key distrubution using smart cards; manuscript, 1996. This contains some corrections and modifications to the previous paper.
- V. Shoup, E. Kaltofen: Subquadratic-time factorization of polynomials over finite fields; in Proc. 27th ACM Symposium on Theory of Computation, 1995; to appear, Mathematics of Computation, 1998.
- V. Shoup: A new polynomial factorization algorithm and its implementation; Journal of Symbolic Computation 20:363-397, 1995.
- V. Shoup, J. Buchmann: Constructing nonresidues in finite fields and the Extended Riemann Hypothesis;
Mathematics of Computation 65(215):1311-1326, 1996; extended abstract
in Proc. 23rd ACM Symposium on Theory of Computation, pp. 72-79, 1991.
- V. Shoup: Fast construction of irreducible polynomials over finite fields;
Journal of Symbolic Computation 17:371-391, 1994; extended abstract in
Proc. 4th Annual Symposium on Discrete Algorithms, pp. 484-492, 1993.
- V. Shoup, F. Lehmann, M. Mauerer, V. Mueller: Counting the number of points on elliptic curves of characteristic greater than three; in Proc. First Algorithmic Number Theory Symposium, pp. 60-70, 1994.
- V. Shoup, R. Peralta: Primality testing with fewer random bits; Computational Complexity 3:355-367, 1993.
- V. Shoup: Factoring polynomials over finite fields: asymptotic complexity vs. reality; in Proc. IMACS Symposium, Lille, France, 1993.
- V. Shoup, J. von zur Gathen: Computing Frobenius maps and factoring polynomials;
Computational Complexity 2:187-224, 1992; extended abstract in Proc.
24th ACM Symposium on Theory of Computing, pp. 97-105, 1992.
- V. Shoup: Searching for primitive roots in finite fields;
Mathematics of Computation 58:369-380, 1992; extended abstract in Proc.
22nd ACM Symposium on Theory of Computation, pp. 546-554, 1990.
- V. Shoup: Smoothness and factoring polynomials over finite fields; Information Processing Letters 39:39-42, 1991.
- V. Shoup: A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic; in Proc. 1991 International Symposium on Symbolic and Algebraic Computation, pp. 14-21, 1991.
- V. Shoup, R. Smolensky: Lower bounds for polynomial evaluation and interpolation problems;
Computational Complexity, 6:301-311, 1997; preliminary version in Proc.
31st Annual Symposium on Foundations of Computer Science, pp. 378-383,
1991.
- V. Shoup: On the deterministic complexity of factoring polynomials over finite fields; Information Processing Letters 33:261-267, 1990.
- V. Shoup, D. Beaver, J. Feigenbaum, R. Ostrovsky: Instance-hiding proof systems;
preprint, 1993. This paper subsumes "Hiding instances in zero-knowledge
proof systems," with D. Beaver and J. Feigenbaum, in Proc. Crypto '90,
pp. 309-321, 1990.
- V. Shoup, E. Bach: Factoring polynomials using fewer random bits; Journal of Symbolic Computation 9:229-239, 1990.
- V. Shoup: New algorithms for finding irreducible polynomials over finite fields;
Mathematics of Computation 54:435-447, 1990; extended abstract in Proc.
29th Annual Symposium on Foundations of Computer Science, pp. 283-290,
1988.
- V. Shoup: Removing Randomness from Computational Number Theory; Ph. D. Thesis, University of Wisconsin, 1989.
Doug Stinson et al.
- C. Blundo, L. Frota Mattos, D. R. Stinson: Multiple key distribution maintaining user anonymity via broadcast channels; J. Computer Security 3 (1994/95), 309-323.
- G. Ateniese, C. Blundo, A. De Santis, D. R. Stinson: Constructions and bounds for visual cryptography;
Lecture Notes in Computer Science 1099 (1996), 416-428 (23rd
International Colloquium on Automata, Languages and Programming).
- R. S. Rees, D. R. Stinson: Combinatorial characterizations of authentication codes II; Designs, Codes and Cryptography 7 (1996), 239-259.
- J. Bierbrauer, K. Gopalakrishnan, D. R. Stinson: Orthogonal arrays, resilient functions, error-correcting codes and linear programming bounds; SIAM J. Discrete Math 9 (1996), 424-452.
- M. Atici, S. S. Magliveras, D. R. Stinson, W.-D. Wei: Some recursive constructions for perfect hash families; Journal of Combinatorial Designs 4 (1996), 353-363.
- M. Atici, D.R. Stinson: Universal hashing and multiple authentication; Lecture Notes in Computer Science 1109 (1996), 16-30 (Advances in Cryptology - CRYPTO '96).
- K. Gopalakrishnan, D. R. Stinson: A short proof of the non-existence of certain cryptographic functions; J. Combin. Math. Combin. Comput. 20 (1996), 129-137.
- C. Blundo, L. Frota Mattos, D. R. Stinson:
Trade-offs Between Communication and Storage in Unconditionally Secure
Schemes for Broadcast Encryption and Interactive Key Distribution; Lecture Notes in Computer Science 1109 (1996), 387-400 (Advances in Cryptology - CRYPTO '96).
- G. Ateniese, C. Blundo, A. De Santis, D. R. Stinson: Visual cryptography for general access structures; Information and Computation 129 (1996), 86-106.
- K. Gopalakrishnan, D. R. Stinson: A simple analysis of the error probability of two-point based sampling; Information Processing Letters 60 (1996), 91-96.
- D. R. Stinson: On the connections between universal hashing, combinatorial designs and error-correcting codes; Congressus Numerantium 114 (1996), 7-27.
- C. Blundo, A. Giorgio Gaggia, D. R. Stinson: On the dealer's randomness required in secret sharing schemes;
Designs, Codes and Cryptography 11 (1997), 235-259. [Preliminary
version appeared in Lecture Notes in Computer Science 950 (1995), 35-46
(Advances in Cryptology - EUROCRYPT '94).]
- C. Blundo, D. R. Stinson: Anonymous secret sharing schemes; Discrete Applied Math 77 (1997), 13-28.
- D. R. Stinson: On some methods for unconditionally secure key distribution and broadcast encryption; Designs, Codes and Cryptography 12 (1997), 215-243.
- K. Kurosawa, T. Johansson, D. R. 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).
- J. Bierbrauer, K. Gopalakrishnan, D. R. Stinson: A note on the duality of linear programming bounds for orthogonal arrays and codes; Bulletin of the ICA 22 (1998), 17-24.
- C. Blundo, L. Frota Mattos, D. R. Stinson: Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution; To appear in Theoretical Computer Science.
- D. R. Stinson, R. Wei: Combinatorial properties and constructions of traceability schemes and frameproof codes; SIAM J. Discrete Math 11 (1998), 41-53.
- D. L. Kreher, D. R. Stinson, 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.
- C. Blundo, A. De Santis, D. R. Stinson: On the contrast in visual cryptography schemes; To appear in Journal of Cryptology.
- D. R. Stinson, Tran van Trung: Some new results on key distribution patterns and broadcast encryption; To appear in Designs, Codes and Cryptography.
- D. R. Stinson: Some results on nonlinear zigzag functions; To appear in J. Combin. Math. Combin. Comput.
- G. Ateniese, C. Blundo, A. De Santis, D. R. Stinson: Extended capabilities for visual cryptography; Submitted to Theoretical Computer Science.
- K. Kurosawa, K. Okada, H. Saido, D. R. Stinson: New combinatorial bounds for authentication codes and key predistribution schemes; To appear in Designs, Codes and Cryptography.
- W. J. Martin, D. R. Stinson: A generalized Rao bound for ordered orthogonal arrays and (t,m,s)-nets; Submitted to Canadian Mathematical Bulletin.
- W. J. Martin, D. R. Stinson: Association schemes for ordered orthogonal arrays and (T,M,S)-nets; Submitted to Canadian Journal of Mathematics.
- D. R. Stinson, R. Wei: An application of ramp schemes to broadcast encryption; Submitted to Information Processing Letters.
- D. R. Stinson, Tran van Trung, R. Wei: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures; Submitted to Journal of Statistical Planning and Inference.
- M. Atici, D. R. Stinson, R. Wei: A new practical algorithm for the construction of a perfect hash function; Submitted to Algorithmica.
- C. Blundo, P. D'Arco, A. De Santis, D. R. Stinson: Contrast optimal threshold visual cryptography schemes; Submitted to SIAM Journal on Discrete Mathematics.
- C. J. Colbourn, J. H. Dinitz, D. R. Stinson: Quorum systems constructed from combinatorial designs; Submitted to Information and Computation.
- D. R. Stinson, R. Wei: Key preassigned traceability schemes for broadcast encryption; Submitted to SAC '98.
Tsuyoshi Takagi et al.
Yiannis Tsiounis et al.
- Yiannis Tsiounis: Security proofs for practical encryption schemes;
invited presentation at Lucent Technologies, Bell Labs, April 17, 98.
For a technical view, refer to the paper published in PKC '98 on
ElGamal encryption.
- Yiannis Tsiounis: Fast A-Key distribution with OTASP;
presented in the January '97 AHAG meeting, January 8th, '98, New
Orleans, LA. The related paper has been accepted in the IEEE Symposium
of Security and Privacy
- Yiannis 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.
- Yiannis 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.
- Yiannis Tsiounis: Micropayments and anonymous e-cash; for the IEEE local (New England) chapter, February 13, 1997. Powerpoint 4.0 slides are also available.
- Yiannis Tsiounis: Efficient Electronic Cash: New Notions and Techniques; Ph.D. thesis.
- Yiannis Tsiounis, Yair Frankel, Agnes Chan: Easy come-easy go divisible cash; (updated version, GTE Tech report) Eurocrypt '98, Lecture Notes in Computer Science, Elsinki, Finland, May 31-June 4 '98. pp. 561-575.
- Yiannis Tsiounis, Yair Frankel, Moti Yung: Indirect Discourse Proofs: Achieving Fair Off-Line Electronic Cash; Asiacrypt '96, Lecture Notes in Computer Science 1163, pages 286-300, November 3-7, South Korea.
- Yiannis Tsiounis, Moti Yung: On the security of ElGamal-based encryption; To appear in 1998 International Workshop on Practice and Theory in Public Key Cryptography (PKC '98), February 5-6, Yokohama, Japan.
- Yiannis Tsiounis, Yair Frankel, Boaz 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.
- Yiannis Tsiounis, Yair Frankel, Chris Carroll: Efficient key distribution for slow computing devices: Achieving fast over-the-air activation for wireless systems; To appear in IEEE Symposium on Security and Privacy (S&P '98), May 3-6 '98, Oakland, CA.
- Yiannis Tsiounis, George Davida: Yair Frankel, Moti Yung: Anonymity Control in E-Cash Systems; Financial Cryptography '97, Anguilla, British West Indies, February 24-27.
- Yiannis Tsiounis, Agnes Chan, Yair Frankel, Phil MacKenzie: Misrepresentation of identities in e-cash schemes and how to prevent it; nkel, and . Asiacrypt '96, Lecture Notes in Computer Science 1163, pages 276-285, November 3-7, South Korea.
Gene Tsudik et al.
- Y. Amir, G. Ateniese, D. Hasse, Y. Kim, C. Nita-Rotaru, T. Schlossnagle, J. Schultz, J. Stanton, G. Tsudik: Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments ; IEEE ICDCS 2000, April 2000.
- G. Ateniese, O. Chevassut, D. Hasse, Y. Kim, G. Tsudik: The Design of a Group Key Agreement API ; DARPA DISCEX 2000, January 2000.
- M. Steiner, G. Tsudik, M. Waidner: Key Agreement in Dynamic Peer Groups; IEEE Transaction on Parallel and Distributed Systems. to appear.
- G. Ateniese, M. Steiner, G. Tsudik: New Multi-party Authentication Services and Key Agreement Protocols ; IEEE JSAC, May 2000.
- G. Ateniese, G. Tsudik: Some Open Issues and New Directions in Group Signatures ; inancial Cryptography'99, February 1999.
- G. Ateniese, G. Tsudik: Group Signatures a' la carte ; ACM Symposium on Discrete Algorithms, January 1999.
- G. Ateniese, M. Steiner, G. Tsudik: Authenticated Group Key Agreement and Friends; ACM Conference on Computer and Communications Security, November 1998.
- M. Steiner, G. Tsudik, M. Waidner: CLIQUES: A New Approach to Group Key Agreement ; IEEE International Conference on Distributed Computing Systems (ICDCS'98), May 1998.
- M. Steiner, G. Tsudik, M. Waidner: Diffie-Hellman Key Distribution Extended to Groups ; 1996 ACM Conference on Computer and Communications Security, March 1996.
Serge Vaudenay et al.
David Wagner et al.
- Chris Hall, John Kelsey, Vincent Rijmen, Bruce Schneier, David Wagner: Cryptanalysis of SPEED; To appear in SAC'98.
- Chris Hall, John Kelsey, Bruce Schneier, David Wagner: Cryptanalysis of SPEED (extended abstract); To appear in Financial Cryptography '98. [pdf]
- Ian Goldberg, David Wagner: Chapter 10 of Architectural considerations for cryptanalytic hardware; Cracking DES: Secrets of Encryption Research, Wiretap Politics & Chip Design, O'Reilly, July 1998.(Initially submitted as a term paper for CS 252, May 1996.) [html,more info]
- David Wagner, L. Simpson, E. Dawson, John Kelsey, W. Millan, Bruce Schneier: Cryptanalysis of ORYX; To appear in SAC'98. [description of ORYX]
- Bruce Schneier, John Kelsey, Doug Whiting, David Wagner, Chris Hall, Niels Ferguson: Twofish: a 128-bit block cipher; Submission to the AES competition. [pdf]
- Chris Hall, David Wagner, John Kelsey, Bruce Schneier: Building PRFs from PRPs; To appear at CRYPTO '98. [published version, full version]
- John Kelsey, Bruce Schneier, David Wagner, Chris Hall: Side Channel Cryptanalysis of Product Ciphers; To appear in ESORICS 1998 in Sept 1998.
- Don Coppersmith, David Wagner, Bruce Schneier, John Kelsey: Cryptanalysis of TWOPRIME; Fast Software Encryption 1998. [slides]
- John Kelsey, Bruce Schneier, David Wagner, Chris Hall: Cryptanalytic Attacks on Pseudorandom Number Generators; Fast Software Encryption 1998.
- David Wagner: Differential Cryptanalysis of KHF; Fast Software Encryption 1998. [slides]
- David Wagner: Cryptanalysis of some recently-proposed multiple modes of operation; Fast Software Encryption 1998. [slides]
- John Kelsey, Bruce Schneier, David Wagner: Secure Applications of Low-Entropy Keys; 1997 Information Security Workshop.
- John Kelsey, Bruce Schneier, David Wagner: Related-Key Cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA; 1997 International Conference on Information and Communications Security, Beijing.
- John Kelsey, Bruce Schneier, David Wagner: Protocol Interactions and the Chosen Protocol Attack; 1997 Security Protocols Workshop, Cambridge.
- David Wagner, Bruce Schneier, John Kelsey: Cryptanalysis of the Cellular Message Encryption Algorithm; CRYPTO '97. [html version, slides]
- Ian Goldberg, David Wagner: TAZ Servers and the Rewebber Network: Enabling Anonymous Publishing on the World Wide Web; Published in the First Monday electronic journal, vol 3 no 4. [published version, html version, slides]
- David Oppenheimer, David Wagner, Michele Crabb: System Security: A Management Perspective; Booklet from the SAGE Short Topics in System Administration Series.
- Ian Goldberg, David Wagner, Eric A. Brewer: Privacy-enhancing technologies for the Internet. IEEE COMPCON '97, February 1997. [html version, slides]
- David Wagner, Bruce Schneier: Analysis of the SSL 3.0 protocol; (revised version). 2nd USENIX Workshop on Electronic Commerce, November 1996. [slides]
- Ian Goldberg, David Wagner, Randi Thomas, Eric A. Brewer: A secure environment for untrusted helper applications: confining the wily hacker; 1996 USENIX Security Symposium.[source availability] [other formats: DVI]
- John Kelsey, Bruce Schneier, David Wagner: Key-schedule cryptanalysis of IDEA, G-DES, GOST, SAFER, and triple-DES; CRYPTO '96.
- Ronald Rivest, Adi Shamir, David Wagner: Time-lock puzzles and timed-release Crypto. Unpublished manuscript, February 1996.
- Ian Goldberg, David Wagner: Randomness and the Netscape Browser; Dr. Dobb's Journal, January 1996. [resources, local copy of the article]
- David Wagner, Steven M. Bellovin: A ``bump in the stack'' encryptor for MS-DOS systems; Proceedings of the 1996 ISOC Symposium on Network & Distributed System Security. [slides]
- David Wagner: The security of MacGuffin; June 1995. Draft submitted to Cryptologia. [more info]
- David Wagner: The security of MacGuffin. Princeton University senior thesis, April 1995. [more info]
- David Wagner, Steven M. Bellovin: A programmable plaintext recognizer. Unpublished manuscript, September 1994.
- Also available: Some of Davids posts on cryptography and related issues.
Michael Waidner et al.
Adam Young et al.
Yuliang Zheng et al.
- Y. Zheng, T. Matsumoto, H. Imai: Several theorems on probabilistic cryptosystems;
Transactions of the Institute of Electronics, Information and
Communication Engineers of Japan, Vol. E72, No. 7, pp. 819-827, July
1989.
- Y. Zheng, T. Matsumoto, H. Imai: Connections among several versions of one-way hash functions;
Special Issue on Cryptography and Information Security, Transactions of
the Institute of Electronics, Information and Communication Engineers
of Japan, Vol. E73, No. 7, pp. 1092-1099, July 1990.
- Y. Zheng, T. Matsumoto, H. Imai: Proving identity in three moves; IEICE Transactions, pp.3602-3606, Vol. E 74, No. 11, November 1991.
- Y. Zheng, J. Seberry: Immunizing public key cryptosystems against chosen ciphertext attacks;
the Special Issue on Secure Communications, IEEE Journal on Selected
Areas in Communications, Vol. 11, No. 5, pp. 715-724, June 1993.
- Y. Zheng: Improved public key cryptosystems secure against chosen ciphertext attacks; Preprint No.94-1, Department of Computer Science, University of Wollongong , 24 January 1994.
- Y. Zheng, T. Hardjono, 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.
- Y. Zheng, T. Hardjono, J. Seberry: Reusing shares in secret sharing schemes; The Computer Journal, Vol. 37, No. 3, pp. 199-205, 1994.
- J. Seberry, X. M. Zhang, Y. Zheng: Nonlinearity and propagation characteristics of balanced Boolean functions; Information and Computation, Vol. 119, No. 1, pp. 1-13, 1995.
- J. Seberry, X. M. Zhang, Y. Zheng: Improving the strict avalanche characteristics of cryptographic functions; Information Processing Letters, Vol.50, pp.37-41, 1994.
- J. Seberry, X. M. Zhang, Y. Zheng: Cryptographic Boolean functions via group Hadamard matrices; in the Special Issue: the Hadamard Centenary Conference, the Australasian Journal of Combinatorics, Vol.10, pp.131-145, 1994.
- Y. Zheng: On key agreement protocols based on tamper-proof hardware; Information Processing Letters, Vol.53, pp.49-54, 1995.
- X. M. Zhang, Y. Zheng: GAC -- the criterion for global avalanche characteristics of cryptographic functions; Journal of Universal Computer Science, Vol. 1, No. 5, pp. 316-333, 1995.
- J. Seberry, X. M. Zhang, Y. Zheng: The Relationship Between Propagation Characteristics and Nonlinearity of Cryptographic Functions; Journal of Universal Computer Science, Vol. 1, No. 2, pp. 136-150, 1995.
- Y. Mu, J. Seberry, Y. Zheng: Shared cryptographic bits via quantized quadrature phase amplitudes of light; Optics Communications, Vol. 123, pp. 344-352, 1996.
- X. M. Zhang, Y. Zheng: Characterizing the structures of cryptographic functions satisfying the propagation criterion for almost all vectors; Design, Codes and Cryptography, Vol. 7, No. 1/2, pp. 111-134, 1996.
- X. M. Zhang, Y. Zheng: On the Difficulty of Constructing Cryptographically Strong Substitution Boxes; Journal of Universal Computer Science, Vol. 2, No. 3, pp. 147-162, 1996.
- K. Sakurai, 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.
- X. M. Zhang, Y. Zheng: Cryptographically Resilient Functions; IEEE Transactions on Information Theory, Vol.43, No.5, pp.1740-1747, September 1997
- Y. Zheng, T. Matsumoto, H. Imai: One-way hash function based on weakened assumption; 1990 National Spring Conference Record, IEICE of Japan, p. 1-289, Tokyo, March 1990.
- Y. Zheng, T. Matsumoto, H. Imai: Impossibility and optimality results on constructing pseudorandom permutations; Advances in Cryptology -- EuroCrypt'89, Lecture Notes in Computer Science, Vol. 434, pp. 412-422, Springer-Verlag, 1990.
- Y. Zheng, T. Matsumoto, H. Imai: On the construction of block ciphers provably secure and not relying on any unproven hypotheses; (See also helpful graphics.) Advances in Cryptology -- Crypto'89, Lecture Notes in Computer Science, Vol. 435, pp. 461-480, Springer-Verlag, 1990.
- Y. Zheng, T. Matsumoto, H. Imai: Provably secure one-way hash functions; (invited talk), Presented at 1990 Workshop on Cryptography and Information Security, Hiroshima, August 1990.
- Y. Zheng, T. Matsumoto, H. Imai: Structural properties of one-way hash functions; Advances in Cryptology -- Crypto'90, Lecture Notes in Computer Science, Vol. 537, pp. 285-302, Springer-Verlag, 1991.
- Y. Zheng, T. Matsumoto, H. Imai: Duality between two cryptographic primitives;
Proceedings of the 8-th International Conference on Applied Algebra,
Algebraic Algorithms and Error Correcting Codes (AAECC-8); Lecture
Notes in Computer Science, Vol. 508, pp.379-390, Springer-Verlag, 1991.
- Y. Zheng, T. Hardjono, 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.
- Y. Zheng, J. Seberry: Practical approaches to attaining security against adaptively chosen ciphertext attacks; Advances in Cryptology -- Crypto'92, Lecture Notes in Computer Science, Vol. 740, pp.292-304, Springer-Verlag, 1993.
- Y. Zheng, J. Pieprzyk, J. Seberry: HAVAL -- a one-way hashing algorithm with variable length of output; Advances in Cryptology -- AusCrypt'92, Lecture Notes in Computer Science, Vol. 718, pp. 83-104, Springer-Verlag, Berlin, 1993.
- T. Hardjono, 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.
- J. Seberry, X. M. Zhang, Y. Zheng: Systematic generation of cryptographically robust S-boxes;
Proceedings of the First ACM Conference on Computer and Communications
Security, pp.171-182, The Association for Computing Machinery, New
York, November 1993.
- J. Seberry, X. M. Zhang, Y. Zheng: On constructions and nonlinearity of correlation immune functions;
Advances in Cryptology -- EuroCrypt'93, Lecture Notes in Computer
Science, Vol. 765, pp. 181-199, Springer-Verlag, Berlin, 1994.
- J. Seberry, X. M. Zhang, Y. Zheng: Nonlinearly balanced Boolean functions and their propagation characteristics; Advances in Cryptology -- Crypto'93, Lecture Notes in Computer Science, Vol. 773, pp. 49-60, Springer-Verlag, Berlin, 1994.
- Y. Zheng: How to break and repair Leighton and Micali's key agreement protocol; EuroCrypt'94, Italy, May 1994.
- J. Seberry, X. M. Zhang, Y. Zheng: Relationships among nonlinearity criteria; Advances in Cryptology -- EuroCrypt'95, Lecture Notes in Computer Science, Vol. 950, pp. 376-388, Springer-Verlag, 1995
- J. Seberry, X. M. Zhang, Y. Zheng: Pitfalls in designing substitution boxes; Advances in Cryptology -- Crypto'94, Lecture Notes in Computer Science, Vol. 839, pp. 383-396, Springer-Verlag, Berlin, 1994.
- J. Seberry, X. M. Zhang, Y. Zheng: Structures of cryptographic functions with strong avalanche characteristics; Advances in Cryptology -- AsiaCrypt'94, Lecture Notes in Computer Science, Vol.917, pp.119-132, Springer-Verlag, 1995.
- Y. Zheng: STRANDOM - a cryptographically strong pseudo-random number generator based on HAVAL; Presented at the Rump Session at AsiaCrypt'94, December 1994.
- C. Duraiappan, Y. Zheng: Enhancing security in GSM; 1994 International Computer Symposium, December 1994, Taiwan.
- X. M. Zhang, Y. Zheng: On Nonlinear Resilient Functions; Advances in Cryptology -- EuroCrypt'95, Lecture Notes in Computer Science, Vol. 921, pp. 274-288, Springer-Verlag, 1995. (final version)
- J. Seberry, X. M. Zhang, Y. Zheng: Relating Nonlinearity to Propagation Characteristics; Proceedings of 1995 Cryptography Policy and Algorithms Conference, pp.283-297, Brisbane, July 1995.
- X. M. Zhang, Y. Zheng: Auto-Correlation and New Bounds on the Nonlinearity of Cryptographic Functions; Advances in Cryptology -- EuroCrypt'96, Lecture Notes in Computer Science, Vol. 1070, pp. 294-306, Springer-Verlag, 1996.
- Y. Zheng: An Authentication and Security Protocol for Mobile Computing;
Mobile Communications - Technology, Tools, Applications, Authentication
and Security (Proceedings of IFIP World Conference on Mobile
Communications), Edited by J. L. Encarnacao and J. M. Rabaey,
pp.249-257, Chapman & Hall, 2-6 September 1996, Canberra,
Australia.
- X. M. Zhang, Y. Zheng: Difference Distribution Table of a Regular Substitution Box; Proceedings of the Third Annual Workshop on Selected Areas in Cryptography (SAC'96), pp. 57-60, August 1996.
- Y. Zheng, T. Matsumoto: Breaking Smart Card Implementations of ElGamal Signature and Its Variants; Presented at the Rump Session of Asiacrypt96, 5 November 1996. (here are the slidesin PowerPoint format, 98kb.)
- Y. Mu, Y. Zheng: An Alternative Model of Quantum Key Agreement via Beam-Splitter Based Photon Coupling;
Information Security and Privacy --- ACISP'96, Lecture Notes in
Computer Science, Vol. 1172, pp. 320-331, Springer-Verlag, 1996.
- X. M. Zhang, 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.
- X. M. Zhang, Y. Zheng, 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.
- X. M. Zhang, Y. Zheng, 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.
- 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.
- 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: 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)
- K. Matsuura, Y. Zheng, H. Imai: Compact and Flexible Resolution of CBT Multicast Key-Distribution;
Proceedings of the Second International Conference on Worldwide
Computing and Its Applications (WWCA'98), Lecture Notes in Computer
Science, Vol. 1368, pp. 190--205, Springer-Verlag, 1998.
- Y. Zheng, H. Imai: Compact and Unforgeable Key Establishment over an ATM Network; Proceedings of IEEE INFOCOM'98 , 29/3-3/4 1998, San Francisco. (Full paper available on request.)
- Y. Zheng, H. Imai: Efficient Signcryption Schemes On Elliptic Curves;
Proceedings of the IFIP 14th International Information Security
Conference (IFIP/SEC'98), Chapman & Hall, September 1998, Vienna,
Austria. (to appear)
- M. Mihaljevic, Y. Zheng, H. Imai: A Fast Cryptographic Hash Function Based on Linear Cellular Automata over GF(q);
Proceedings of the IFIP 14th International Information Security
Conference (IFIP/SEC'98), Chapman & Hall, September 1998, Vienna,
Austria. (to appear)
- X. M. Zhang, Y. Zheng, H. Imai: Connections between Nonlinearity and Restrictions, Terms and Hypergraphs of Boolean Functions; Proceedings of 1998 IEEE International Symposium on Information Theory, IEEE Press, August 1998, MIT, Boston. (to appear)
- G. Hanaoka, Y. Zheng, 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.
- M. Mihaljevic, Y. Zheng, H. Imai: A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation;
Public Key Cryptography --- Proceedings of PKC'98, Lecture Notes in
Computer Science, Vol. 1431, pp. xxx-xxx, Springer-Verlag, 1998.
[ Home |
Products |
Security News |
Security Links |
Download |
Resources |
Press |
Employment |
Contact |
About ]
CryptoSoft GmbH
Fon/Fax: +49 30 7468 2840
Updated: Sun, 10 Feb 2002 11:55:39 GMT
Feedback: webmaster@cryptosoft.com
Copyright ©1995-2001 Cryptosoft GmbH
All Rights Reserved