DREI '97

Speaker List

(Cross-referenced to abstracts.)

Martin Abadi, Digital Systems Research Center, DEC, "Strengthening Passwords" <ma@pa.dec.com> http://www.research.digital.com/SRC/personal/Martin_Abadi/home.html


Bill Aiello, Bellcore, "A High Speed, Software-Driven Stream Cipher" <aiello@bellcore.com>


Ross Anderson, Cambridge University, "Security in Clinical Information Systems" and "Steganography" <ross.anderson@cl.cam.ac.uk> http://www.cl.cam.ac.uk/users/rja14/


Eric Bach, University of Wisconsin, "Linear Algebra Mod N" <bach@cs.wisc.edu> http://www.cs.wisc.edu/~bach/bach.html


Don Beaver, IBM/Transarc, "Commodity-Based Cryptography" and "Concrete Cryptography" <beaver+@transarc.com>


Amos Beimel, DIMACS, "Reliable Communication Over Partially Authenticated Networks" and "Information Theoretic Key Distribution Schemes" <beimel@dimacs.rutgers.edu> http://dimacs.rutgers.edu/People/Beimel.html and http://dimacs.rutgers.edu/~beimel


Josh Benaloh, Microsoft Corporation, "Efficient Methods for Modular Arithmetic" <benaloh@microsoft.com>


Alex Biryukov, Technion, "Cryptanalysis of the Portz Interconnection-Network Block-Cipher" and "Cryptanalysis of RC5" <albi@cs.technion.ac.il>


Matt Blaze, AT&T Labs - Research, "Mr. Blaze Goes To Washington" <mab@research.att.com>


Daniel Bleichenbacher, Bell Labs, "Comparing RSA and RSA-Type Cryptosystems Over Elliptic Curves" <bleichen@research.bell-labs.com> http://www.bell-labs.com/user/bleichen/


Dan Boneh, Bellcore, "Twenty Year of Attacking RSA" <dabo@cs.stanford.edu> http://www.cs.princeton.edu/~dabo/


Gilles Brassard, Université de Montréal, "The Impact of Quantum Mechanics on Cryptology" <brassard@iro.umontreal.ca>


Christian Cachin, MIT, "An Overview of Unconditionally Secure Key Agreement" <


Ran Canetti, IBM - Research, "Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information" and "On the Adaptive Security of Multiparty Protocols" <canetti@watson.ibm.com> http://theory.lcs.mit.edu:80/~canetti/


Len Charlap, IDA, "Elliptic Curves" <len@ccr-p.ida.org>


Benny Chor, Technion, "Private Information Retrieval" <benny@cs.technion.ac.il>


Lorrie Cranor, AT&T Labs - Research, "The Future of Privacy" <lorrie@research.att.com>


Claude Crépeau, Université de Montréal, "Cryptographic Power of Noisy Channel" and "Discreet Solitary Games" <crepeau@iro.umontreal.ca> http://www.iro.umontreal.ca/~crepeau/


Robert Davis, Rutgers University, "Does It Matter What Students Actually Think?" <RDavisRU@aol.com>


Giovanni Di Crescenzo, University of California - San Diego, "Randomness-Efficient Non-Interactive Zero-Knowledge Proofs" <giovanni@bellcore.com>


Sven Dietrich, Adelphi University, "Analysis of the SSL Protocol" <spock@abraxas.adelphi.edu>


Cynthia Dwork, IBM - Research, "Positive Applications of Lattices to Cryptography" <dwork@almaden.ibm.com>


Carl Ellison, Cybercash, "Working Cryptanalysis of the German Enigma" and Key Management in the Post-Identity Era" <cme@cybercash.com>


Joan Feigenbaum, AT&T Labs - Research, "Computational Complexity Theory as an Applied Science" and "Random-Self-Reducibility and Instance-Hiding: Overview, Applications, and Open Questions" <jf@research.att.com> http://www.research.att.com/~jf


Mike Fellows, University of Victoria, "Kid Crypto" <mfellows@imada.ou.dk>


