Crypto Bibliography

R. Fagin, M. Naor, and P. Winkler, Comparing Inforamtion Without Leaking It; Communications of the ACM, vol 39, May 1996, pp. 77-85.

H. Federrath, A. Jerichow, A. Pfitzmann, and B. Pfitzmann, Mehrseitig sichere Schlüsselerzeugung; Proc. Arbeitskonferenz Trust Center 95, DuD Fachbeiträge, Vieweg, Wiesbaden 1995, 117-131. [.ps.gz]

R. Canetti, U. Feige, O. Goldreich, and M. Naor, Adaptively Secure Multi-party Computation; TR-682, LCS/MIT, 1996. [.ps]

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

D. Beaver, J. Feigenbaum, and V. Shoup, Hiding Instances in Zero-Knowledge Proof Systems (extended abstract), in Advances in Cryptology - Crypto '90, Lecture Notes in Computer Science, vol. 537, Springer, Berlin, 1991, pp. 326-338. [.pdf]

M. Blaze, J. Feigenbaum, and J. Lacy, Decentralized Trust Management. IEEE Conference on Security and Privacy, Oakland, CA, May 1996. [.ps]

J. Feigenbaum and L. Fortnow, Random-Self-Reducibility of Complete Sets, SIAM Journal on Computing, 22 (1993), pp. 994-1005. Extended Abstract in Proceedings of the 1991 IEEE Conference on Structure in Complexity Theory. [.ps]

J. Feigenbaum, Overview of the AT&T Labs Trust-Management Project: Position Paper, in Proceedings of the 1998 Cambridge University Security Protocols International Workshop. [.ps]

J. Feigenbaum, L. Fortnow, S. Laplante, and A. Naik, On Coherence, Random-Self-Reducibility, and Self-Correction, 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.")

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

A. Condon, J. Feigenbaum, C. Lund, and 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. [.ps]

M. Blaze, J. Feigenbaum, and M. Strauss, Compliance Checking in the PolicyMaker Trust-Management System, in Proceedings of the 2nd Financial Crypto Conference, Lecture Notes in Computer Science, vol. 1465, Springer, Berlin, 1998. [.pdf] [.ps]

J. Feigenbaum, Towards an Infrastructure for Authorization: Position Paper, to be presented at the 1998 USENIX Ecommerce Conference. [.ps]

J. Feigenbaum, Locally Random Reductions in Interactive Complexity Theory, in Advances in Computational Complexity Theory, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 13, American Mathematical Society, Providence, 1993, pp. 73-98.. [.ps]

M. Blaze, J. Feigenbaum, J. Ioannidis, and A. Keromytis, The Role of Trust Management in Distributed Systems Security, Secure Internet Programming: Security Issues for Mobile and Distributed Objects, ed. Vitek and Jensen, Springer-Verlag, 1999. [.pdf] [.ps]

A. Condon, J. Feigenbaum, C. Lund, and 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. [.ps.gz]

M. Blaze, J. Feigenbaum, and F. Leighton, Master-Key Cryptosytems. Abstract presented at Crypto '95 (rump session), Santa Barbara, CA, August 1995. [.ps]

M. Blaze, J. Feigenbaum, and M. Naor, A Formal Treatment of Remotely-Keyed Encryption; Eurocrypt 98.

M. Blaze, J. Feigenbaum, and J. Lacy, Managing Trust in Medical Information Systems, AT&T Technical Report 96.14. [.ps]

D. Beaver, J. Feigenbaum, R. Ostrovsky, and V. Shoup, Instance-Hiding Proof Systems; submitted for journal publication. Available as DIMACS Technical Report 93-65, Rutgers University, Piscataway, 1993. [.ps.Z]

J. Feigenbaum and 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," pp. 48-55. [.ps]

J. Feigenbaum, L. Fortnow, C. Lund, and D. Spielman, The Power of Adaptiveness and Additional Queries in Random-Self-Reductions, Computational Complexity, 4 (1994), pp. 158-174. Extended Abstract in Proceedings of the 1992 IEEE Conference on Structure in Complexity Theory.

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

M. Blaze, J. Feigenbaum, and M. Naor, A Formal Treatment of Remotely Keyed Encryption (Extended Abstract), in Advances in Cryptology - Eurocrypt '98, Lecture Notes in Computer Science, vol. 1403, Springer, Berlin, 1998, pp. 251-265. [.pdf] [.ps]

