Crypto Bibliography

Citations by First Author - F

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]

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, Towards an Infrastructure for Authorization: Position Paper, to be presented at the 1998 USENIX Ecommerce Conference. [.ps]

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]

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

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

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

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

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

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.

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

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

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, Upper Bounds on Differential Characteristics in Twofish.

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.

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

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

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

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

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]

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, Incremental Cryptography and Memory Checkers, Advances in Cryptology - Eurocrypt '97, Lecture Notes in Computer Science, Vol.1233, Springer-Verlag, pp.393-408, 1997.

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

M. Fischlin, 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, 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. Fitzi, M. Hirt, and U. Maurer, Trading Correctness for Privacy in Unconditional Multi-Party Computation, Advances in Cryptology -- Crypto '98, 1998. [abstract - .txt] [.pdf] [.ps]

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

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]

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

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

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

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

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

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

Y. Frankel and M. Naor, Codes for Interactive Authentication; Crypto 93 and submitted by invitation to the Journal of Cryptology. [.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. Franklin and A. Beimel, Reliable communication over partially authenticated networks, Proc. 11th International Workshop on Distributed Algorithms (WDAG 1997). [.ps]

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

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

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

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

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 D. Boneh, Efficient generation of shared RSA keys, Advances in Cryptology -- Crypto '97 Proceedings.

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

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. 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). [.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. 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, Varieties of secure distributed computing, Proc. Sequences II, Methods in Communications, Security and Computer Science, 1991. [.ps]

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]

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]

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]

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