Yair Frankel, CERTCO, "New Techniques for Sharing Cryptographic Functions" <frankely@certco.com> http://www.cs.sandia.gov/~yair/


Matthew Franklin, AT&T Labs - Research, "E-Cash and the Power of Positive Paranoia" <franklin@research.att.com>


Rosario Gennaro, IBM - Research, "How to Sign Digital Streams" <rosario@watson.ibm.com> http://theory.lcs.mit.edu:80/~rosario/


Ron Graham, AT&T Labs - Research, "The Radon Transform on the Hypercube" <rlg@research.att.com>


Jon Grantham, University of Georgia, "Recent Developments in Primality Testing" <grantham@math.uga.edu>


Stuart Haber, Surety Technologies, "Ensuring the Integrity of Records On Line: How to Time-Stamp a Digital Document" <stuart@surety.com>


Ken Koedinger, Carnegie Mellon University, "Cognitive Tutor: An Effective Technology to Improve Mathematics Learning" <koedinger@cmu.edu>


Markus Kuhn, Purdue University, "Probability Theory for Pickpockets" <kuhn@cs.purdue.edu> http://wwwcip.informatik.uni-erlangen.de/~mskuhn


Jack Lacy, AT&T Labs - Research, "Music on the Internet and the Intellectual Property Protection Problem" <lacy@research.att.com>


Jeff Lagarias, AT&T Labs - Research, "Finding Short Vectors in Lattices" <jcl@research.att.com>


Brian LaMacchia, Microsoft Corporation, "Copyright 101 for Digital Domain" <bal@microsoft.com> http://www.farcaster.com/


Susan Landau, University of Massachusetts at Amherst, "Cryptology, Technology and Policy" <landau@cs.umass.edu> http://www.cs.umass.edu/~landau


Peter Lee, Carnegie-Mellon University, "Programming Language Issues in Mobile Code Security" <petel@cs.cmu.edu>


Scott Lindhurst, University of Wisconsin, "When Can We Compute Square Roots?" <lindhurs@math.wisc.edu>


Kevin McCurley, IBM - Research, "Cryptographic Number Theory - Ignorance Is Bliss" <mccurley@almaden.ibm.com>


David P. Maher, AT&T Labs - Research, "Security Models for Partially Accounted E-Cash Systems" <dpm@research.att.com>


Dalia Malkhi, AT&T Labs - Research, "Auditable Metering with Lightweight Security" <dalia@research.att.com> http://www.research.att.com/~dalia


Victor Miller, IDA, "Data Compression, Information, and Probability" <victor@ccr-p.ida.org


Moni Naor, The Weizmann Institute, "Number-Theoretic Constructions of Efficient Pseudo-Random Functions and Other Cryptographic Primitives" <naor@wisdom.weizmann.ac.il>


Andrew M. Odlyzko, AT&T Labs - Research, "Discrete Logarithms and Their Cryptographic Significance" <amo@research.att.com>


Hilaire Orman, DARPA, "The Imperfection of Secrecy in Real Network Protocols" <horman@darpa.mil>


Rafail Ostrovsky, Bellcore, "Private and Secure Database Storage and Retrieval" <rafail@bellcore.com>


Rene Peralta, University of Wisconsin at Milwaukee, "Alternative Approaches to Integer Factoring" <peralta@lucifer.cs.uwm.edu> http://cs.uwm.edu/faculty/peralta


Pino Persiano, Universita' di Salerno, "A Transparent Distributed Cryptographic Filesystem" <giuper@dia.unisa.it>


Erez Petrank, DIMACS, "Identity Escrow" <erez@dimacs.rutgers.edu> http://dimacs.rutgers.edu/People/Postdocts/Petrank.html>


Benny Pinkas, The Weizmann Institute, "Efficient and Secure Metering" <bennyp@wisdom.weizmann.ac.il>


Henry Pollak, Teachers College of Columbia University, "Hamiltonian Circuits on the n-Dimensional Cube" <0006182700@mcimail.com>