M. Blaze, J. Feigenbaum, J. Ioannidis, and A. Keromytis, The KeyNote Trust Management System, Version 2. RFC-2704. IETF, September 1999. [.txt]

D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, Security with Low Communication Overhead (extended abstract), Advances in Cryptology - Crypto '90 Proceedings, Springer-Verlag, 1991, 62-76. [.pdf]

M. Abadi and J. Feigenbaum, Secure Circuit Evaluation: A Protocol Based on Hiding Information from an Oracle Journal of Cryptology 2, 1 (May 1990), 1-12. [.ps]

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

M. Abadi, J. Feigenbaum, and J. Kilian, On Hiding Information from an Oracle Journal of Computer and System Sciences 39, 1 (August 1989), 21-50. [.ps]

R. Beigel and J. Feigenbaum, On Being Incoherent Without Being Very Hard, Computational Complexity, 2 (1992), pp. 1-17.

J. Feigenbaum, D. Koller, and 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.

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,'' 1998, pp. 20-24.. [.ps]

J. Feigenbaum, M. Liberman, and R. Wright, Cryptographic Protection of Databases and Software, in ``Distributed Computing and Cryptography,'' DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, American Mathematical Society, Providence, 1991, pp. 161-172. [.ps]

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

M. Blaze, J. Feigenbaum, and A. Keromytis, KeyNote: Trust Management for Public-Key Infrastructures (Position Paper), in Proceedings of the 1998 Cambridge University Security Protocols International Workshop, Springer, Berlin, to appear. [.ps]

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

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

N. Ferguson, Single Term Off-Line Coins, Technical report CS-R9318, CWI, Amsterdam, 1993.

N. Ferguson, Single Term Off-Line Coins, Technical report CS-R9318, CWI, Amsterdam, 1993. [.pdf]

E. Biham, A. Biryukov, N. Ferguson, L. Knudsen, B. Schneier, and A. Shamir, Cryptanalysis of Magenta, distributed at the first AES conference, August 20, 1998. [.ps.gz]

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, and N. Ferguson, Performance Comparison of the AES Submissions, Proc. Second AES Candidate Conference, NIST, March 1999, pp. 15-34.

N. Ferguson, D. Whiting, B. Schneier, J. Kelsey, S. Lucks, and T. Kohno, Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive, Proceedings of Fast Software Encryption 2003, to appear.

N. Ferguson, Single Term Off-Line Coins, In Advances in Cryptology-EUROCRYPT '93, Lecture Notes in Computer Science, Springer Verlag, 1993.

N. Ferguson, J. Kelsey, B. Schneier, and D. Whiting, A Twofish Retreat: Related-Key Attacks Against Reduced-Round Twofish, Twofish Technical Report #6, February 14, 2000.

N. Ferguson, Extensions of Single-Term Coins, In Advances in Cryptology-CRYPTO '93, Lecture Notes in Computer Science no. 773, pp 292-301, Springer Verlag, 1993.

N. Ferguson and B. Schneier, A Cryptographic Evaluation of IPsec.

N. Ferguson, J. Kelsey, B. Schneier, M. Stay, D. Wagner, and D. WHiting, Improved Cryptanalysis of Rijndael, Proceedings of the Seventh Fast Software Encryption Workshop, Springer-Verlag, 2001, pp. 213-230.

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

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

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

J. Kelsey, B. Schneier, and N. Ferguson, and Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator, Sixth Annual Workshop on Selected Areas in Cryptography (SAC 99), Springer Verlag, 2000, pp. 13-33.

E. Biham, A. Biryukov, N. Ferguson, L. Knudsen, B. Schneier, and A. Shamir, Cryptanalysis of Magenta, Second AES Candidate Conference, April 1999.

N. Ferguson, Upper Bounds on Differential Characteristics in Twofish.

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

D. Wagner, N. Ferguson, and B. Schneier, Cryptanalysis of FROG, Second AES Candidate Conference, April 1999.

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

N. Ferguson, B. Schneier, and D. Wagner, Security Weaknesses in Maurer-Like Randomized Stream Ciphers, Fifth Australasian Conference on Information Security and Privacy (ACISP 2000), Springer-Verlag, 2000, pp. 234-241.

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

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

N. Courtois, M. Finiasz, and N. Sendrier, How to achieve a McEliece-based Digital Signature Scheme, Asiacrypt 2001. Preprint published as Inria rapport de recherche 4118, February 2001.

