Subject: Electronic CIPHER, Issue 41, February 20, 2001 _/_/_/_/ _/_/_/ _/_/_/_/ _/ _/ _/_/_/_/ _/_/_/_/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/_/_/_/ _/_/_/_/ _/_/ _/_/_/_/ _/ _/ _/ _/ _/ _/ _/ _/ _/_/_/_/ _/_/_/ _/ _/ _/ _/_/_/_/ _/ _/ ==================================================================== Newsletter of the IEEE Computer Society's TC on Security and Privacy Electronic Issue 41 February 20, 2001 Jim Davis, Editor Hilarie Orman, Assoc. Editor Bob Bruen, Book Review Editor Mary Ellen Zurko, Assoc. Editor Anish Mathuria, Reader's Guide ==================================================================== http://www.ieee-security.org/cipher.html Contents: * Letter from the Editor * Conference and Workshop Announcements o 2001 Symposium on Security & Privacy, May 13-16, 2001, Oakland, CA, USA. Registration and a list of accepted papers is available o Information on the 14th IEEE Computer Security Foundations Workshop, June 11-13, 2001, Cape Breton, Nova Scotia, Canada o Upcoming calls-for-papers and events * News Briefs: o LISTWATCH by Mary Ellen Zurko o News Bits: correspondence and announcements * Commentary and Opinion o Robert Bruen's review of "E-Mail Virus Protection Handbook" by Brian Bagnall, Chris Broomes, and Ryan Russell o Review of WITS 2000 by Ricardo Focardi o Review of NSPW 2000 by Brenda Timmerman * Staying in Touch o Information for subscribers and contributors o Recent address changes * Interesting Links and New reports available via FTP and WWW * Reader's guide to recent security and privacy literature, by Anish Mathuria * List of Computer Security Academic Positions, by Cynthia Irvine * Links for the IEEE Computer Society TC on Security and Privacy o Becoming a member of the TC o TC Officers o TC publications for sale ==================================================================== Letter from the Editor ==================================================================== Dear Readers: We are pleased to bring you this issue of Cipher! In it you will find a book review by Robert Bruen, Mary Ellen Zurko's LISTWATCH, conference reviews by Brenda Timmerman and Ricardo Focardi, and new calls-for-papers.  Worth noting here, the Conference and Workshop section of this issue updates information for the 2001 Symposium on Security and Privacy (May 13-16, 2001, Oakland)...registration is now available and a list of selected papers is provided.  Contributions to Cipher are always welcome, and we especially appreciate commentary on conferences and workshops. The pay is poor, but you would certainly gain the instant gratitude of your peers. Did I mention the pay? In any event, if you'd like to contribute a note, let me know. Many thanks to our colleagues for their help with this issue!   Best regards, Jim Davis 2/20/2001 ==================================================================== Conference and Workshop Announcements ==================================================================== Information about the 2001 IEEE Symposium on Security and Privacy (to be held May 13-16, 2001 at The Claremont Resort in Oakland, California, USA) is posted on the TC web page at www.ieee-security.org/TC/sp2001.html. Registration is now available (the registration form is on the web site). The deadline for submitting papers has past, but you can still contribute a 5-minute talk: 5-MINUTE TALKS A continuing feature of the symposium will be a session of 5-minute talks, where attendees can present preliminary research results or summaries of works published elsewhere. Printed abstracts of these talks will be distributed at the symposium. Abstracts for 5-minute talks should fit on one 8.5"x11" or A4 page, including the title and all author names and affiliations. Send an email with a MIME attachment containing your abstract in PDF or Postscript format to needham@microsoft.com. This email should state that your abstract is for the session of 5-minute presentations at the 2001 IEEE Symposium on Security and Privacy, and should include the presenter's name, email and postal addresses, and phone and fax numbers. Please use a subject field containing the string "Oakland01". 5-Minute abstracts due: March 13, 2001 Acceptance notification: March 31, 2001 The accepted papers are: Evaluation of Intrusion Detectors: A Decision Theory Approach John Gaffney, Jacob Ulvila Performance of Public Key-Enabled Kerberos Authentication in Large Networks. Alan Harbitter, Daniel A. Menasce Cryptographic Security for Mobile Code Joy Algesheimer, Christian Cachin, Jan Camenisch, Günter Karjoth Intrusion Detection via Static Analysis David Wagner, Drew Dean On Confidentiality and Algorithms Johan Agat A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. Birgit Pfitzmann, Michael Waidner Protection of Keys against Modification Attack Wai-wa FUNG, Mordecai Golin, Jim Gray Cryptographic Key Generation from Voice Authors: Fabian Monrose, Michael Reiter, Qi Li, Susanne Wetzel Information-Theoretic Measures for Anomaly Detection Wenke Lee, Dong Xiang Preserving Information Flow Properties under Refinement Heiko Mantel A Trend Analysis of Exploitations Hilary Browne, William Arbaugh, John McHugh, William Fithen Understanding Trust Management Systems Stephen Weeks Data Mining Methods for Detection of New Malicious Executables Matthew Schultz, Eleazar Eskin, Erez Zadok, Sal Stolfo SD3: a trust management system with certified evaluation Trevor Jim A Fast Automaton-Based Method for Detecting Anomalous Program Behaviors R Sekar, Mugdha Bendre, Pradeep Bollineni Formal Treatment of Certificate Revocation Under Communal Access Control Xuhui Ao, Naftaly Minsky, Victoria Ungureanu Networked Cryptographic Devices Resilient to Capture Philip MacKenzie, Michael Reiter Graph-Based Authentication of Digital Streams Sara Miner, Jessica Staddon ELK, a New Protocol for Efficient Large-Group Key Distribution Adrian Perrig, Dawn Song, J. D. Tygar ----------------------------------------------------------------- Information about the 14th IEEE Computer Security Foundations Workshop (to be held June 11-13, 2001, 2001 IEEE Symposium on Security and Privacy (to be held May 13-16, 2001 Keltic Lodge, Cape Breton, Nova Scotia, Canada) can be found at www.csl.sri.com/csfw/csfw14. ==================================================================== Upcoming Calls-For-Papers and Events ==================================================================== The complete Cipher Calls-for-Papers is located at www.ieee-security.org/cfp.html. The Cipher event Calendar is at www.cs.utah.edu/flux/cipher/cipher-hypercalendar.html ____________________________________________________________________ Cipher Event Calendar ____________________________________________________________________ Calendar of Security and Privacy Related Events maintained by Hilarie Orman Date (Month/Day/Year), Event, Locations, e-mail for more info. See also Cipher Calls for Papers file (www.ieee-security.org/cfp.html) for details on many of these listings. Also worth a look are the ICL calendar and the IACR site, and several others. 3/12/01- 3/16/01: FME 2001Berlin, Germany www.informatik.hu-berlin.de/top/fme2001 3/19/01: SEMAS-2001, Montreal, Canada; submissions due Fischer@dfki.de www.dfki.de/~kuf/semas/ 3/26/01- 3/29/01: DOCSec '01, Annapolis, MD www.cs.utah.edu/flux/cipher/cfps/cfp-DOCSec01.html 3/28/01: ISADS 2001, Dallas, Texas isads.utdallas.edu/ 3/29/01- 3/30/01: CaLC '01, Providence, RI; www.math.brown.edu/~jhs/CALC/CALC.html 3/30/01: RAID 2001, Davis, CA; Submissions due wenke@csc.ncsu.edu www.raid-symposium.org/Raid2001 3/30/01: NSPW 2001, Cloudcroft, New Mexico; submissions due btimmer@ecs.csun.edu www.nspw.org 3/31/01: TRPC 2001, Alexandria, Virginia; Submissions due www.tprc.org/ 4/ 2/01: SRDS-20. , New Orleans, Submissions due srds.cs.umn.edu 4/16/01- 4/19/01: ICDCS-21, Phoenix, Arizona cactus.eas.asu.edu/ICDCS2001/call_for_papers.htm 4/22/01- 4/23/01: OPENARCH '01, Anchorage, Alaska www.openarch.org 4/25/01- 4/27/01: WOIH-4, Pittsburgh, PA; chacs.nrl.navy.mil/IHW2001 4/25/01- 4/27/01: IWSecP, Cambridge, England www.cs.utah.edu/flux/cipher/cfps/cfp-IWSecP.html 5/ 1/01- 5/ 5/01: WWW10, Hong Kong, China www10.org 5/ 6/01- 5/10/01: Eurocrypt 2001, Innsbruck, Austria; www.ec2001.ocg.at 5/13/01- 5/16/01: IEEE S&P '01, Oakland, California; www.ieee-security.org/TC/sp2001.html 5/20/01: ICICS '01, Xian, China; submissions due; homex.coolconnect.com/member2/icisa/icics2001.html 5/29/01: SEMAS-2001, Montreal, Canada; 6/11/01- 6/13/01: CSFW 14, Nova Scotia, Canada www.csl.sri.com/csfw/csfw14/ 6/11/01- 6/13/01: IFIP/Sec '01, Paris, France; www.ifip.tu-graz.ac.at/TC11/SEC2001/ 6/11/01- 6/15/01: CITSS '01, Ottawa, Canada; www.cse-cst.gc.ca/cse/english/annual.html 6/15/01- 6/16/01: SCITS-II, Bratislava, Slovakia; www.conference.sk/ifip/ 6/17/01- 6/22/01: FIRST, Toulouse, France www.first.org/ 6/22/01- 6/23/01: EFECE, Edinburgh, Scotland www.efce.net/programme.html 7/2/01 - 7/4/01: ACISP '01, Sydney, Australia; www.cit.nepean.uws.edu.au/~acisp01 7/23/01- 7/24/01: WIAPP '01, San Jose, CA; www.cs.berkeley.edu/~gribble/wiapp01 8/10/01: Indocrypt '2001, Chennai, India ; papers due www.cs.utah.edu/flux/cipher/cfps/cfp-Indocrypt2001.html 8/13/01- 8/16/01: 10th USENIX Security Symposium, Washington, D.C. 9/11/01- 9/13/01: NSPW 2001, Cloudcroft, New Mexico ; 9/17/01- 9/19/01: ECC 2001, Waterloo, Ontario, Canada, 10/10/01-10/12/01: RAID 2001, Davis, CA; 10/27/01-10/29/01: TRPC 2001, Alexandria, Virginia; 10/28/01-10/31/01: SRDS-20, New Orleans, Louisiana; 11/13/01-11/16/01: ICICS, Xian, China 12/16/01-12/20/01: Indocrypt '2001, Chennai, India 5/13/02- 5/15/02: (tentative date) IEEE S&P 2002 ____________________________________________________________________ Journal, Conference and Workshop Calls-for-Papers ____________________________________________________________________ IEEE Computer, Special issue on embedded system security. Guest editors: William A. Arbaugh, University of Maryland, and Leendert Van Doorn, IBM Research. Submission deadline is March 15, 2001. Embedded systems range from personal digital assistants to disk controllers and from home thermostats to microwave regulators. These near-ubiquitous devices are often networked and thus present security challenges similar to those already of concern on the Internet. This special issue will consider the security and privacy that networked embedded systems present. Submissions are sought on all topics relating to embedded system security including risk analysis, privacy issues, software security architectures, security requirements for embedded operating systems, embedded cryptographic devices, using embedded devices to build secure systems, and secure firmware upgrades. Contact William Arbaugh at wwa@cs.umd.edu. Computer Communications, Special issue on Network Security. Publication: spring 2002. Editors: Brian Neil Levine, University of Massachusetts, and Clay Shields, Purdue University. Submission deadline is October 5, 2001. The Internet has become the cornerstone for the proliferation of networking technology. The quality of the security and privacy of the services, protocols, and infrastructure that make up the Internet is a key factor in its continued growth and survivability. This special issue will collect and archive the state of the art in Network Security for existing and future network technologies, publishing research that explores: The security of infrastructure and systems that form the network (such as routers, application-level proxies, and servers); The security of protocols and services that work end-to-end (such as DNS, HTTP, multimedia conferencing and virtual environments, and e-commerce); Protocols that protect the privacy of users on the network. An emphasis on deployable systems and the inclusion of an analysis of their network performance in the presence of security mechanisms is ideal. Areas of interest include, but are not limited to: - Network privacy and anonymity  - Multicast and group-communication security - Intrusion detection and response - Network traceback  - Integrating security in Internet protocols  - Security analysis of Internet protocols  - Network performance evaluation of network security protocols; - Denial-of-service attacks and counter measures  - Virtual private networks  - Security for wireless networks and technologies  Through the publication of this special issue, we wish to bring together researchers from the security and networking communities that have not previously had a common forum in which to share methodologies and techniques. Instructions for submitting a paper are given at signl.cs.umass.edu/comcom IEEE Internet Computing, Special Issue on Peer-to-Peer Networking. Guest editor: Li Gong, Sun Microsystems. Publication date: January/February 2002. Submissions due June 1, 2001. The term peer-to-peer networking is applied to a wide range of technologies that greatly increase the utilization of information, bandwidth, and computing resources in the Internet. Frequently, these P2P technologies adopt a network-based computing style that neither excludes nor inherently depends on centralized control points. Apart from improving performance in terms of information discovery, content delivery, and information processing, such a style also can enhance the overall reliability and fault-tolerance of the computing system. This special issue of Internet Computing will showcase significant developments in the general area of peer-to-peer networking. Topics of interest include (but are not limited to): 1. Peer naming, discovery, and organization  2. Peer-based communication and information sharing  3. Systems support for peer-to-peer networking  4. Security support for peer-to-peer networking  5. Peer-based network infrastructure including operating systems  6. Peer-based services and applications Ideally, submissions will report advances that (a) use a simple and elegant solution to solve a seemingly complicated problem, (b) have a solid theoretical foundation but a realistic implementation path, and (c) are readily deployable over currently existing Internet infrastructure. We discourage strictly theoretical or mathematical papers on modeling of peer-to-peer computing. If you are uncertain about your submission in terms of scope, please provide an abstract to the guest editor for clarification before submission. (note: the complete call for papers has not been posted on the IEEE web site yet. We will update this Cipher entry when the URL is known. In the interim, you may choose to contact the guest editor, Dr. Li Gong at li.gong@sun.com) IST'2001 International Symposium on Telecommunications, Tehran, Iran, September 1-3, 2001. (abstracts for papers and tutorial proposals due: March 1, 2001) The first International Symposium on Telecommunications will be organized by the Iran Telecommunication Research Center (ITRC). The Symposium will be sponsored by IEEE, IEE and ICT. It aims to provide a broad international forum as well as an outstanding opportunity for scientific researchers, academicians and telecommunication engineers to discuss new and emerging technologies, progress in standards, services and their applications in telecommunication and information systems. More information on the workshop, along with a complete list of topics of interest can be found at www.itrc.ac.ir/ist2001 ISSE 2001 Information Security Solutions Europe Conference, QEII Conference Centre, London, UK, September 26-28, 2001. proposals due March 5, 2001. www.eema.org/isse EEMA - The European Forum for Electronic Business and TeleTrusT - The Association for the Promotion of Trustworthiness of IT-Systems invite you to participate in the Call for Papers for ISSE 2001. ISSE is the European institution for the presentation and discussion of technical, organisational, legal and political concepts for information security and data protection. As a user-oriented conference it provides presentations and panel discussions about existing and future information security solutions for large scale corporations, enterprises, especially for SMEs, commerce, financial institutions, public sector, health care, legal practitioners and security professionals. An extensive list of topics of interest along with instructions for submitting a paper is given in the full call-for-papers at www.eema.org/isse. S&P'2001 2001 IEEE Symposium on Security and Privacy, Oakland, CA, USA, May 13-16, 2001. (papers and panel proposals due: November 7th, 2000; 5-minute talks due March 13, 2001) A continuing feature of the symposium will be a session of 5-minute talks, where attendees can present preliminary research results or summaries of works published elsewhere. Complete instructions for submitting papers, panel proposals, and 5-minute talk abstracts can be found on the conference web page at www.ieee-security.org/TC/sp2001.html.  MOS'2001 The 7th ECOOP Workshop on Mobile Object Systems, (in association with the 15th European Conference on Object-Oriented Programming), Budapest Hungary, June 18, 2001. (papers due March 15, 2001) This year's workshop has two emphases. Firstly, it seeks experience reports, as well as papers on design and development techniques for mobile object applications. Application of the recent research results in the development of real systems is crucial for the future of mobile computing. Secondly, it brings together a group of active researchers working on security and fault tolerance to develop an understanding of the important research problems and recent results in these areas. In particular, it is felt that it should be beneficial to examine fault tolerance and security issues together as secure agents systems can be used for building fault tolerant systems and at the same time general fault tolerance mechanisms can be applied for providing security. Topics of interest and instructions for submitting a paper can be found on the workshop web page at cui.unige.ch/~ecoopws. SEEMAS'2001 First International Workshop on Security of Mobile Multiagent Systems (to be held at the Fifth International Conference on Autonomous Agents), Montreal, Canada, May 29, 2001. (research papers and position papers are due: March 19, 2001) We welcome the submission of papers from the full spectrum of issues associated with security in mobile multiagent systems, both in the public Internet and in private networks. We particularly encourage the discussion of the following topics: - security policies for agent environments - security mechanisms that can be implemented by using (mobile) multiple agents - reasoning about security in an agent architecture - security for agents (against other agents, malicious hosts, and software failures) - security for agent hosts (against agent attacks and agent deficiency) - security through agents (for any form of malfunctioning in the network) - application of security mechanism in a (mobile) multiagent context - integration of traditional security mechanisms to the agent realm - design methodologies for secure (mobile) multiagent systems More information can be found on the conference web page at www.dfki.de/~kuf/semas/. NCISSE'2001 Fifth National Colloquium for Information Systems Security Education, George Mason University, Fairfax, Virginia, USA, May 22-24, 2001. (papers due March 29, 2001) This colloquium, the fifth in an ongoing annual series, will bring together leading figures from academia, government, and industry to address the national need for security and assurance of our information and communications infrastructure. This goal requires both an information-literate work force that is aware of its vulnerability as well as a cadre of information professionals that are knowledgeable of the recognized "best practices" available in information security and information assurance. This year the Colloquium will trace security education and training from its beginning, through the current state of art, and into the future. The colloquium is interested in general submissions as well as student participation. The papers should discuss course or lab development, INFOSEC curricula, standards, best practices, existing or emerging programs, trends, and future vision, as well as related issues. This year, we are particularly interested in addressing "What does a good education in information security require, and how are we to teach this?" To answer this question, we are particularly interested in topics such as the following (although others are also of interest): * Assessment of need (e.g. how many information security workers/researchers/faculty are needed?) * Integrating information assurance topics in existing graduate or undergraduate curricula * Experiences with course or laboratory development * Alignment of curriculum with existing information assurance education standards * Emerging programs or centers in information assurance * Late breaking topics * Best Practices * Vision for the Future Information about the conference, as well as instructions for submitting a paper are given on the conference web site at www.infosec.jmu.edu/ncisse/. RAID'2001 Fourth International Symposium on the Recent Advances in Intrusion Detection, Davis, California, USA. October 10-12, 2001. (papers due March 30, 2001; panel proposal due April 30, 2001) This symposium, the fourth in an annual series, brings together leading figures from academia, government, and industry to discuss state-of-the-art intrusion detection technologies and issues from the research and commercial perspectives. The RAID International Symposium series is intended to further advances in intrusion detection by promoting the exchange of ideas in a broad range of topics. The RAID'2001 program committee invites submission of both technical and general interest papers and panels from those interested in formally presenting their ideas during the symposium. RAID'2001 will welcome full papers, short papers and panel proposals. Full papers are intended for presenting mature research results, and short ones for work-in-progress presentations. We also seek panel submissions in the same areas. A complete list of topics of interest along with instructions for submitting a paper or panel proposal can be found at the conference web site at www.raid-symposium.org/Raid2001/.  NSPW'2001 New Security Paradigms Workshop 2001, Cloudcroft, New Mexico, USA, September 11-13, 2001. (papers due March 30, 2001) 2001 is the tenth anniversary of the New Security Paradigms Workshop, which has provided a productive and highly interactive forum for innovative new approaches to computer security. The workshop offers a constructive environment where experienced researchers and practitioners work alongside newer participants in the field. In order to preserve the small, focused nature of the workshop, participation is limited to authors of accepted papers and conference organizers. Because we expect new paradigms we accept wide-ranging topics in information security. Any paper that presents a significant shift in thinking about difficult security issues or builds on a previous shift is welcomed. Authors are encouraged to present ideas that might be considered risky in some other forum. Details on topics of interest along with instructions for submitting a paper are given on the conference web site at www.nspw.org. First Workshop on Information Security Systems Rating and Ranking, Williamsburg, Virginia, May 21-23, 2001. (position papers due March 30, 2001) After more than 20 years of effort in "security metrics," the evolution of product evaluation criteria identification, Information Assurance (IA) quantification, and risk assessment/analysis methodology development, has led to the widespread need for a single number or digraph rating of the "security goodness" of a component or system. Computer science has steadily frustrated this need--it has neither provided generally accepted, reliable measures for rating IT security nor has it applied any measures for security assurance. The goals of this workshop are to recap the current thinking on "IA metrics" activities and to formulate a path for future work on IA rating/ranking systems. Topics will include identifying workable successes or capturing lessons learned from our failures, clarifying what is measurable, and the addressing the impact of related technology insertion. The expected workshop result is the determination of "good" indicators of the IA posture of a system. The workshop will serve as a forum for group discussion, with topics determined by the participants. Submission of a 4-to-5-page position paper is required for workshop attendance. For further information, please see: www.acsac.org/measurement Deadline for submission of papers: March 30, 2001. PRC2001 The 29th Research Conference on Communication, Information and Internet Policy, Alexandria, Virginia, USA, October 27-29, 2001. (papers due March 31, 2001) TPRC hosts this annual forum for dialogue among scholars and decision-makers from the public and private sectors engaged in communication and information policy. The purpose of the conference is to acquaint policymakers with the best of recent research and to familiarize researchers with the knowledge needs of policymakers and industry. The TPRC program is assembled from submitted and invited abstracts. TPRC is now soliciting proposals for papers for presentation at its 2001 conference. Proposals should be based on current theoretical and/or empirical research relevant to the making of communication and information policy, and may be from any disciplinary perspective. TPRC welcomes national, international, or comparative studies. Topics on interest and instructions for submitting a paper can be found on the conference web page at www.tprc.org/TPRC01/2001.HTM SRDS-20 20th IEEE Symposium on Reliable Distributed Systems, New Orleans, USA, October 28-31, 2001 (tentative).  (papers due April 2, 2001) The objective of this symposium is to provide an effective forum for researchers and practitioners who are interested in distributed systems design and development, particularly with reliability, availability, safety, security, or real-time properties. We welcome original research papers as well as papers that deal with development experiences and experimental results of operational systems. We are also soliciting papers for an experience track that presents on-going industrial projects, prototype systems, exploratory or emerging applications, etc. The major areas of interest include, but are not limited to, the following topics: - Distributed systems with reliability, availability, security, safety, and/or real-time requirements - Distributed databases and transaction processing - Parallel and distributed operating systems - Internet systems and applications - Mobile and ubiquitous computing - Distributed multimedia systems - Electronic commerce enabling technologies - Distributed workflow and enterprise management systems - Security and High Confidence Systems - QoS control and assessment - Analytical or experimental assessment of distributed systems - Formal methods and foundations for reliable distributed computing - Distributed objects and middleware systems - Distributed and Web-based application systems - Performance modeling and evaluations of reliable distributed systems More information can be found on the conference web page at srds.cs.umn.edu InfoSecu01 ACM International Conference on Information Security, Shanghai, China, September 24-26, 2001. (papers due April 2, 2001) InfoSecu01 solicits previously unpublished papers offering novel research and practice contributions in any aspect of computer security for submission to the 2001 symposium. Papers may represent advances in the theory, design, implementation, analysis, or empirical evaluation of secure systems, either for general use or for specific application domains. Topics of interest include, but are not limited to, the following: - Access control, authorization, and audit - Authentication, biometrics, and smartcards - Commercial and industrial security - Data integrity - Database security - Denial of service and its treatment - Distributed systems security - Electronic commerce - Electronic privacy, anonymity - Information flow  - Intrusion detection and survivability - Language-based security - Mobile code and agent security  - Network security - Security protocols - Security verification  - Viruses and other malicious code For further information regarding InfoSecu01, please contact the conference secretariat at bu-fl@cs.sjtu.edu.cn CCS-8 Eighth ACM Conference on Computer and Communications Security, Philadelphia, Pennsylvania, USA, November 6-8, 2001. Deadline for submissions has been extended to April 30, 2001. www.bell-labs.com/user/reiter/ccs8/ Papers offering novel research contributions in any aspect of computer security are solicited for submission to the Eighth ACM Conference on Computer and Communications Security. Papers may present theory, technique, applications, or practical experience. A complete list of topics and instructions for submitting a paper or panel proposal can be found on the conference web site at www.bell-labs.com/user/reiter/ccs8/. ICICS'2001 Web: homex.coolconnect.com/member2/icisa/icics2001.html Third International Conference on Information and Communications Security, Xian, China, November 13-16, 2001. (submissions due May 20, 2001) ICICS’01 covers all aspects of theory and application of information and communications security. More information can be found on the conference web page at homex.coolconnect.com/member2/icisa/icics2001.html ISC'2001 Information Security Conference, Malaga, Spain, October 1-3, 2001. (submissions due May 25, 2001) Original papers are solicited for submission to the Information Security Conference 2001. ISC aims to bring together individuals involved in multiple disciplines of information security to foster exchange of ideas. The emphasis of the conference is multi-disciplines of information security. Topics include but not limited to: - Biometrics - Collaborative Applications - Copyright Protection - Distributed Trust Management - E-Commerce Protocols - Electronic Voting - Information Hiding - Intrusion Detection - IP-Security - Implementations - Legal and Regulatory Issues - Payments/MicroPayments - Notary Public - Security Analysis Tools - Tamper-Resistant SW/HW - Virtual Private Networks - Watermark - Web Security Instruction for authors and more information on the conference are given on the conference web site at www.isconference.org. Workshop on Data Mining for Security Applications (part of the 8th ACM Conference on Computer Security Nov 6-8, 2001), Philadelphia, PA, USA, November 8, 2001. (abstracts are due March 25, 2001 and full papers are due June 1, 2001) This year the ACM's Conference on Computer Communications and Security offers a special half-day workshop on data mining for security applications. This event provides an opportunity for attendees of the ACM CCS to meet with researchers who are interested in applying data mining techniques to security applications and discuss critical issues of mutual interest during a concentrated period. The topics of interest include, but are not limited to: - Intrusion detection and analysis via data mining  - Data mining in forensics  - Text data mining as a tool for collecting criminal evidence  - Classification and clustering of intrusions, attacks and computer-related crimes  - Real-time detection  - Predictive tools for security  - Mining for inferences  Instructions for submitting an abstract and paper can be found on the workshop web page at www.bell-labs.com/user/reiter/ccs8/ ACSAC'2001, 17th Annual Computer Security Applications Conference, New Orleans, USA, December 10-14, 2001. (submissions are due June 1, 2001) We are currently soliciting papers, panels, forums, case studies, and tutorial proposals for the 17th Annual Computer Security Applications Conference (ACSAC) to be held 10 - 14 December 2001 in New Orleans, Louisiana, USA. For general information or questions about ACSAC, please see our web page at www.acsac.org or email Publicity_Chair@acsac.org. For specific submission-related information, please see the following web page: www.acsac.org/2001/cfp. Workshop on Security and Privacy in Digital Rights Management (part of the 8th ACM Conference on Computer Security Nov 6-8, 2001), Philadelphia, PA, USA, November 5, 2001. (papers due August 3, 2001) Increasingly the Internet is used for the distribution of digital goods, including digital versions of books, articles, music and images. The ease with which digital goods can be copied and redistributed make the Internet well suited for unauthorized copying, modification and redistribution. This workshop will consider technical problems faced by rights holders (who seek to protect their intellectual property rights) and end consumers (who seek to protect their privacy and to preserve access they now enjoy in traditional media under existing copyright law). The workshop seeks submissions from academia and industry presenting novel research on all theoretical and practical aspects of DRM, as well as experimental studies of fielded systems. We encourage submissions from other communities such as law and business that present these communities' perspectives on technological issues. A complete list of topics and instructions for submitting a paper can be found o the workshop web page at www.star-lab.com/sander/spdrm/. Indocrypt'2001 www.cs.iitm.ernet.in/indocrypt Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001. Papers due August 10, 2001. Original papers on all technical aspects of cryptology are solicited for submission to Indocrypt 2001. Detailed instructions for submission of a paper are given on the conference web site. ==================================================================== Conferences and Workshops (the call for papers deadline has passed) ==================================================================== FC'01 CFP: www.syverson.org Conf Web site: fc01.ai Fifth International Conference on Financial Cryptography, Grand Cayman, BWI, February 19-22, 2001. SREIS www.cerias.purdue.edu/SREIS.html Symposium on Requirements Engineering for Information Security, Purdue University CERIAS, West Lafayette, Indiana, USA, March 5-6, 2001. FME2001 www.informatik.hu-berlin.de/top/fme2001 FORMAL METHODS EUROPE Formal Methods for Increasing Software Productivity, Humboldt-Universitaet zu Berlin, Germany, March 12-16, 2001. ISADS 2001 isads.utdallas.edu The Fifth International Symposium on Autonomous Decentralized Systems, Dallas, Texas, USA, March 26-28, 2001. DODsec'2001 www.omg.org/news/meetings/docsec2001/workshop.htm Fifth Workshop on Distributed Objects and Components Security, Annapolis, MD, USA, March 26-29, 2001. CaLC 2001 www.math.brown.edu/~jhs/CALC/CALC.html Cryptography and Lattices Conference, Brown University, Providence, Rhode Island, USA, March 29-30, 2001. ICDCS'2001 cactus.eas.asu.edu/ICDCS2001/call_for_papers.htm 21st International Conference on Distributed Computing Systems, Phoenix, AZ, USA, April 16-19, 2001. OPENARCH'01 www.openarch.org The Fourth IEEE Conference on Open Architectures and Network Programming, Hilton Anchorage Hotel, Anchorage, Alaska, April 22-23, 2001. IHW2001 chacs.nrl.navy.mil/IHW2001 4th International Information Hiding Workshop, Holiday Inn University Center, Pittsburgh, PA, USA, April 25-27, 2001. WWW10 www10.org The Tenth International World Wide Web Conference, Hong Kong, China. May 1-5, 2001. Eurocrypt'2001 www.ec2001.ocg.at 20th Annual Eurocrypt Conference, Innsbruck, Austria, May 6-10, 2001. IFIP/Sec 2001 www.ifip.tu-graz.ac.at/TC11/SEC2001/ 16th International Conference on Information Security, Paris, France, June 11-13, 2001. CSFW'14 www.csl.sri.com/csfw/csfw14/ 14th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada, June 11-12, 2001. S&P'2001 www.ieee-security.org/TC/sp2001.html 2001 IEEE Symposium on Security and Privacy, Oakland, CA, USA, May 13-16, 2001. SMC-IAW www.itoc.usma.edu/Workshop/2001/Workshop2001.htm 2nd Annual IEEE Systems, Man, and Cybernetics Information Assurance Workshop, United States Military Academy, West Point, New York, USA, June 5-6, 2001. 2000-3000 word extended abstracts due: 12/20/00 SCITS-II www.conference.sk/ifip/ IFIP WG 9.6/11.7 Working Conference on Security and Control of IT in Society II, Bratislava, Slovakia, June 15-16, 2001. FIRST'2001 Web: www.first.org/conference/2001/ The 13th Annual FIRST Conference on Computer Security and Incident Handling, Toulouse, France, June 17-22, 2001. ACISP'2001 www.cit.nepean.uws.edu.au/~acisp01 The Sixth Conference on Information Security and privacy, Sydney, Australia, July 2-4, 2001. ==================================================================== News Briefs ==================================================================== News briefs from past issues of Cipher are archived at www.ieee-security.org/Cipher/NewsBriefs.html ___________________________________________________________________ LISTWATCH: items from security-related mailing lists (February 16, 2000) by Mary Ellen Zurko (mzurko@iris.com) ____________________________________________________________________ This issue's highlights are from Risks, Politech, Privacy Forum Digest, Crypto-Gram, DCSB, ACM technews, and cypherpunks. ____________________ The 20-year-old Dutch student arrested for creating the "Anna Kournikova" virus claimed that he intended only to issue the sites effected a warning to tighten their Internet security, and "after all it's their own fault they got infected." ____________________ The Children's Advertising Review Unit (CARU) of the Council of Better Business Bureaus, Inc. (CBBB) has found Altavista in violatin of CARU's Self-Regulaory Guidelines for Children's Advertising (the Guidelines) and the federal Children's Online Privacy Protection Act (COPPA). AltaVista "has closed down all of its community services, which includes all interactive services, such as chat rooms, bulletin boards and free email. AltaVista is committed to screening children under the age of 13 from accessing adult content on the AltaVista Web site." The violations are 1. Use of registration language that encourages children under age 13 to misstate their ages and 2. Failure to adequately prevent children from accessing altavista.com clubs (chat rooms) with "adult only" content. In the former case, the site didn't do anything to either keep the adult testing the system from figuring out that they needed to change their date of birth, or to reject or question the change. In the latter case, matchmaking chat rooms were not requiring the collection of personal information verify age. ____________________ Network Solutions, Inc. is promoting the availability of their domain registration database and related activity tracking services for direct marketing uses . Someone wishing to opt-out of NSI's use of their data should send email with "remove bulk access" and/or "remove domain" in the subject lines to privacy@networksolutions.com, with a list in the body of the message detailing the domains (for which they are the registrant) that they wish to opt-out. ____________________ CPRM (Content Protection for Recordable Media) is a system for enforcing copy protection on personal computers, using digital rights management. It requires specially designed copying software that communicates directly with the disk drive. Schneier has a good overview on how it works in Crypto-Gram 2/15/2001 (in fact, that issue of Crypto-Gram was particularly good in terms of interesting content). Although CPRM is only supposed to be for flash memory, Scheneier claims that it is planned for IBM's tiny hard drive. ____________________ The Information Technology Information Sharing and Analysis Center (IT-ISAC) was formed, from nineteen technology companies, to share data on system vulnerabilities and Internet threats and work with the government to head off future cyberattacks on the group's members. ____________________ Princeton University's Ed Felten is not going to publish details about how he broke the Secure Digital Music Initiative (SDMI) watermark challenge, because of the prosecution provisions of 1998 Digital Millennium Copyright Act (DMCA). ____________________ A Linux worm called Ramen is working its way through the Internet. Default installations of Red Hat Linux are insecure, just like default installations of Windows (when you're dealing with consumers, you tend to make the same tradeoffs). Humorously, someone asked on cypherpunks how to get rid of the 'W32/Hybris-B' virus, and was told to install Linux. ____________________ Over the course of a few months, DirecTV surreptitiously broadcast, byte by byte, a program that allowed it to permanently disable pirate DirecTV access cards. On January 21st, they triggered the program, which wrote "GAME OVER" into an affected area of memory. It was supposed to knock out 98% of cracked cards. The attack was directed at the "H"-type smartcards, which were discontinued in 1999. The currently shipped cards, "HU"-type, are somewhat more difficult to hack, but hacked versions are available, and were not affected by the attack. Neither were emulation-based systems, where a PC with the appropriate hardware connector impersonates a hacked smart card. , ____________________ The Java 1.1 security database exposes the private keys used to sign applets, since it is generally left around unencrypted. < http://www.amug.org/~glguerin/security/jdk-1.1/exposure.html> ____________________ A crypto break of the IEEE 802.11 wireless LAN encryption protocol (WEP) shows that real-time decryption of traffic is possible. < http://www.isaac.cs.berkeley.edu/isaac/wep-faq.html> A response from the IEEE 802.11 Chair on WEP Security does not dispute the main facts. He says that WEP is designed to provide an equivalent level of privacy as is ordinarily present with a wired LAN, that the WEP attack would likely be more expensive than alternative attacks on the physical security of a facility, and that the choice of encryption algorithms by IEEE 802.11 are not purely technical decisions but they are limited by government export law restrictions as well. ____________________ The CIA wants to use Triangle Boy, a program by SafeWeb, to mask its movements on the Internet, so it can gather information incognito. The system can turn a personal computer into a surrogate Web server. It also allows users to navigate to any number of those PC addresses, and then go to the Web site they are seeking. The CIA wants a custom version so it can handle the CIA's encryption. It also wants to ensure that only its own employees and contacts can communicate via its version of Triangle Boy. Some observers suggest that the CIA's real interest is figuring out how to crack Triangle Boy and to thwart its use among the public. Seems like they could do that without a custom version. ____________________ University of California at Davis tech economist Frank Bernhard studied 3,000 U.S. firms and found that they lose 6 cents of each $1 of revenue because of hackers, which adds up to billions of dollars each year . ____________________ USA Today reported that terrorist Osama bin Laden is using the Internet to scramble messages for his network of operatives. Sixty Minutes II did a report featuring Phil Zimmerman, indicating that allowing people to encrypt their credit cards meant that this sort of use by terrorists also happened. I have no idea why Phil didn't start talking about PGP's use by freedom fighters and whistle blowers. ____________________ Daniel Bleichenbacher at Bell Labs determined that the DSA's random number generator is two times more likely to select a group of numbers from one range over the other. Attacking the flaw would take an immense amount of computing power. Bleichenbacher has developed a remedy for the DSA algorithm that would correct the bias.< http://www.infoworld.com/articles/hn/xml/01/02/05/010205hndsa.xml> ____________________ http://mast.mcafee.com/mast/mass_map.asp?track=1&period=3 is an entertaining map of density of virus infections. Unfortunately, it's not in percentages (just overall numbers of files or computers), and the USA is treated differently than all other countries (broken down by state). ____________________ Authorities used hidden cameras and face-recognition software as a security measure in Tampa during the week of the Superbowl. A police spokesman said 19 matches were made, of people who had not committed "significant" crimes. No arrests were made. ____________________ The Privacy Foundation is publicizing the possibility of using Javascript to "bug" a mail message that you send. There are at least two techniques to get a message to send it's current contents back to the originator. ____________________ David Farber (dave@farber.net) has completed his one year term as Chief Technologist at the FCC and is looking for his successor. It would be a person with a strong technical background in modern communications including the Internet who would like to spend a year (or so) in Washington. Academics are particularly welcome since there is a IPA path which can be used. A strong interest in interacting with economist, lawyers and policy people is really needed. The exposure is considerable since they would often be called upon to give speeches at key places. ____________________ SearchSpace claims that cell phone usage (the phone number, length of time, and time of day of a call) can be used to spot unusual usage and prevent cell phone fraud. Their system has pattern-recognition software built into intelligent agents. It reminds me a bit of the expert systems work American Express did for fraud detection ____________________ Simo-Pekka Parviainen of the University of Helsinki has written a master of law thesis entitled "Cryptographic Software Export Controls in the EU" (it is 144 pages PDF, in English) . ____________________ Hide your messages using spam steganography < http://www.spammimic.com/decode.shtml>. I wonder if spam can beat traffic analysis as well? ____________________ HotMail has been blocking their users from sending e-mail to peacefire.org addresses. If a user tried to send mail to a peacefire.org address from HotMail, they got a fake error message a day later saying that there was a problem on the recipient's end, when it was really HotMail blocking the message from being delivered. I had problems following the reasons for this in the Risks post; something about being in the same IP block as some other sites involved in a boycott. ____________________ A Cleveland company plans on opening the International Spy Museum in Washington in February 2002. < http://ap.tbo.com/ap/breaking/MGAK4J6H0IC.html> ____________________ ____________________________________________________________________ News Bits ____________________________________________________________________ Four items from the Center for Education and Research in Information Assurance and Security (CERIAS) at Purdue University: * Cipher readers may be interested in the report at this link: www.cerias.purdue.edu/events/summit_4q2000.php From that page: Extraordinary changes in the way we do business and lead our lives in the ever-connected world of the future will create tremendous security challenges. These challenges will be shaped by many of today's emerging trends: the rapid acceleration of network speed, connectivity and the overall number of devices; the removal of the human element from many everyday transactions; and easier and cheaper collection of public and private information. More than ever before, we will demand security solutions that enable businesses to thrive and private information to be protected. Accenture has just released the Security Call to Action and executive summary, from the 15 security experts who participated in the CERIAS Security Vision Roundtable. This two-day event, jointly sponsored by Accenture and the Purdue University CERIAS (Center for Education and Research in Information Assurance and Security), brought together both industry pioneers as well as information security leaders experts at some of the largest and most influential companies in the world. The report includes a Call to Action and a list of the key trends affecting security over the next decade. The bottom-line is that doing security right requires the greater community of business leaders, technologists, educators and political leaders to look seriously at this Call to Action and to commit resources and energy to help lead us all to a more secure world. Accenture is the new name for Andersen Consulting as of January 1, 2001. * This is a reminder that the deadline for registering for the Symposium on Requirements Engineering for Information Security (SREIS, March5-6, 2001) in approaching. See www.sreis.org/ for details. * The National Institute of Standards and Technology and the National Security Agency, under the auspices of the National Information Assurance Partnership (NIAP), will host an important high-level Government-Industry IT Security Forum on March 7, 2001 at the IUPUI Conference Center in Indianapolis, Indiana. Key leaders from government and industry will discuss critical issues relating to IT security requirements for COTS products, security testing and evaluation processes, insurance and auditing concerns, and research and development trends. There will also be a groundbreaking symposium on security requirements engineering hosted by Purdue University on March 5th and 6th at the same facility. Seating will be limited to the first 400 registrants so you are encouraged to register as early as possible. Details on the IT Security Forum can be found on the attached announcement or by visiting the NIAP web site at niap.nist.gov and following the links from the lead news article on the home page. * Professor Eugene Spafford's remarks made upon receiving the National Computer System Security Award at NISSC (October 2000) can be found at www.cerias.purdue.edu/homes/spaf/ncssa.html. Great reading! And congratulations to Spaf for recently being named an IEEE Fellow. * The next CERIAS on-line newsletter "About CERIAS" will be coming out within a few weeks. Visit www.cerias.purdue.edu/newsletter/ to subscribe. _______________________ Correspondence from Janos A. Csirik: In contrast with GSM, the 3GPP organisation (responsible for 3G wireless phone standards) is making all of its documents public. However, the way in which these documents are made public is unlikely to result in immediate gratification for those who would just like to go in and look at the crypto algorithms. For that reason, I have undertaken to construct a Web page to help cryptographers learn about and study the crypto algorithms for 3G wireless phones. I believe that the algorithms will receive much more and better scrutiny if it is easy to find them (and other 3G documents that are relevant to them). This page can be found at www.research.att.com/~janos/3gpp.html Thank you for your attention! Janos A. Csirik janos@research.att.com _______________________ News Bits contains correspondence, interesting links, non-commercial announcements and other snippets of information the editor thought that Cipher readers might find interesting. And, like a UCITA protected product, by reading the above page you have already agreed to not hold the editor accountable for the correctness of its contents. ==================================================================== Commentary and Opinion ==================================================================== Book reviews from past issues of Cipher are archived at www.ieee-security.org/Cipher/BookReviews.html, and conference reports are archived at www.ieee-security.org/Cipher/ConfReports.html. ____________________________________________________________________ Book review by Robert Bruen E-Mail Virus Protection Handbook by Brian Bagnall, Chris Broomes and Ryan Russell. Syngress 2000. 476 pages. Index, appendix. ISBN 1-918994-23-7. $39.95 Given the recent growth in virus problems, Melissa, I Love You and the Anna Kournikova picture, for example, I suspect that more people ought to have been reading the E-Mail Virus Protection Handbook. This book is comprehensive in its approach, explaining the background to each topic in clear enough terms for the average user who will read it. A Microsoft bias shows through the text, but Unix is addressed. This is appropriate given the number of MS related virus attacks vs. Unix related attacks, in spite of Ramen attacking Linux boxes. The first chapter does a good job explaining the basics, covering worms and viruses, trojans, spamming and the early history starting with the 1989 Morris Worm. Since this is a new book, chapter two is devoted to securing Outlook 2000. Since I have occasion to use Outlook 2000, I experimented with the suggestions for securing it. The suggestions were on target, as were the suggestions they made to increase the user awareness on how to approach implementing the suggestions. I find that MS explanations are generally incomplete, so it was helpful to know what the settings actually do. Chapter three covers Outlook Express 5.0 and Eudora 4.3 in the same manner. PGP recommended in both chapters, along with a brief introduction to public key encryption. The next chapter deals with web based mail, unfortunately the book was published before the layers problem was publicized, making the chapter a bit dated as soon as it hit the streets. Nevertheless, issues such as cookies, the old PHF bug and SSL are well presented. Sniffers are explained with example HTTP packets and several sniffers are mentioned. Web based mail is very popular, but many users do not seem to understand the dangers involved. This chapter would be useful for them. "Client-Side AntiVirus Applications" is a very useful chapter because the authors do a little consumer reports style writing. I especially liked the registry key and configuration settings changes that each produces when installed. The following chapter covers mobile code, the code that travels within the body of the mail, not an attachment. It could also be that the code resides somewhere else with just the reference to it within the email, probably Active-X controls or Java applets. Executable code connected in any way with email is a serious danger to your machine. The convenience of cool, dynamic email needs to be carefully weighed against that cool email deleting all your files. Firewalls are no longer new technologies, but personal firewalls are still growing in popularity, which makes chapter seven another helpful review of several products, free and otherwise. Although firewalls do no solve all our security problems, they are an important part of a complete package to protect you and your PC from those who lower moral standards than you. Some of the products covered are BlackICE, eSafe and Norton Personal Firewall. Firewalls these days do more than filter packets, some do content filtering and include anti-virus capabilities. The rest of the book is geared towards servers, Exchange Server, 2000 Advanced Server and even RedHat Linux 6.2. The Linux section is real limited and placed in relation to 2000 Advanced Server. Overall, the book is well constructed with useful technical information that should be understandable by average users. It is one of the better books I have seen on the the topic, which is clearly important today. I recommend reading it if you think you need to learn more about protecting yourself from email, and who doesn't. ____________________________________________________________________ Conference Report on WITS 2000 by Riccardo Focardi ____________________________________________________________________ The first "Workshop on Issues in the Theory of Security" was held in Geneva on 7-8 July 2000, co-located with ICALP'00 conference. It has been the first workshop of the "IFIP Working Group 1.7 on Theoretical Foundations of Security Analysis and Design". This Working Group has been recently founded to investigate the theoretical foundations of security. Its aim is to promote the discovery of new theoretical techniques in computer security and new ways to apply formal techniques systematically to develop security related applications. More information can be found at the IFIP WG 1.7 home page http://www.dsi.unive.it/IFIPWG1_7/ The workshop was an open event, and all the researchers working on the theory of computer security were invited to participate. The extended abstracts presented at the Workshop represent ongoing work, and the program has been designed to encourage discussion among attendees, both during and after the scheduled presentations. The Program Committee selected 20 out of 30 papers submitted. The main topics of the selected papers include: - formal definition and verification of the various aspects of security: confidentiality, integrity, authentication and availability; - new theoretically-based techniques for analyzing cryptographic protocols formally, and for designing them and their manifold applications (e.g., electronic commerce); - information flow modeling and its application to the theory of confidentiality policies, composition of systems, and covert channel analysis; - formal techniques for analyzing and verifying mobile code. There were 30 participants from 8 different countries: Belgium, Denmark, France, Germany, Italy, Switzerland, United Kingdom, USA. The collection of extended abstracts presented at WITS '00 is available at the workshop home page: http://www.dsi.unive.it/IFIPWG1_7/wits2000.html Papers: ------ "Extending Formal Cryptographic Protocol Analysis Techniques for Group Protocols and Low-Level Cryptographic Primitives", Catherine Meadows. Group protocols, i.e., protocols which involve the communications among a set of principals which could be arbitrarily large, are usually difficult to analyze as even legal executions can take an unbounded number of steps. Also the introduction of low-level features of cryptographic algorithms (e.g., commutativity and distributivity of RSA) complicates the analysis a lot. This paper presents an extension of the NRL Protocol Analyser language construct, called parametrized language, which allow to prove properties of group protocols which use non-standard cryptographic primitives, thus allowing a formal analysis. In particular, a parametrized language allows to put conditions on the encryption keys, on the encrypted messages and also on the inputs to any operation defined in the language. "Paths through Well-Behaved Bundles", Joshua D. Guttman and F. Javier Thayer Fábrega, reports a new method for reasoning about cryptographic protocols within the strand space model. The method is based on two main ideas: paths and well-behaved bundles. A path is a sequence of nodes where two consecutive nodes represent either a message transmission between two principals or a sequential execution of one principal (starting with a message reception and ending with a message transmission). Some interesting paths are identified: pedigree paths, which are useful to track the origin of a value, and penetrator paths, corresponding to penetrator activity. A well-behaved bundle is induced by an equivalence relation which identifies bundles which only differ in the penetrator nodes. This allows to define normal bundles where every destructive penetrator action precedes every constructive one. Every bundle is proved to be equivalent to a normal one. "Protocol Composition and Correctness", Nancy Durgin, John Mitchell and Dusko Pavlovic, introduces a new model, called Cords, for reasoning about cryptographic protocols. Cords basically extend the strand space model by introducing variables that are instantiated upon receipt of a message. The aim is to better model the dynamics of communications which is now reflected in the substitution mechanism, similarly to, e.g., process algebraic approaches. One of the main motivation for this work is to obtain a method for assembling protocols from previously identified parts and also compositionally assemble protocol correctness proofs. "Hardest Attackers", Hanne R. Nielson and Flemming Nielson, points out two different causes of undecidability of security properties: (i) the presence of an infinity of malicious attackers, (ii) the fact that even in the presence of one single attacker, the property to be checked is likely to be undecidable. The second point can be solved by approximating the property in a way that always "err on the safe side", as done in typical static analysis techniques. The first point is approached in this paper by identifying a hardest attacker. Intuitively, a hardest attacker is as hard to protect against as any of the infinity of attackers. An important distinction is made between hardest attacker and complete attacker, as the former one is identified with respect to the static analysis rather than the semantics, i.e., it might not be a successful attacker with respect to the semantics. "Security Analysis for Mobile Ambients", Francesca Levi and Chiara Bodei. Safe Ambients (SA) is an extension of Mobile Ambients (MA) where a movement can take place only if the involved ambient agrees. Here, a control flow analysis previously proposed for MA is extended to SA. The technique is then applied to prove a secrecy property: ambients are classified as trustworthy and untrustworthy and secrecy is guaranteed only if untrustworthy ambients can never open trustworthy ones. A most hostile context (matching some requirements) is defined. Similarly to the previous talk, if a process P passes the test with this most hostile context E, then P will do so, when plugged in any other context represented by E. "Secure Safe Ambients and JVM Security", Michele Bugliesi and Giuseppe Castagna, presents a typed variant of SA (see also the previous talk): the Secure Safe Ambients (SSA). The type system allows to express and verify behavioural invariants of ambients. In particular, the types of ambient names are protection domains that group ambients sharing common security policies. As an example, it is possible to specify that a protection domain D should not be entered by any ambient, by stating that no ambient outside D may exercise the capability "in d" (which moves the executing ambient into ambient d) for any d of type D. A distributed version of the calculus is also studied, where no assumption is initially made on the well-typedness of external ambients, and a sort of proof-carrying-code ambients are introduced to allow the verification of entering ambients. "Mobile Functions and Secure Information Flow", Dilsun Kirli. This work focus on the problem of secrecy within the framework of Mobile-l (Mobile-lambda), a higher-order mobile code language. In this language, some constructs for the transmission and reception of values are introduced in the functional core and mobile processes are represented by mobile functions. An information flow property for Mobile-l is identified and a suitable type system to enforce the property is proposed. As this type system follows the type and effect discipline, providing ML-style polymorphism becomes a natural extension of earlier work in this field. "Considering Non-Malleability in Formal Models for Cryptographic Protocols", Carsten Rudolph. Many models for specification of cryptographic protocols assume that cryptography is perfect, i.e., that encryption and decryption are possible only knowing the correct keys. However, there exist attacks which exploit particular weakness of cryptographic algorithms. Thus, it could be of interest to consider properties of encryption schemes inside the specification abstract model. This paper considers the non-malleability property of encryptions schemes which ensures the attacker's inability, given a ciphertext y, to output a different ciphertext y' such that the relative plaintexts x, x' are related in some way. Two examples are given to show that non-malleability is indeed relevant in the proof of protocol correctness. "On the Perfect Encryption Assumption", Olivier Pereira and Jean-Jacques Quisquater. Also this work is about weakening the perfect cryptography assumption. It is proposed a model that takes into account the multiplicative structure of RSA, which is able to identify a particular kind of attack on the fixed Needham-Schroeder public key protocol. Such a model has been also specified in Promela (the specification language of SPIN), thus allowing an automatic detection of attacks similar to the one reported in the paper. "Decorrelation: a New Theory for the Security of Conventional Encryption", Serge Vaudenay. The security of conventional cryptographic primitives (e.g. block ciphers) is often approached by showing that some particular kind of cryptanalysis cannot work. Decorrelation theory follows a different, more general, idea as it allows to prove security against a distinguisher which models an idealized attacker. In other words, a conventional cryptographic primitive is secure if no Turing machine can distinguish it from a canonically idealized primitive. Decorrelation theory basically defines a measure of the distance of a cryptographic primitive from the idealized one. Through the results of decorrelation theory (e.g., multiplicative properties of the distance) it is thus possible to define explicit block ciphers with low distance from idealized primitives. "On the Reachability Problem in Cryptographic Protocols", Roberto Amadio, Denis Lugiez and Vincent Vanackere, studies secrecy and authentication properties of (symmetric key based) cryptographic protocols. The verification task is formulated as a reachability problem, i.e., a problem of determining if the protocol (model) can reach a certain point while interacting with the environment. The proposed decision procedure is based on a symbolic reduction system. Finally, a prototype has been implemented where the symbolic method is extended also to public keys and hash functions. "A B Automaton for Authentication Process", Stéphanie Motré. This work focus on authentication policies and processes. It proposes to use security automata to model an authentication process, i.e., all the possible states of the process are considered and the (authentication) events determine a transition from a state to another one. The main motivation is to give a simple way of specifying a particular process that can be useful for proving the correctness of the process with respect to the corresponding authentication policy. This model is integrated in the B method. During the talk some examples of application of the method have been presented. "Discretionary Access Control with Code Migration", Chiara Polloni and Corrado Priami. Code migration introduces new issues in dealing with security, e.g., mobile agents have to be identified by the hosts which establish capabilities and resource consumption limits. The paper proposes a method for discretionary access control for mobile agents. In particular any hosts and sites decide the access rights to their resources. This is formalized together with the conditions for agent migration. The original contribution is a direct handling of multi-hop code migration. "A New Definition of Multilevel Security", Riccardo Focardi, Roberto Gorrieri and Roberto Segala. Usually information flow security is modeled though Non-Interference, i.e., if no interference is possible from a group of users (high level) to another one (low level) than no information flow is present. This indirectly solves the problem of modelling information flow. This paper proposes a reversed (more direct) approach: it is identified a particular process representing an explicit (forbidden) information channel from high level to low one; this induces a family of properties which guarantee the absence of such a particular information flow. As there are different possible channels corresponding to different notions of information flow, the aim is to classify existing information flow properties with respect to which channels they are able to rule out, i.e, with respect to which kind of information flow they indeed avoid. "Towards Automatic Synthesis of Systems without Information Flows", Fabio Martinelli. This work is about automatic synthesis of secure systems, i.e., systems with no forbidden information flows. The main idea is that the analysis of secure systems is treated as the analysis of open systems, i.e., systems which have some unspecified components. As a matter of fact, the potential attackers (e.g., intruders on networks and Trojan horses in systems) are not known a-priori and it is thus convenient not to specify them. In this way, the resulting open system can be proved secure with respect to every possible potential attacker. This approach indeed allows the synthesis of secure systems. As an example it is shown how to modify an existing system to make it secure, e.g., by inserting new components. "Multiple Security Policies in Mob_adtl", Gianluigi Ferrari, Carlo Montangero, Laura Semini and Simone Semprini. Mob_adtl is a temporal logic based model for the specification and the design of networking applications where different security requirements coexist. In this model a system is based on a set of elaboration nodes (called neighborhoods) each having internal security requirements enforced by authorities called guardians. In this work it is exploited the Mob_adtl framework to specify security policies able to control the movements of agents among neighborhoods. In particular it is described how to give guardians the ability of control agents movements among neighborhoods according to their history. "Probabilistic Security Analysis in a Declarative Framework", Alessandra Di Pierro, Chris Hankin and Herbert Wiklicky. This work develops a methodology for the security analysis of programs similar to classical program analysis methods. Both Shannon's and Scott's notions of information are considered by choosing a probabilistic extension of a declarative programming language, the Probabilistic Concurrent Constraint Programming (PCCP) developed by the authors in previous papers. A property of probabilistic confinement is presented which is related to previous work by, e.g., Volpano and Smith and also Sands and Sabelfeld. The main difference is that here a declarative programming paradigm is considered instead of an imperative one. "Dolev-Yao is no better than Machiavelli", Paul Syverson, Catherine Meadows and Iliano Cervesato. In this work it is shown that attacks mounted by a traditional Dolev-Yao intruder can be enacted by a (apparently weaker) "Machiavellian" adversary, in which compromised principals do not share long-term secrets and do not send arbitrary messages, i.e., messages with a different structure with respect to the legitimate messages of the protocol. It is also shown that a Dolev-Yao adversary composed of multiple compromised principals is attack-equivalent to an adversary consisting of a single dishonest principal who is only willing to produce messages in valid protocol form. These results hold for common authentication protocols, where long-term keys are never transmitted. Establishing the equivalence of intruder models is non-trivial and is useful when security properties have to be checked against the "hardest attacker" (see also the previous talk by Nielson and Nielson). "A Game Approach to the Verification of Exchange Protocols - Application to Non-Repudiation Protocols", Steve Kremer and Jean-François Raskin. Exchange protocols usually require some non-repudiation guarantees, i.e, the parties should not deny having sent or received a message (e.g., a payment or a receipt). When these protocols are analyzed the usual model of the external intruder (with two honest parties) cannot be directly applied as one of the parties could cheat in order to get an advantage in the exchange. This work proposes to model such protocols by considering the actions that are possible with no predefined order of execution. Then, each entity and each communication channel is viewed as a player. In this context the required properties becomes "strategies" and both adversarial and cooperative behaviours between entities is taken into account. "Possibilistic Information Flow is Safe for Probabilistic Non-Interference", David Clark, Chris Hankin, Sebastian Hunt and Rajagopal Nagarajan, studies the problem of analysis and detection of probabilistic cover channels. In previous papers, Sabelfeld and Sands have given a semantic characterization of probabilistic non-interference and used it to give correctness proofs of type-based systems proposed by Volpano and Smith. Here, it is shown that it is possible to use possibilistic information flow analysis to check probabilistic non-interference, i.e., the absence of information flow implies the absence of interference. The technique is applied to the analysis of Probabilistic Idealised Algol, and is based on control flow analysis which allows to construct (an analogue of) higher-order flowcharts introduced by one of the authors in previous work. ____________________________________________________________________ Conference Report on NSPW 2000 by Brenda Timmerman ____________________________________________________________________ A note on the New Security Paradigms Workshop (NSPW) The Call for Papers & Participation for NSPW2001 has been published at http://nspw.org 2001 is the tenth anniversary of the New Security Paradigm Workshop, a productive and interactive forum for innovative new approaches to computer security. NSPW2001 will be held September 11 - 13th at Cloudcroft, New Mexico. The deadline for submissions is March 30, 2001 by email or March 23 for hard copies. As the deadline for submissions is rapidly approaching, a review of NSPW2000 may be of interest to CIPHER readers. (NSPW) 2000 was held in Cork, Ireland, September 19-21, 2000. The goals of the Workshop are to provide a forum for papers that may not fit in with more traditional venues, e.g. innovative approaches to older problems and early thinking on new topics that might not be fully developed. New approaches to controversial topics are welcomed. The participants at the workshop were limited to those whose submissions were accepted, or who served on one of the Workshop committees, and included an interesting mix of representatives from industry, government, and education, both from the US and international. The workshop was convened by the Co-Chairs Mary Ellen Zurko of Iris Associates and Steven Greenwald an Independent Consultant from Miami, Florida. The first session, Modeling for Attacks, led by Susan Pancho of Cambridge University, addressed new approaches to security threats including attack net penetration testing, keeping data on cyber adversaries from SRI International, and a requires/provides model for computer attacks. The session on Information Hiding introduced a new paradigm from NRL for encryption hidden in stenography, the science of transmitting a message between two entities such that an intruder will not even be aware that the message exists. There was also a proposal for an innovative approach using natural language processing for information assurance presented by Victor Raskin, a prominent linguist from Purdue University. A session that caused active debate among the participants was entitled Active Defense. It included a proposal for dynamic analysis of security protocols and a controversial proposal for disarming computers by equipping them with tools that turn off their attacking capabilities in order to disallow their being used as "zombies" in distributed denial of service attacks. The presentation was made by Danilo Bruschi and Emilia Rosti from Universita' degli Studi di Milano The session entitled Customizing Security included an approach to security that took into account the different needs of protected systems, Quality of Security Service (QOSS), analogous to quality of service technology, from the Naval Postgraduate School, and a method for characterizing the behavior of programs using multiple length N-grams presented by Carla Marceau of ORA. Every year NSPW features a two hour discussion session. This year the discussion entitled Apres DDOS, was a lively debate of new paradigms for incident management and discussed the different layers of identity that exist in networks. The last session, Getting Personal, chaired by Mike Williams, included a proposal for security in Palm Pilots, Conduit Cascades and Security Synchronization, by Simon Foley of Cork University and a multilateral approach to balanced security by Kai Rannenberg of Microsoft Research at Cambridge. Cyber readers who are thinking about innovative approaches to computer security and want some feedback on their ideas should consider submitting a paper or discussion proposal to NSPW2001. Brenda Timmerman, California State University, Northridge Co-Chair Program Committee, NSPW2000 and 2001 ==================================================================== Staying in Touch ==================================================================== ____________________________________________________________________ Information for Subscribers and Contributors ____________________________________________________________________ SUBSCRIPTIONS: Two options: 1. To receive the full ascii CIPHER issues as e-mail, send e-mail to (which is NOT automated) with subject line "subscribe". 2. To receive a short e-mail note announcing when a new issue of CIPHER is available for Web browsing send e-mail to (which is NOT automated) with subject line "subscribe postcard". To remove yourself from the subscription list, send e-mail to cipher@issl.iastate.edu with subject line "unsubscribe". Those with access to hypertext browsers may prefer to read Cipher that way. It can be found at URL www.ieee-security.org/cipher.html CONTRIBUTIONS: to cipher@issl.iastate.edu are invited. Cipher is a NEWSletter, not a bulletin board or forum. It has a fixed set of departments, defined by the Table of Contents. Please indicate in the subject line for which department your contribution is intended. For Calendar entries, please include a URL and/or e-mail address for the point-of-contact. For Calls for Papers, please submit a one paragraph summary. See this and past issues for examples. ALL CONTRIBUTIONS CONSIDERED AS PERSONAL COMMENTS; USUAL DISCLAIMERS APPLY. All reuses of Cipher material should respect stated copyright notices, and should cite the sources explicitly; as a courtesy, publications using Cipher material should obtain permission from the contributors. ____________________________________________________________________ Recent Address Changes ____________________________________________________________________ Address changes from past issues of Cipher are archived at www.ieee-security.org/Cipher/AddressChanges.html ==================================================================== Interesting Links and Reports Available via FTP and WWW ==================================================================== "Reports Available" links from previous issues of Cipher are archived at www.ieee-security.org/Cipher/NewReports.html and www.ieee-security.org/Cipher/InterestingLinks.html ==================================================================== Reader's Guide to Current Technical Literature in Security and Privacy, by Anish Mathuria ==================================================================== The Reader's Guide from Past issues of Cipher is archived at www.ieee-security.org/Cipher/ReadersGuide.html ==================================================================== Listing of academic positions available by Cynthia Irvine February 20, 2001 ==================================================================== University College Cork, National University of Ireland, Cork, Cork, Republic of Ireland Professor and lecturer positions available. Positions close: 31 March 2001. www.cs.ucc.ie/vacancies.html Information Security Group, Royal Holloway, University of London, Egham, Surrey, United Kingdom Post-doctoral Research Assistant (Biometric system on a smart card) Position closes: 23 March 2001. isg.rhbnc.ac.uk/ISG_Jobs.htm Information Security Group, Royal Holloway, University of London, Egham, Surrey, United Kingdom Two lectureships in Information Security (tenured positions) Position closes: 14 March 2001. isg.rhbnc.ac.uk/ISG_Jobs.htm Information Security Group, Royal Holloway, University of London, Egham, Surrey, United Kingdom Post-doctoral Research Assistant (USB_Crypt Project) Position closes: 28 February 2001. isg.rhbnc.ac.uk/ISG_Jobs.htm Information Security Group, Royal Holloway, University of London, Egham, Surrey, United Kingdom Post-doctoral Research Assistant (PKI) Position closes: 16 February 2001. isg.rhbnc.ac.uk/ISG_Jobs.htm Department of Information and Software Engineering, George Mason University, Fairfax, VA 1 Tenure-track and 1 visiting position in security (05/01/00) Areas of particular interest: Computer security, networking, data mining and software engineering. Search will continue until positions are filled. ise.gmu.edu/hire/ Department of Computer Science, Purdue University, West Lafayette, IN Emphasis on Assistant Professor Positions, but more senior applicants will be considered. Areas of particular interest: Computer security, and INFOSEC. Positions beginning August 2000. www.cs.purdue.edu/announce/faculty.html Department of Computer Science, Renesselaer Polytechnic Institute, Troy, NY Tenure Track, Teaching, and Visiting Positions Areas of particular interest: Computer security, networking, parallel and distributed computing and theory. Positions beginning Fall 2000. www.cs.rpi.edu/faculty-opening.html Swiss Federal Institute of Technology, Lausanne (EPFL), Switzerland/Eurecom/Telecom Paris General Director Areas of particular interest: Education and research in telecommunications. Applications begin immediately. admwww.epfl.ch/pres/dir_eurecom.html Department of Computer Science, Naval Postgraduate School, Monterey, CA Junior and Senior Tenure Track Positions in Professorship Areas of particular interest: Computer Security, but applicants from all areas of Computer Science will be considered. Applications begin immediately and are open until filled. apache.cs.nps.navy.mil/app/ Department of Computer Science, Florida State University, Talahassee, FL Tenure-track positions at all ranks. Several positions available. (1/00) Areas of particular interest: Trusted Systems, security, cryptography, software engineering, provability and verification, real-time and software engineering, provability and verifications, real-time and safety-critical systems, system software, databases, fault tolerance, and computational/simulation-based design. www.cs.fsu.edu/positions/ Naval Postgraduate School Center for INFOSEC Studies and Research, Monterey, CA, Visiting Professor (Assistant, Associate, or Full Professor levels) (9/98) Areas of particular interest: Computer and information systems security. cisr.nps.navy.mil/jobs/npscisr_prof_ad.html This job listing is maintained as a service to the academic community. If you have an academic position in computer security and would like to have in it included on this page, send the following information: Institution, City, State, Position title, date position announcement closes, and URL of position description to: irvine@cs.nps.navy.mil ==================================================================== Information on the Technical Committee on Security and Privacy ==================================================================== ______________________________________________________________________ How to become <> a member of the IEEE Computer Society's TC on Security and Privacy ________________________________________________________________________ You do NOT have to join either IEEE or the IEEE Computer Society to join the TC, and there is no cost to join the TC. All you need to do is fill out an application form and mail or fax it to the IEEE Computer Society. A copy of the form is included below (to simplify things, only the TC on Security and Privacy is included, and is marked for you). Members of the IEEE Computer Society may join the TC via an https link. The full and complete form is available on the IEEE Computer Society's Web Server by following the application form hyperlink at the URL: computer.org/tcsignup/ IF YOU USE THE FORM BELOW, PLEASE NOTE THAT THE IT IS TO BE RETURNED (BY MAIL OR FAX) TO THE IEEE COMPUTER SOCIETY, >>NOT<< TO CIPHER. --------- IEEE Computer Society Technical Committee Membership Application ----------------------------------------------------------- Please print clearly or type. ----------------------------------------------------------- Last Name First Name Middle Initial ___________________________________________________________ Company/Organization ___________________________________________________________ Office Street Address (Please use street addresses over P.O.) ___________________________________________________________ City State ___________________________________________________________ Country Postal Code ___________________________________________________________ Office Phone Fax ___________________________________________________________ Email Address (Internet accessible) ___________________________________________________________ Home Address (optional) ___________________________________________________________ Home Phone ___________________________________________________________ [ ] I am a member of the Computer Society IMPORTANT: IEEE Member/Affiliate/Computer Society Number: ____________________ [ ] I am not a member of the Computer Society* Please Note: In some TCs only current Computer Society members are eligible to receive Technical Committee newsletters. Please select up to four Technical Committees/Technical Councils of interest. TECHNICAL COMMITTEES [ X ] T27 Security and Privacy Please Return Form To: IEEE Computer Society 1730 Massachusetts Ave, NW Washington, DC 20036-1992 Phone: (202) 371-0101 FAX: (202) 728-9614 _____________________________________________________________ TC Publications for Sale _____________________________________________________________ Proceedings of the IEEE CS Symposium on Security and Privacy The Technical Committee on Security and Privacy has copies of its publications available for sale directly to you. Proceedings of the IEEE Symposium on Security and Privacy -------------------------------------- 2000 $25.00 1999 -- SOLD OUT -- 1998 $15.00 For domestic shipping and handling, add $3.20 (3 volumes or fewer). For overseas delivery: -- by surface mail, please add $5 per order (3 volumes or fewer) -- by air mail, please add $10 per volume If you would like to place an order, please specify * how many issues you would like, and * where to send them, and * the shipping method (air or surface) for overseas orders. For mail orders, please send a check in US dollars, payable to the "2000 IEEE Symposium on Security and Privacy" to: Brian J. Loe Treasurer, IEEE TC on Security and Privacy Secure Computing Corp. 2675 Long Lake Rd. Roseville, MN 55113 U S A For electronic orders, in addition to the information above, please send the following credit card information to brian.loe@computer.org: - the name of the cardholder, - type of card (VISA, Mastercard, American Express, and Diner's Club are accepted) - credit card number, and - the expiration date. You may use the following PGP public key to encrypt any information that you're not comfortable sending as cleartext. -----BEGIN PGP SIGNATURE----- Version: 4.0 Business Edition iQCVAwUBOSVyE0y6WVOs56vlAQFVRwQAg3/SovqmTqWKCExfeTDkgMaFpkOGRKpo A/p5c/oSrg8g2ev7GBllKz+e3/frSi27pyA5HBxXzm5tnqnCafjS1Fub8S7XepWo opI/lPGGXRmHHlBDNQ+58ui5/SH68cT64auBbYmvhh8YQqJJnoieMMWDlU3fvR/y RynPbZ2hMn0= =FL5l -----END PGP SIGNATURE----- -----BEGIN PGP PUBLIC KEY BLOCK----- Version: 4.0 Business Edition mQCNAy+T6TkAAAEEAN/fnVu7VCPtcmBQhXFhJbejSoZJkEmWNUYvx13yRwl/gyir 61ae+GUjgWjWs9O06C6dugRGrjFZpBhMosu7sgGJMz54hvKbBNrYBSHpH0yex6e/ +c2mzbCbh40naARgPAaAki2rCkV2ryETj2Z6w98/k5fMgOZDnEy6WVOs56vlAAUR tBtCcmlhbiBKLiBMb2UgPGxvZUBzY3RjLmNvbT6JARUDBRA5FvlSehjn4trNNnMB AVulCAC/cqeBfMVohQqSZSHsaBudKUaKRCbH9PoKB0xr2SkmI/XYTzm6X7Cc+CXb hfcO/t++p1IscnB9Ne7Qa/MYqTD3zzgp/x/xor0bHnLSLGlVCN3XoRr3oxWuGOE9 Bul85Jse5V3FqMjsnGzm3PFRnYEJ9EPfTbWLnmmPteNSCwzFJe0z2nSAWbW+X4BQ W6qN/5SHFWQ/0xcpSWte7TD98BDpZl12ow3W+NY1P01AYfby0IthvuPL7PMrcOgV cGz8sBflkF4QbL/CJW42oPjztvj+Ks+I2b1W9oSJgX5fPeU9hcsPg3wVO5o3/Mdb lEtBSrdQfnbfOpiEm16/CK3OGr3NiQB1AwUQL5UPKjVOHVCprfxtAQG2tgMAruPD qtQzxJVdegzUG+0r0AMEDxmGDN84PUU9AMhXl2owR2/TthpDpmovMq8ibeLd0PGk NgXJFlLHJNvU09jP1O4TqwvoSTzG84qm8OY7kfdOqY7PTsz0keT7WgFuuglKiQCV AwUQL5UOenp25Pxx+Z6ZAQH5MAP/c1SngCYf1+Ks1M2Cbf8PR4t5hQAM5tGFHA8J zS5L/3NZNyoNAD4fgRm62xr8trFWtT4BSmZboXgqklTvwbQKWn90EsoKEtdfJNtJ swVNkLF/SjLyes/J6HEgllPUaKVIq5PM8AIrKsAKvHZoDcDbDH8QypnQsdxYhOOh a0pxCpaJAJUDBRAvlCiXTLpZU6znq+UBAdmiA/9eq6niZHHykR/27P9chkqhYLuq /E1CirA+aYP73OdbfXeV+vwDxr9Zzv2iTra/DUNyJzU7JelWRFlov+k7yiO6Pr7j bWeqms0WYsQV30jIelBs6w34A4CC1bnuHxt6gKxd63EZCqhVsZV+GN3pGfL2CQBc mraYYRb4Q1+gSocsAIkAdQMFEDXRyzCbYv3kpAuW2QEBv+AC/jDstmZP0UTTwixB htVd50TqxE0vU/g6YC6sKg1wyHNlYEvwP0xRsM1P+Qs1603SV6TarP8q5AQVMuwg 1qQxxuThCAG/hXcsI5t/5pbMTQSAMUkZQHittS69sSQtNSd+R7QlQnJpYW4gSi4g TG9lIDxicmlhbi5sb2VAY29tcHV0ZXIub3JnPrQmQnJpYW4gSi4gTG9lIDxsb2VA c2VjdXJlY29tcHV0aW5nLmNvbT4= =PUX1 -----END PGP PUBLIC KEY BLOCK----- You may also order some back issues from IEEE CS Press at www.computer.org/cspress/catalog/proc9.htm. Proceedings of the IEEE CS Computer Security Foundations Workshop The most recent Computer Security Foundation Workshop (CSFW13) took place the 3rd through 5th of July 2000 in Cambridge, UK. Topics included formal specification of security protocols, protocol engineering, distributed systems, information flow, and security policies. Copies of the proceedings are available from the publications chair for $25 each. Copies of earlier proceedings starting with year 5 are available at $10. Photocopy versions of year 1 are also $10. Checks payable to "Joshua Guttman for CSFW" may be sent to: Joshua Guttman, MS A150 The MITRE Corporation 202 Burlington Rd. Bedford, MA 01730-1420 USA guttman@mitre.org ________________________________________________________________________ TC Officer Roster ________________________________________________________________________ Chair: Past Chair: Thomas A. Berson Charles P. Pfleeger Anagram Laboratories Arca Systems, Inc. P.O. Box 791 8229 Boone Blvd, Suite 750 Palo Alto, CA 94301 Vienna VA 22182-2623 (650) 324-0100 (voice) (703) 734-5611 (voice) berson@anagram.com (703) 790-0385 (fax) c.pfleeger@computer.org Vice Chair: Chair,Subcommittee on Academic Affairs: Michael Reiter Prof. Cynthia Irvine Bell Laboratories U.S. Naval Postgraduate School 600 Mountain Ave., Room 2A-342 Computer Science Department Murray Hill, NJ 07974 USA Code CS/IC Monterey CA 93943-5118 (908) 582-4328 (voice) (408) 656-2461 (voice) (908) 582-1239 (fax) irvine@cs.nps.navy.mil reiter@research.bell-labs.com Newsletter Editor: Jim Davis Department of Electrical and Computer Engineering 2413 Coover Hall Iowa State University Ames, Iowa 50011 (515) 294-0659 (voice) davis@iastate.edu Chair, Subcommittee on Standards: Chair,Subcomm.on Security Conferences: David Aucsmith Jonathan Millen Intel Corporation SRI International EL233 JF2-74 Computer Science Laboratory 2111 N.E. 25th Ave 333 Ravenswood Ave. Hillsboro OR 97124 Menlo Park, CA 94025 (503) 264-5562 (voice) (650) 859-2358 (voice) (503) 264-6225 (fax) (650) 859-2844 (fax) awk@ibeam.intel.com millen@csl.sri.com BACK ISSUES: Cipher is archived at: www.ieee-security.org/cipher.html ========end of Electronic Cipher Issue #41, February 20, 2001===========