Bart Preneel, Kuleuven, "Constructing Hash Functions Based on Block Ciphers" <bart.preneel@esat.kuleuven.ac.be> http://www.esat.kuleuven.ac.be/~preneel


Tal Rabin, IBM - Research, "Chameleon Hashing and Signatures" <talr@watson.ibm.com>


Marcus Ranum, Network Flight Recorder, Inc., "Hacking and Networked Terrorism" and "Problems with the Firewall Concept" <mjr@clark.net> http://www.nfr.net


Jim Reeds, AT&T Labs - Research, "Cryptanalysis as Puzzles" <reeds@research.att.com>


Mike Reiter, AT&T Labs - Research, "Toward Acceptable Metrics of Authentication" <reiter@research.att.com> http://www.research.att.com/~reiter/


Joseph Rosenstein, DIMACS - Rutgers University, "The 'Standards' Approach to K-12 Mathematics Education" <joer@dimacs.rutgers.edu> http://dimacs.rutgers.edu/nj_math_coalition/joer/joer.html


Avi D. Rubin, AT&T Labs - Research, "Crowds: Anonymous Web Transactions" and "How Math Will Protect You on the Information Super-Highway" <rubin@research.att.com> http://www.cs.nyu.edu/~rubin/


Steven Rudich, Carnegie Mellon University, "Pseudorandomness Against Non-Deterministic Adversaries" <rudich@cs.cmu.edu> http://www.cs.cmu.edu/~rudich


Fred Schneider, Cornell University, "Mobile Code Security Issues" <fbs@cs.cornell.edu> http://www.cs.cornell.edu/Info/Department/Annual96/Faculty/Schneider.html


Rich Schroeppel, University of Arizona, "Fast Arithmetic in GF[2^156]" <rcs@cs.arizona.edu> http://www.cs.arizona.edu/xkernel/www/people/rich.html


Adi Shamir, The Weizmann Institute, "A New Paradigm for Massively Parallel Random Search" and "Cryptanalytic Fault Attacks" and "Cryptography without Computers" <shamir@wisdom.weizmann.ac.il>


Sara Spalding, Indiana University, (with Rebecca Wright) "Experimental Results on Efficient Generation of Shared RSA Keys" <sspaldin@indiana.edu>


Martin Strauss, AT&T Labs - Research, "Proxy Cryptography" and "A Formal Treatment of Transactional Trust Management" and "Review of Error Detection and Correction" <mstrauss@research.att.com> http://www.research.att.com/~mstrauss


Edlyn Teske, University of Manitoba, "Space Efficient Group Structure Computation Using Pollard's Rho-Method" <teske@cs.umanitoba.ca> http://www.informatik.th-darmstadt.de/TI/Mitarbeiter/teske.html


Serge Vaudenay, ENS, "On Provable Security for Secret Key Block Ciphers" <Serge.Vaudenay@ens.fr> http://www.dmi.ens.fr/dmi/users/vaudenay/index_en.html


Ramarathnam Venkatesan, Microsoft Research, "Speeding Up Public Key Systems via Pre-Computations" <venkie@microsoft.com>


Peter Winkler, Bell Labs, "Comparing Without Revealing" and "Combinatorial Cryptology and the 'Two Sheriffs' Problem" <pw@research.bell-labs.com> http://www.research.bell-labs.com/~pw


Rebecca Wright, AT&T Labs - Research, "Reliable and Private Communication Over Echo Lines" and (with Sara Spalding) "Experimental Results on Efficient Generation of Shared RSA Keys" and "Secret Communication Using a Deck of Cards" <rwright@research.att.com> http://www.research.att.com/~rwright


Bennet Yee, University of California at San Diego, "Overview of Secure Co-Processors" and "The Sanctuary Project" <bsy@cs.ucsd.edu> http://www-cse.ucsd.edu/users/bsy/



---

Return to: Education Program or Education Program Participants or Research Program or Research Program Participant List