M. Fischlin, Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions, 9th International Conference on Algorithmic Learning Theory - ALT'98, Lecture Notes in Artificial Intelligence/Computer Science, Vol.1501, Springer-Verlag, pp.72-84, 1998.

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

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

M. Fischlin, Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications. Preliminary version appeared in Advances in Cryptology - Eurocrypt '99, Lecture Notes in Computer Science, Vol.1592, Springer-Verlag, pp.429-444, 1999.

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

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

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

P. Flajolet and A. Odlyzko, Random mapping statistics, P. Flajolet and A. Odlyzko, Advances in Cryptology - EUROCRYPT '89, J.-J. Quisquater and J. Vandewalle (eds.), Springer Verlag, Lecture Notes in Computer Science #434 (1990), pp. 329-354. [.pdf] [.ps]

S. Foley, L. Gong, and X. Qian, A Security Model of Dynamic Labeling Providing a Tiered Approach to Verification, Proceedings of the IEEE Symposium on Security and Privacy, Oakland, California, May 1996, pp.142--153. [.ps.gz]

J. Feigenbaum and L. Fortnow, Random-Self-Reducibility of Complete Sets, SIAM Journal on Computing, 22 (1993), pp. 994-1005. Extended Abstract in Proceedings of the 1991 IEEE Conference on Structure in Complexity Theory. [.ps]

J. Feigenbaum, L. Fortnow, C. Lund, and D. Spielman, The Power of Adaptiveness and Additional Queries in Random-Self-Reductions, Computational Complexity, 4 (1994), pp. 158-174. Extended Abstract in Proceedings of the 1992 IEEE Conference on Structure in Complexity Theory.

J. Feigenbaum, L. Fortnow, S. Laplante, and A. Naik, On Coherence, Random-Self-Reducibility, and Self-Correction, 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.")

M. Abadi, C. Fournet, and G. Gonthier, Secure Communications Processing for Distributed Languages, Proceedings of the 1999 IEEE Symposium on Security and Privacy (May 1999), 74-88. [.ps]

M. Abadi, C. Fournet, and G. Gonthier, Secure Implementation of Channel Abstractions, Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (June 1998), 105-116. [.ps]

B. Fox, B. LaMacchia, Certificate Revocation: Mechanics and Meaning, Advances in Cryptology: Proceedings of Financial Cryptography '98, R. Hirschfeld, ed., Lecture Notes in Computer Science 1465, Springer-Verlag, NY (1998).

B. Fox and B. LaMacchia, Online Certificate Status Checking in Financial Transactions: The Case for Re-issuance, Advances in Cryptology: Proceedings of Financial Cryptography '99, M. Franklin, ed., Lecture Notes in Computer Science 1648, Springer-Verlag, NY (1999).

B. Fox and B. LaMacchia, Cooperative Security: A Model for the New Enterprise, Proceedings of the Seventh IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE '98), Stanford, CA, June 1998, 314-319.

D. Fox, and C. Ruland, 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.

D. Fox and B. 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. [.ps.gz]

D. Fox, Zeitabhängiges Key Escrowing; In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 232-245.

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

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

D. Fox and A. Röhm, 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.

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

D. Fox and B. Pfitzmann, 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.

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

A. Ort, R. Aßmann, G. Bleumer, M. Böttger, D. Fox, A. Pfitzmann, B. Pfitzmann, and M. Waidner, Schutz in verteilten Systemen durch Kryptologie - Ein Praktikum im Informatik-Hauptstudium; Datenschutz und Datensicherung DuD 16/11 (1992) 571-579. [.ps.gz]

D. Fox and M. Müller, 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.

D. Fox and M. Böttger, 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.

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

D. Fox and 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.

Y. Tsiounis, Y. Frankel, and C. Carroll, Efficient key distribution for slow computing devices: Achieving fast over-the-air activation for wireless systems, IEEE Symposium on Security and Privacy (S&P '98), May 3-6 '98, Oakland, CA.

Y. Frankel and M. Naor, Codes for Interactive Authentication; Crypto 93 and submitted by invitation to the Journal of Cryptology. [.ps]

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

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

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

Y. Tsiounis, Y. Frankel, and M. 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.

Y. Tsiounis, Y. Frankel, and A. 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.

Y. Frankel, E. Brickell, and D. Kravitz, Trustee-traceable Electronic Cash and the Making of Anonymous Change; 1995 Symposium on Discrete Algorithms [.ps]

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

Y. Frankel and M. Yung, Witness-based Cryptographic Program Checking; 1996 Symposium on the Theory of Computation [.ps]

Y. Frankel, P. MacKenzie, and M. Yung, Proactive RSA [.ps]

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

M. Abdalla, W. Cirne, L. Franklin, A. Sterrett, and K. Marzullo, Chimichanga: A Fault-tolerant Asynchronous Communication Infrastructure for Mobile Agents, March 1998. [.pdf] [.ps.gz]

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

M. Franklin and M. Yung, The blinding of weak signatures, Advances in Cryptology -- Eurocrypt '94 Proceedings. [.ps]

M. Franklin and M. Yung, Varieties of secure distributed computing, Proc. Sequences II, Methods in Communications, Security and Computer Science, 1991. [.ps]

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

M. Franklin and R. Wright, Secure communication in minimal connectivity models, Advances in Cryptology -- Proceedings Eurocrypt '98. [.ps]

D. Boneh and M. Franklin, An efficient public key traitor tracing scheme, Crypto '99.

D. Boneh and M. Franklin, Anonymous authentication with subset queries, 6th ACM Conference on Computer and Communications Security, 1999.

M. Franklin, R. Cramer, B. Schoenmakers, and M. Yung, Multi-authority secret ballot elections with linear work, Advances in Cryptology -- Eurocrypt '96 Proceedings. [.ps]

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

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

M. Franklin and M. Yung, Privacy from partial broadcast, Proc. 27th Annual ACM Symposium on Theory of Computing (STOC 1995). [.ps]

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

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

M. Franklin and M. Yung, Secure and efficient off-line digital money, Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP 1993). [.ps]

M. Franklin and M. Yung, The blinding of weak signatures (Extended Abstract), Advances in Cryptology -- Eurocrypt '94 Proceedings, 1994. [.ps]

D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter, Low exponent RSA with related messages, Advances in Cryptology -- Eurocrypt '96 Proceedings, 1996. Earlier version in IBM Research Report RC 20318, December 27, 1995. [.ps]

A. Beimel and M. Franklin, Reliable communication over partially authenticated networks, Theoretical Computer Science, (220)1:185--210, 1999. Preliminary version in WDAG '97, volume 1320 of LNCS, pages 245-259, Springer, 1997. [.ps]

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

M. Franklin, Z. Galil, and M. Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS 1993). [.ps]

M. Franklin and M. Yung, Varieties of secure distributed computing, Proc. Sequences II, Methods in Communications, Security and Computer Science, 1991. [.ps]

M. Franklin, D. Coppersmith, J. Patarin, and M. Reiter, Low exponent RSA with related messages, Advances in Cryptology -- Eurocrypt '96 Proceedings. [.ps]

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

M. Franklin and M. Reiter, The design and implementation of a secure auction service, IEEE Transactions on Software Engineering, Vol. 22, No. 5, May 1996, pp. 302-312. [.ps]

M. Franklin and M. Yung, Secure Hypergraphs: Privacy from partial broadcast, SIAM Journal on Discrete Mathematics. Earlier version in Proc. 27th Annual ACM Symposium on Theory of Computing (STOC 1995). [.ps]

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

R. Friedman, E. Biham, A. Itzkovitz, and A. Schuster, Symphony: Managing Virtual Servers in the Global Village Technical Reports of the Computer Science Department in the Technion, 0939. [.ps.gz]

C. Blundo, L. Frota Mattos, and D. R. Stinson, Multiple key distribution maintaining user anonymity via broadcast channels; J. Computer Security 3 (1994/95), 309-323. [.ps]

C. Blundo, L. Frota Mattos, and D. Stinson, Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution, Theoretical Computer Science. [.ps]

C. Blundo, L. Frota Mattos, and D. 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). [.ps]

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

H. Fujii, W. Kachen, and K. Kurosawa, Combinatorial bounds and design of broadcast authentication, IEICE Trans., Vol.E79-A, No. 4, 1996, pp. 502-506. [.ps]

M. Furer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos, On Completeness and Soundness in Interactive Proof Systems, 1989. [.ps]

A. Blum, M. Furst, M. Kearns, and R. Lipton, Cryptographic Primitives Based on Hard Learning Problems, Advances in Cryptology -- CRYPTO 93, Lecture Notes in Computer Science #773, pages 278-291, Springer-Verlag, 1994. [.ps.Z]

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