______________________________________________________________________________ ______________________________________________________________________________ IACR Newsletter Vol. 18, No. 3, Fall 2001. Published by the International Association for Cryptologic Research Christian Cachin, Editor ______________________________________________________________________________ ______________________________________________________________________________ http://www.iacr.org/newsletter/ ______________________________________________________________________________ Contents ______________________________________________________________________________ * Editorial * IACR 2001 election deadline extended * IACR 2001 election candidates * David Chaum to hold 2002 IACR Distinguished Lecture * New Reports in the Cryptology ePrint Archive * Crypto 2001 Rump Session * Announcements + Contemporary Methods in Cryptography, Institute For Pure and Applied Mathematics, UCLA * New Books * Open Positions * Calender of Events in Cryptology * IACR Contact Information ______________________________________________________________________________ Editorial ______________________________________________________________________________ Welcome to the 10th electronic issue of the IACR Newsletter! The events of September 2001 in the U.S. and in the middle east will influence the future of cryptologic research. Once more, the power of cryptography is discussed in the media and by parlaments. Fortunately, public knowledge about cryptography seems good enough today so that the call for "backdoors" in all encryption programs is widely recognized as infeasible. At least the first voices who proposed such measures did not find an echo. But cryptology researchers should not lean back: we still have to keep our eyes open and actively engage in protecting free research in cryptology, and also in related areas like computer security. For one, the September events have already distracted from the hottest crypto-political discussion topic in 2001 until August: digital content protection, the DMCA, Napster etc. But another area to watch closely is the debate about privacy -- it has not become any easier. This newsletter issue contains updated information on the IACR 2001 elections, which suffer from the current delays in the postal system, and the announcement of an important new book about the foundations of cryptography. As always, you are welcome to send your contributions to the Newsletter to newsletter@iacr.org The next issue of the IACR Newsletter is scheduled for publication in February 2002. However, announcements will be posted on the IACR Website as soon as possible. Christian Cachin IACR Newsletter Editor P.S. If you have not received the IACR Newsletter by email and would like to receive it in the future, then please make sure that the IACR membership directory contains your current email address. A printed copy of the membership list is mailed yearly to all members (last in the fall of 2001). ______________________________________________________________________________ IACR 2001 Election Deadline Extended to 14 December ______________________________________________________________________________ Dear IACR Member, IMPORTANT Because of postal delays, the Election Committee has extended the deadline for returning your ballot in the IACR 2001 election by one month. THE NEW DEADLINE IS 14 DECEMBER. * If you have received your ballot, vote now. Do not delay. * If you have not received your ballot, vote as soon as it arrives. BACKGROUND Ballots were mailed to more than 1000 members from Santa Barbara on 2 and 3 October. First Class and Drop Ship Air Mail was used. It was clear to the Election Committee almost immediately that there are problems with the mails. We believe that the September and ongoing anthrax attacks have perturbed the world's postal systems. Some outgoing mail was delayed, and we expect that the return of some ballots will also be delayed. After consultation with the Board of Directors we have decided to extend the election by four weeks. We believe that this extension will allow many ballots to be counted which otherwise would have been late. We know that this is an extraordinary measure, but we feel that it is better to adapt to extraordinary circumstances than to be inflexible about schedule. The election will be completed and the results announced before 31 December so that the newly elected officers can take their positions effective 1 January 2002. We are committed to running an election which is fair, representative, orderly, and responsive to the needs of IACR members. To help us measure the problem, members whose ballots have not yet arrived are invited to send an email to iacr@cs.fsu.edu with the subject "Ballot not received". Sincerely yours, --IACR Election Committee Tom Berson (Chair) Yvo Desmedt (Returning Officer) Rebecca Wright ______________________________________________________________________________ IACR Election 2001 Candidates' Statements ______________________________________________________________________________ Election is being held for IACR President, Vice President, Secretary, Treasurer, and three (3) Directors. Those elected will serve from 1 January 2002. Ballot materials were sent by post from California to every member on 1 October 2001. Completed ballots must be received by the Returning Officer no later than 14 December 2001. (This is the extended deadline.) Names on the ballot are presented in a shuffled order. Candidates' statements (in the same order) may be found on this page. Links, if any, to [Home Page] and [Longer Statement] are those provided by each candidate. ---------- Candidates for President --------- Andrew Clark: I have served on the Board of I.A.C.R. for the past nine years, six as Vice-President. I can serve the membership well if elected as President through my proven track record and commitment to new ideas like electronic publishing and online registration for conferences. Read my full statement at [1]http://www.primarykey.co.uk/Andy/ajcvote1.htm. [[2]Home Page] [[3]Longer Statement] Donald Beaver: As researcher, director, and previous conference chair, I see pressing challenges. Our thousand-strong organization requires revised logistical management. The flagship conferences must maintain a cohesive view of our maturing field, with specialized workshops supporting growth. We must handle chilling effects of political developments on basic research without compromising diverse viewpoints. [Home Page] [Longer Statement] ---------- Candidate for Vice President --------- Bart Preneel: I am a member since 1989 and a Director since 1997. I will contribute my experience to further the goals of the IACR. We should focus on: 1. scientific quality of conferences and publications, 2. enhancing international participation and integration of workshops, 3. making further progress in electronic publishing, 4. protecting free research in cryptology. [[4]Home Page] [[5]Longer Statement] ---------- Candidate for Secretary --------- Josh Benaloh: I have had the privilege and pleasure of serving as IACR Secretary since January 1999 and seek the opportunity to continue serving in that role at a time when many IACR Officers and Directors will be changing. For details on my research and service, please see [6]http://research.microsoft.com/~benaloh. [Home Page] [Longer Statement] ---------- Candidate for Treasurer --------- Susan Langford: I have appreciated the opportunity to serve as treasurer. If elected, I will continue the long-standing policy of being fiscally conservative, while fully supporting the IACR's mission. I hope you will give me the opportunity to continue to serve the community. Thank you. [Home Page] [Longer Statement] ---------- Candidates for Director --------- Eli Biham: I will continue to support enhancing the IACR publications, including electronic publishing, conferences and workshops, and easing entry of young researchers to cryptology. [[7]Home Page] [Longer Statement] Yuliang Zheng: Having worked in Asia, Australia and the US, as well as being a co-founder of the PKC workshop, I have experience in working very well with colleagues from different backgrounds. If elected, I will endeavor to promote collaboration among researchers from all parts of the world. [[8]Home Page] [Longer Statement] Tsutomu Matsumoto: If elected, I would like to do my best to keep the academic integrity of cryptologic research. My experience as a member of the Asiacrypt Steering Committee and as the general chair of ASIACRYPT 2000, the first IACR sponsored Asiacrypt conference, will be useful for our community. [Home Page] [Longer Statement] Kevin McCurley: I have served on the board since 1989, as General Chair, Treasurer, and President. The priorities I see for IACR include: * maintaining quality in our activities, * electronic publishing, * continued student support, * promoting the intellectual freedom and vitality of the international research community, * electronic registration, submissions, and refereeing. [Home Page] [[9]Longer Statement] David M. Balenson: As the Crypto 2001 General Chair I had the pleasure of serving on the IACR Board of Directors. I wish to continue my service to the cryptologic community, focusing my efforts on other important issues, including stronger involvement of the membership, online registration, electronic publishing, and increased support for conferences. [Home Page] [Longer Statement] Alain Hiltgen: As a regular attendant to IACR conferences, I am perfectly aware of the broad increase in public recognition the field experienced over the last few years. If elected, I would best serve towards assuring continuity in this regard. [Home Page] [Longer Statement] References 1. http://www.primarykey.co.uk/Andy/ajcvote1.htm 2. http://www.primarykey.co.uk/andy/ajcmain.htm 3. http://www.primarykey.co.uk/andy/ajcvote1.htm 4. http://www.esat.kuleuven.ac.be/~preneel 5. http://www.esat.kuleuven.ac.be/~preneel/iacr01.html 6. http://research.microsoft.com/~benaloh 7. http://www.cs.technion.ac.il/~biham 8. http://www.sis.uncc.edu/~yzheng/ 9. http://www.swcp.com/~mccurley/iacr ______________________________________________________________________________ David Chaum to hold 2002 IACR Distinguished Lecture ______________________________________________________________________________ David Chaum has been appointed 2002 IACR Distinguished Lecturer. The lecture will be given at Crypto 2002 in Santa Barbara, California. We look forward to his presentation. ______________________________________________________________________________ New Reports in the Cryptology ePrint Archive ______________________________________________________________________________ 2001/089 Linear broadcast encryption schemes Carles Padró and Ignacio Gracia and Sebastiŕ Martín and Paz Morillo 2001/088 Improving the trade-off between storage and communication in broadcast encryption schemes Ignacio Gracia and Sebastiŕ Martín and Carles Padró 2001/087 A Linear Algebraic Approach to Metering Schemes C. Blundo and S. Martěn and B. Masucci and C. Padrň 2001/086 Statistical Zero-Knowledge Proofs from Diophantine Equations Helger Lipmaa 2001/085 Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption Ronald Cramer and Victor Shoup 2001/084 Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree Markus Maurer and Alfred Menezes and Edlyn Teske 2001/083 On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices Maria Fedorova and Yuriy Tarannikov 2001/082 ( PDF ) A Description of Protocols for Private Credentials Ariel Glenn and Ian Goldberg and Frédéric Légaré and Anton Stiglic 2001/081 A Sufficient Condition for Secure Ping--Pong Protocols Masao Mori 2001/080 COS Ciphers are not "extremely weak"! - The Design Rationale of COS Ciphers Eric Filiol and Caroline Fontaine 2001/079 Authenticated Encryption in the Public-Key Setting: Security Notions and Analyses Jee Hea An 2001/078 The COS Stream Ciphers are Extremely Weak Steve Babbage 2001/077 A Time-Memory Tradeoff Attack Against LILI-128 Markku-Juhani Olavi Saarinen 2001/076 Communication Complexity and Secure Function Evaluation Moni Naor and Kobbi Nissim 2001/075 Pseudo-Random Functions and Factoring Moni Naor and Omer Reingold and Alon Rosen 2001/074 On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit - A New Construction Eliane Jaulmes and Antoine Joux and Frederic Valette 2001/073 Efficient oblivious transfer schemes Wen-Guey Tzeng 2001/072 On the Goubin-Courtois Attack on TTM T.Moh 2001/071 Ciphertext Can Be Shorter in Multi-User Setting Kaoru Kurosawa 2001/070 Security Assessment of Hierocrypt and Rijndael against the Differential and Linear Cryptanalysis (Extended Abstract) Kenji Ohkuma and Hideo Shimizu and Fumihiko Sano and Shinichi Kawamura 2001/069 On the (Im)possibility of Obfuscating Programs Boaz Barak and Oded Goldreich and Russell Impagliazzo and Steven Rudich and Amit Sahai and Salil Vadhan and Ke Yang 2001/068 SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers J.Nakahara Jr and P.S.L.M.Barreto and B.Preneel and J.Vandewalle and H.Y.Kim 2001/067 ( PDF ) An Attack on A Traitor Tracing Scheme Jeff Jianxin Yan and Yongdong Wu 2001/066 IMPROVED PUBLIC KEY CRYPTOSYSTEM USING FINITE NON ABELIAN GROUPS SEONG-HUN PAENG and DAESUNG KWON and KIL-CHAN HA and JAE HEON KIM 2001/065 Analysis of chosen plaintext attacks on the WAKE Stream Cipher Marina Pudovkina 2001/064 An Integer Commitment Scheme based on Groups with Hidden Order Ivan Damgard and Eiichiro Fujisaki 2001/063 Resettably-Sound Zero-Knowledge and its Applications Boaz Barak and Oded Goldreich and Shafi Goldwasser and Yehuda Lindell 2001/062 Optimal security proofs for PSS and other signature schemes Jean-Sébastien Coron 2001/061 Clock-Controlled Shift Registers for Key-Stream Generation A.Kholosha 2001/060 The Security of a Family of Two-Party RSA signature schemes Mihir Bellare and Ravi Sandhu 2001/059 Revocation and Tracing Schemes for Stateless Receivers Dalit Naor and Moni Naor and Jeff Lotspiech 2001/058 Efficient Zero-knowledge Authentication Based on a Linear Algebra Problem MinRank Nicolas T. Courtois 2001/057 On the Security of the SPEKE Password-Authenticated Key Exchange Protocol Philip MacKenzie 2001/056 On the Complexity of Matsui's Attack P. Junod 2001/055 Universally Composable Commitments Ran Canetti and Marc Fischlin 2001/054 Extending the GHS Weil Descent Attack S.D. Galbraith and F. Hess and N.P. Smart 2001/053 Security Proofs for the RSA-PSS Signature Scheme and Its Variants Jakob Jonsson 2001/052 ( PDF ) Differential Probability of Modular Addition with a Constant Operand Alexis Warner Machado 2001/051 Black-Box Concurrent Zero-Knowledge Requires $\tilde\Omega(\log n)$ Rounds Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen 2001/050 Elliptic curve Paillier schemes Steven D Galbraith 2001/049 A known plaintext attack on the ISAAC keystream generator Marina Pudovkina 2001/048 Forward-Secure Signatures with Optimal Signing and Verifying Gene Itkis and Leonid Reyzin 2001/047 ON THE METHOD OF "XL" AND ITS INEFFICIENCY TO TTM T.MOH 2001/046 The simple ideal cipher system Boris Ryabko 2001/045 The order of encryption and authentication for protecting communications (Or: how secure is SSL?) Hugo Krawczyk ______________________________________________________________________________ Crypto 2001 Rump Session ______________________________________________________________________________ Tuesday, August 21 7:00 Session 1: Cryptanalysis, elections, elliptic curves, announcements Introduction Stuart Haber It's all a matter of viewpoint Whit Diffie, John Gilmore Weaknesses in the key-scheduling algorithm of RC4 Scott Fluhrer, Itsik Mantin, Adi Shamir Using the Fluhrer, Mantin, and Shamir attack to break WEP Adam Stubblefield, John Ioannidis, Avi Rubin A verifiable secret shuffle and its application to e-voting Andy Neff No more panic in Florida: Reality or dream? Kwangjo Kim, Jinho Kim, Byoungcheon Lee 7:27 Cryptanalysis of the revised NSS signature scheme Craig Gentry, Michael Szydlo Cryptanalysis of a pseudorandom generator based on the braid group, or The deci sional Ko-Lee assumption is false Rosario Gennaro, Daniele Micciancio The compression side channel John Kelsey Umbral optimal normal bases A. Jurisic Financial Cryptography '02 Matt Blaze Announcements from NIST Morris Dworkin HDCP -- as spec' d Gideon Yuval CryptoBroker Jim Hughes 8:10 Session 2: Block ciphers, short & long keys, public-key security, protocols A new class of invertible mappings Alexander Klimov, Adi Shamir A working implementation of the time-memory trade-off of Hellman, and How many 40-bit keys can we break with a simple computer during a short rump-session tal k? J.-J. Quisquater, G. Rouvroy, F.-X. Standaert, J.-P. David, and J.-D. Legat Deterministic and bountiful generation of block substitution tables with maxima l nonlinearity Lothrop Mittenthal New covering radius of Reed-Muller codes for t-resilient functions Tetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa A trivial attack against CBC-PAD: Breaking SSL, IPSEC, WTLS, ... and Alert on nonlinearity: Linearities in Rijndael, Kasumi, ... Serge Vaudenay Securely combining public-key cryptosystems Benny Pinkas, Stuart Haber A provably secure IND-CCA public-key encryption scheme as efficient as El-Gamal David Soldera Bidirectional security Y. Dodis, J. Katz, S. Xu, M. Yung Generating long shared keys in the storage-bounded model Stefan Dziembowski, Ueli Maurer On the composition of authenticated Byzantine agreement Yehuda Lindell, Ann Lysyanskaya, Tal Rabin On the model of distinguishers in computational zero knowledge Jun Furukawa, Satoshi Obana, Tatsuaki Okamoto, Kazue Sako Reusable time-lines and applications Juan Garay, Markus Jakobsson Non-malleable commitments based on factoring Roger Fischlin, Marc Fischlin 9:07 Break 9:20 Session 3: Signatures, quantum crypto, miscellaneous topics How many 40-bit keys can we break ... during a short rump-session talk? J.-J. Quisquater, et al. Short signatures from the Weil pairing Dan Boneh, Ben Lynn, Hovav Shacham A short DSS-based signature Ilya Mironov Composition and efficiency tradeoffs for forward-secure digital signatures Tal Malkin, Daniele Micciancio, Sara Miner Secure digital signatures with McEliece and new records in short signatures Nicolas T. Courtois, Matthieu Finiasz, Nicolas Sendrier Security notions of unconditionally secure signature schemes Junji Shikata, Goichiro Hanaoka, Yuliang Zheng, Hideki Imai 9:49 Quantum coin flipping with arbitrary small bias is impossible Yuki Tokunaga A quantum information-theoretical model for quantum secret-sharing schemes Anderson Nascimento, Yodai Watanabe, Hideki Imai A dual watermarking and fingerprinting system Darko Kirovski, Henrique Malvar, Yacov Yacobi State-varying hybrid stream cipher Viswanath Ananth Tree decision Diffie-Hellman problem Yongdae Kim Introducing GammaPi Seth Patinkin 10:13 Good night! ______________________________________________________________________________ Announcements ______________________________________________________________________________ ** Contemporary Methods in Cryptography, Institute For Pure and Applied Mathematics, UCLA Institute For Pure and Applied Mathematics University of California, Los Angeles presents a workshop in Contemporary Methods in Cryptography January 9 - 13, 2002 The need to securely transmit and utilize ever-increasing quantities of data, of increasingly diverse nature, has given rise to a new set of problems and solutions which lie on the interface between number theory, cryptography, and complexity theory. This program will present recent advances on this interface. Emphasis will be on the foundational aspects of the field (as opposed to the practical implementation of secure communications networks). Topics of interest include: zero knowledge, oracle separation results, elliptic curve (and higher genus) cryptosystems, non-commutative group cryptosystems, factorization methods, discrete logarithms (classical and elliptic), and lattices and their application to cryptography and cryptanalysis. There will also be two tutorials: Prof. Russell Impagliazzo, UCSD, on the many applications of the Goldreich-Levin theorem and Dr. Kazue Sako, NEC, on electronic voting. Registration is open to all interested participants. The following individuals will give invited presentations. Dan Boneh Stanford University Daniele Micciancio UCSD Cynthia Dwork Compaq Systems Res Ctr Kumar Murty Tronto Noam Elkies Harvard Carl Pomerance Bell Research Labs Dorian Goldfeld Columbia Omer Reingold AT&T Nick Howgrave-Graham IBM Kazue Sako NEC Russell Impagliazzo UCSD Joseph Silverman NTRU Cryptosys Brown Univ Neal Koblitz Univ of Washington Jacques Stern École normale supérieure Ravi Kumar IBM Almaden Res Ctr Edlyn Teske University of Waterloo Tal Malkin AT&T David Wagner UC Berkeley Organizing Committees: Local Organizing Committee: Don Blasius (UCLA), William Duke (UCLA), and Jonathan Rogawski (UCLA). Scientific Committee: Dan Boneh (Stanford University), Cynthia Dwork (Compaq Systems Research Center), and Joseph Silverman (NTRU Cryptosystems/Brown University). The program is open to the entire mathematical, computer science, and physical sciences communities. Please visit our website for more information, including an online registration form: http://www.ipam.ucla.edu/programs/cry2002 You can email questions to mailto:cry2002@ipam.ucla.edu ______________________________________________________________________________ New Books ______________________________________________________________________________ This page lists new books about cryptology, and occasionally reviews one. Foundations of Cryptography -- Basic Tools by Oded Goldreich ISBN 0-521-79172-3 Cambridge University Press Hardcover - $74.95 ANNOUNCEMENT Cryptography is concerned with the construction of schemes that should maintain a desired functionality, even under malicious attempts aimed at making them deviate from it. The design of cryptographic systems has to be based on firm foundations; whereas ad-hoc approaches and heuristics are a very dangerous way to go. This work is aimed at presenting firm foundations for cryptography. The foundations of cryptography are the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural ``security concerns''. The emphasis of the work is on the clarification of fundamental concepts and on demonstrating the feasibility of solving several central cryptographic problems. This is done in a way independent of the particularities of some popular number theoretic examples. Thus, the most relevant background is basic knowledge of algorithms (including randomized ones), computability and elementary probability theory. The current book is the first volume of this work, and it focuses on the main tools of Modern Cryptography: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. The next volume will focus on the main applications of Cryptography: encryption schemes, signature schemes and secure protocols. Fragments of the second volume are available online from http://www.wisdom.weizmann.ac.il/~oded/foc-vol2.html Together, the available material can serve as a textbook for a course on the Foundations of Cryptography. Teaching suggestions are provided in the current volume and are also available from http://www.wisdom.weizmann.ac.il/~oded/foc-vol1.html The high-level structure of the current volume is as follows: * Chapter 1: Introduction Main Topics covered by the work (Sec. 1.1) Background on Probability and Computation (Sec. 1.2 and 1.3) Motivation to the Rigorous Treatment (Sec. 1.4) * Chapter 2: Computational Difficulty (One-Way Functions) Motivation and Definitions (Sec. 2.1 and 2.2) One-Way functions: Weak implies Strong (Sec. 2.3) Variants (Sec. 2.4) and advanced material (Sec. 2.6) Hard-Core Predicates (Sec. 2.5) * Chapter 3: Pseudorandom Generators Motivation and Definitions (Sec. 3.1-3.3) Constructions based on One-Way Permutations (Sec. 3.4) Pseudorandom Functions (Sec. 3.6) Advanced material (Sec. 3.5 and 3.7) * Chapter 4: Zero-Knowledge Proofs Motivation and Definitions (Sec. 4.1-4.3) Zero-Knowledge Proofs for NP (Sec. 4.4) Advanced material (Sec. 4.5-4.11) * Appendix A: Brief Background on Computational Number Theory * Appendix B: Brief Outline of Volume 2 * Bibliography and Index For further details on this work and the current volume, see http://www.wisdom.weizmann.ac.il/~oded/foc-book.html and http://www.wisdom.weizmann.ac.il/~oded/foc-vol1.html respectively. Publisher's page for this volume: http://www.cup.org/Titles/79/0521791723.htm. ------ Please send your new book announcements to the newsletter editor at newsletter at iacr.org ______________________________________________________________________________ Open Positions in Cryptology ______________________________________________________________________________ IACR provides a listing of open positions with a focus on cryptology. The listing is available on the Web at http://www.iacr.org/jobs/ and also included in the IACR Newsletter that is sent to members three times per year. To advertise your job opportunities, please send a description of no more than 150 words in plain ASCII text by email to jobs(at)iacr.org. This should include an URL and further contact information. No attachments or word documents, please! (Submissions in other formats than text will not be posted.) As this is intended to be a service to the members of IACR, it is free for all members. We ask that commercial enterprises who want to advertise their openings identify at least one of their employees who is a member of IACR. (IACR does not know corporate membership.) Please contact the membership secretariat to become a member of IACR. On top of that, IACR accepts donations and is always looking for sponsors for its conferences. _________________________________________________________________ Vrije Universiteit, Amsterdam, The Netherlands From: Andy Tanenbaum To: jobs@iacr.org My group has several vacancies for researchers interested in the security of distributed systems, including a tenure-track assistant professor, postdoc, and Ph.D. student. We are practically oriented and more focused on security protocols and their use in systems and applications (e.g., e-commerce) than in the more mathematical aspects per se. For more information, please see www.cs.vu.nl/~ast/jobs Andrew S. Tanenbaum Vrije Universiteit Amsterdam, The Netherlands (16-oct-01) _________________________________________________________________ Hewlett-Packard Laboratories Bristol, United Kingdom Post-Doctoral Research Position "Formal methodologies for cryptographic protocols analysis" Hewlett-Packard Laboratories Bristol, United Kingdom Hewlett-Packard Laboratories, Bristol invites you to apply for a research position in the area of formal methodologies for design, specification and verification of cryptographic protocols for electronic commerce, business, service and government applications. We are seeking a post-doctoral level researcher to play the role of the main investigator in the European Union funded research project: CASENET. In this project HP Labs will be closely collaborating with a number of centres of excellence in formal methods which include: Royal Holloway, University of London (Dr Steve Schneider), Oxford University (Dr Gavin Lowe) and several partners in Europe. The project will start on 1st November 2001 and last for two years. The position has a competitive salary offer and various company benefits. Please contact: Dr Wenbo Mao Hewlett-Packard Labs., Bristol Filton Road, Stoke Gifford, Bristol BS34 8QZ United Kingdom Email: Wenbo_Mao@hpl.hp.com Tel: +44 117 312 9528 Fax: +44 117 312 9870 URL: http://hplbwww.hpl.hp.com/ Deadline for Application: 20th November 2001 (16-oct-01) _________________________________________________________________ Department of Mathematics, Katholieke Universiteit Leuven, Belgium POSTDOCTORAL POSITION IN COMPUTATIONAL NUMBER THEORY Research Unit Algebraic Geometry and Number Theory Department of Mathematics Katholieke Universiteit Leuven, Belgium COSIC (Computer Security and Industrial Cryptography) Department of Electrical Engineering-ESAT Katholieke Universiteit Leuven, Belgium Applications are invited for a postdoctoral research position in the area of "Computational Number Theory". The position is funded by a 4-year research project Computational Number Theory and Algebraic Geometry sponsored by the Flemish government. The goal of the project is to make progress in topics of algorithmic number theory that are relevant for cryptography, using algebraic geometry as a tool. The first appointment will be for 1 year, but an extension with 1 year is possible. There are no teaching obligations. The candidates should have a Ph.D. in mathematics, in the field of number theory or algebraic geometry and proven ability, or the potential, for excellent research. The successful applicant will collaborate with two research groups: The Research Unit Algebraic Geometry and Number Theory (http://www.wis.kuleuven.ac.be/wis/algebra/amgt.htm) of the Department of Mathematics (http://www.wis.kuleuven.ac.be/wis/math.htm), and the group COSIC (Computer Security and Industrial Cryptography) (http://www.esat.kuleuven.ac.be/cosic/) of the Department of Electrical Engineering (http://www.esat.kuleuven.ac.be/index.en.shtml). Both groups have a strong international reputation: the first group in algebraic geometry and number theory, and the second in cryptography. The normal starting date of appointment is January 1, 2002. However, this can be changed at the applicant's request. The closing date for receipt of applications is November 15, 2001. Interested individuals should send a curriculum vitae, 2 or 3 selected reprints/preprints, and the names of two references to: Jan Denef, Department of Mathematics, University of Leuven, Celestijnenlaan 200 B, 3001 Leuven, Belgium. Phone: 016-327010, Fax: 016-327998. E-mail: Jan.Denef@wis.kuleuven.ac.be Web: http://www.wis.kuleuven.ac.be/wis/algebra/denef.html (06-oct-01) _________________________________________________________________ NetOctave Inc, Raleigh NC, USA NetOctave Inc (Raleigh NC) ( www.netoctave.com ) is a leading developer of silicon-based network security solutions that provide scalable, turnkey security for OEM customers. Of interest to IACR members may be the position of Product Architect: Product ArchitectProdArch Raleigh, NC Job Description We are seeking a high level technical contributer to become involved in the architectural definition of next-generation multi-gigabit IPSec and SSL chip and equipment design. Primary Responsibilities Writing technical specifications for products including hardware and software Tracking standards and attending working group meetings Limited travel to customer sites Job Qualifications Proven experience in developing networking products. 5+ years systems architecture experience. In-depth knowledge of software and hardware and software elements of current IP-based networking products including routers, switches and network appliances. Practical experience using C/C++. Familiarity with elements of IP routing, IP fragmentation, traffic management and quality of service. Knowledge of security products a plus. In-depth understanding of IPSec and SSL protocols down to the bit level. Proven experience interacting with customers of networking products. BSCS or related technical field; advanced degree a plus. To apply in confidence for one of these openings, please indicate the opening you are interested in and send your resume, salary history and contact information via careers@netoctave.com. Please include your name and the position you are applying for in the subject line of your e-mail. Or contact us by fax or mail--by fax to 1.919.463.9905, Attention: Human Resources, or by mail to: NetOctave, Inc. Attention: Human Resources PO Box 14824 Research Triangle Park, NC 27709 (28-sep-01) _________________________________________________________________ COSIC, Katholieke Universiteit Leuven, Belgium COSIC, Katholieke Universiteit Leuven, Belgium 4 POSITIONS: CRYPTOGRAPHIC PROTOCOLS and ELLIPTIC CURVE CRYPTOGRAPHY COSIC (Computer Security and Industrial Cryptography) Dept. Electrical Engineering-ESAT Katholieke Universiteit Leuven, Belgium Applications are invited for 2 postdoctoral positions and 2 research assistant positions in the following areas: * Design of cryptographic protocols for voting, privacy and anonimity: https://www.cosic.esat.kuleuven.ac.be/apes/ and http://www.eucybervote.org * Elliptic and hyper-elliptic curves with applications to cryptography. The projects envisage both theoretical and practical research (including implementations); candidates should indicate their preferences. For postdocs, these tasks involve both research and project management. Experienced candidates can also be appointed as visiting professor. The first appointment will be made for 1 year, but an extension with 1 or 2 years is possible. Successful candidates will be joining a research group of 20 people with an international reputation in the area of cryptography and its applications. For more details on COSIC http://www.esat.kuleuven.ac.be/cosic/. The normal starting date of the appointments is December 1, 2001. However, this date can be changed at the applicant's request. Interested individuals should send a curriculum vitae to the address below. Candidates for a postdoc should also include 2 or 3 selected reprints/preprints and the name of at least one reference. Bart Preneel Katholieke Universiteit Leuven Dept. Electrical Engineering-ESAT/COSIC Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, BELGIUM bart.preneel@esat.kuleuven.ac.be Closing date for receipt of applications is November 5, 2001. (24-sep-01) _________________________________________________________________ University of Bristol POSTDOCTORAL RESEARCH ASSISTANT FOR "Security Analysis of the NTRU encryption and NSS signature schemes, using lattice techniques" The Department of Computer Science of the University of Bristol has a one year post-doctoral research position available, funded by the EPSRC, to conduct research into the new cryptographic schemes proposed by NTRU. Candidates should have a PhD, or be near completion of one, in either Computer Science, Mathematics, Electronic Engineering or some allied discipline. The appointment, available from Jan 2002. Informal enquiries can be made to Dr. Nigel Smart via email nigel@cs.bris.ac.uk or phone (0117) 954 5163. The University does not issue application forms. Applications should be made by letter, stating research interests, and should include the names and addresses of two referees. The letter should be accompanied by a curriculum vitae setting out the date of birth, details of qualifications, and if, applicable, details of postdoctoral/postgraduate experience, publications, previous appointments, and present salary. Applications should be sent, quoting reference 7829 to: Personnel, University of Bristol, Senate House, Tyndall Avenue, Bristol BS8 1TR, UK. Bristol University is an Equal Opportunity employer. (6-sep-01) _________________________________________________________________ Ruhr-Universitaet Bochum (Germany) The Ruhr-Universitaet Bochum, Germany, is in the process of establishing an Institute for IT Security The Institute will be a center of excellence for the theoretical and practical aspects of IT security, providing high quality research and education. At the Institute's core are three chaired professorships in IT security, two of which have been filled. The Department of Electrical Engineering and Information Sciences now has an opening for a C4 Professorship for Network and Data Security (Horst Goertz Foundation Chair) This is a tenured position. C4 professorships are the highest academic positions in the German university system. The position comes with exceptional support for staff and equipment. It is expected that the candidate can conduct research and offer courses in various aspects of IT security. It is also desired that the candidate can teach the courses "Technical Computer Science" and "Computer Networks" for students in the first three years of their studies. At the more advanced level, courses related to the candidate's research interests should be offered. Examples of desired research areas include: - Security in networks (e.g., Internet security or security in mobile and ad-hoc networks) - Computer and OS security - Cryptographic protocols (design, analysis, standards) - Public-key infrastructure - Evaluation of IT security systems - Risk analysis of IT systems The candidate should have an internationally recognized publication record, and should have pedagogical capabilities and interests. It is also desirable that the candidate has experience in industry or the public sector. Due to the international character of the Institute, we especially welcome applicants from outside Germany. From non-native speakers it will be expected that after a transition period of two years lectures will also be held in German. A habilitation or equivalent post-Ph.D. qualifications are required for this position. Note that the official advertisement for this position is the German version which can be found on the web page http://www.et.ruhr-uni-bochum.de/aktuell/stelle.shtml The Ruhr-University Bochum is working towards an increased number of women in research and education, and strongly encourages female scientists to apply. Applications of physically handicapped candidates with appropriate qualifications are also encouraged. Please mail your application by October 15, 2001, to: Prof. Dr.-Ing. Johann Friedrich Boehme Dean, Department of Electrical Engineering and Information Sciences Ruhr-Universitaet Bochum D 44780 Bochum Germany Addtional information about the Institute can be found at: http://www.eurubits.de Should you need more information about the position, you are welcome to contact Prof. Christof Paar (cpaar@et.ruhr-uni-bochum.de) or Prof. Hans Dobbertin (hans.dobbertin@eurubits.de). (21-aug-01) Stevens Institute of Technology Post-Doctoral Positions Available Laboratory for Secure Systems Department of Computer Science Stevens Institute of Technology The Laboratory for Secure Systems at the Computer Science Department of Stevens Institute of Technology invites applications for Post-doctoral positions. The Lab has been recently created, and its mission is to pioneer new technologies for high-assurance and secure systems and prototype tools that can provide guarantees that a system will not exhibit unpredictable behavior in a hostile environment. Our objective is to consolidate and organize research already under way at Stevens. Successful applicants will be enthusiastic team players with a strong commitment to academic excellence. A PhD in Computer Science or Applied Mathematics or equivalent education is required. Preference will be given to applicants with experience in at least one of the following areas: *Type theory *Static program analysis *Formal verification *Semantics of programming languages *Higher-order programming languages *Implementation of programming languages Further particulars can be found at: http://www.cs.stevens-tech.edu/Lab/SecureSystems_Lab/JoinUs.htm For more information contact: Adriana Compagnoni (abc@cs.stevens-tech.edu), Dominic Duggan (dduggan@cs.stevens-tech.edu), or David Naumann (naumann@cs.stevens-tech.edu). (21-aug-01) ______________________________________________________________________________ IACR Calendar of Events in Cryptology ______________________________________________________________________________ The IACR calendar lists events (conferences, workshops, ...) that may be of interest to IACR members or deal with research in cryptology. If you want to have an event listed here, please send email to webmaster(at)iacr.org . 2001 * [1]5th Workshop on Elliptic Curve Cryptography (ECC 2001), October 29-31, Waterloo, Canada. * [2]3rd Midwest Arithmetical Geometry in Cryptography Workshop, November 2-4, University of Illinois at Urbana-Champaign, USA. * [3]Workshop on Security and and Privacy in Digital Rights Management (SPDRM 2001), November 5, Philadelphia, Pennsylvania, USA. * [4]Eighth ACM Conference on Computer and Communications Security, November 6-8, Philadelphia, Pennsylvania, USA. * [5]Workshop on Algebraic Methods in Cryptography, November 7-8, Ruhr-Universität Bochum, Germany. * [6]Third International Conference on Information and Communications Security (ICICS), November 13-16, Xian, China. * [7]Workshop on Applied Cryptology, December 3-7, National University of Singapore, Singapore. * [8]Fourth International Conference on Information Security and Cryptology (ICISC), December 6-7, Seoul, Korea. * [9]Asiacrypt 2001, December 9-13, Gold Coast, Queensland, Australia. * [10]Second International Conference on Cryptology in India (Indocrypt 2001), December 16-20, Madras, Chennai, India. 2002 * [11]Contemporary Methods in Cryptography , January 9-13, UCLA, Los Angeles, USA. * [12]WITS '02: Workshop on Issues in the Theory of Security, January 14-15, Portland, Oregon, USA. * [13]Fast Software Encryption Workshop 2002, February 4-6, Leuven, Belgium. * [14]ISOC 2002 Network and Distributed System Security (NDSS), February 6-8, San Diego, California, USA. * [15]PKC '02, February 12-14, Paris, France. * [16]RSA Conference 2002 Cryptographers' Track, February 18-22, San Jose, USA. * [17]Financial Cryptography '02, March 11-14, Southampton, Bermuda. * [18]Workshop on Privacy Enhancing Technologies (PET 2002), April 14-15, San Francisco, California, USA. * [19]Eurocrypt 2002, April 28-May 2, Amsterdam, Netherlands. * [20]IEEE Symposium on Security and Privacy, May 12-15, Oakland, California, USA. * [21]15th IEEE Computer Security Foundations Workshop, June 24-26, Cape Breton, Nova Scotia, Canada. * [22]2002 IEEE International Symposium on Information Theory, June 30-July 5, Lausanne, Switzerland. * [23]Seventh Australasian Conference on Information Security and Privacy, July 3-5, Melbourne, Australia. * [24]Crypto 2002, August 18-22, Santa Barbara, California, USA. * [25]VII Spanish Meeting on Cryptology and Information Security, September 5-7, Asturias, Espana. * [26]Asiacrypt 2002, December 1-5, Queenstown, New Zealand. References 1. http://www.cacr.math.uwaterloo.ca/conferences/2001/ecc/announcement.html 2. http://www.math.uiuc.edu/~boston/magc3.html 3. http://www.star-lab.com/sander/spdrm/ 4. http://www.bell-labs.com/user/reiter/ccs8/ 5. http://homepage.ruhr-uni-bochum.de/Lothar.Gerritzen/GKAMWork.html 6. http://homex.coolconnect.com/member2/icisa/icics2001.html 7. http://www.ims.nus.edu.sg/programs/coding.html 8. http://cnscenter.future.co.kr/icisc01/ 9. http://www.isrc.qut.edu.au/asiacrypt/ 10. http://www.cs.iitm.ernet.in/indocrypt/ 11. http://www.ipam.ucla.edu/programs/cry2002/ 12. http://www.dsi.unive.it/IFIPWG1_7/wits2002.html 13. http://www.iacr.org/workshops/fse2002/ 14. http://www.isoc.org/isoc/conferences/ndss/02/ 15. http://www.novamedia.fr/conferences/conferences/confpkc.html 16. http://www.rsaconference.com/rsa2002/cryptotrack.html 17. http://fc02.ai/ 18. http://www.pet2002.org/ 19. http://www.ec2002.tue.nl/ 20. http://www.ieee-security.org/TC/SP/SP02/sp02index.html 21. http://www.csl.sri.com/csfw/csfw15/ 22. http://isit02.epfl.ch/ 23. http:/// 24. http://www.iacr.org/conferences/crypto2001/ 25. http://enol.etsiig.uniovi.es/viirecsi/ 26. http://www.sis.uncc.edu/ac02/ ______________________________________________________________________________ IACR Contact Information ______________________________________________________________________________ Officers and Directors of the IACR (2001) Officers and directors of the IACR are elected for three year terms. If you are a member and wish to contact IACR regarding an address change or similar matter, you should contact the membership services at [iacrmem(at)iacr.org]. See http://www.iacr.org/iacrmem/ for more information. Officers Kevin S. McCurley Andrew J. Clark President Vice President 6721 Tannahill Drive P.O. Box 743 San Jose, CA 95120 Brighton USA East Sussex Tel: +1 408 927 1838 BN1 5HS Email: [president(at)iacr.org] United Kingdom Tel: +44 1273 270752 Fax: +44 1273 276558 Email: [vicepresident(at)iacr.org] Josh Benaloh Susan Langford Secretary Treasurer Microsoft Research Certicom One Microsoft Way 25801 Industrial Blvd Redmond, WA 98052 Hayward, CA 94545 USA USA Tel: +1 425 703 3871 Tel: +1 510 780 5422 Fax: +1 425 936 7329 Fax: +1 510 780 5401 Email: [secretary(at)iacr.org] Email: [treasurer(at)iacr.org] Directors Dave Balenson Don Beaver Crypto 2001 General Chair Membership Secretary Technical Outreach and Special Certco Inc. Projects 55 Broad Street, 22nd Floor NAI Labs New York, NY 10004 The Security Research Division USA of Network Associates, Inc. Tel: +1 212 709 6719 3060 Washington Road Fax: +1 212 709 6754 Glenwood, MD 21738 USA Email: beaverd(at)certco.com Email: david_balenson(at)nai.com Tel: +1 443 259 2358 Fax: +1 301 854 4731 Thomas Berson Eli Biham Anagram Labs Computer Science Department P.O. Box 791 Technion Palo Alto CA, 94301 Haifa 32000 USA Israel Tel: +1 650 324 0100 Email: [biham(at)cs.technion.ac.il] Email: [berson(at)anagram.com] Tel: +972 4 8294308 Fax: +972 4 8294308 Christian Cachin Ed Dawson Editor, IACR Newsletter Asiacrypt 2001 General Chair IBM Zurich Research Laboratory Information Security Research Centre Säumerstrasse 4 Queensland University of Technology CH-8803 Rüschlikon GPO Box 2434 Switzerland 3060 Washington Road Tel: +41 1 724 8989 Brisbane, Qld 4001, Australia Fax: +41 1 724 8953 Tel: +61 7 3864 1919 Email: [cachin(at)acm.org] Fax: +61 7 3221 2384 Email: dawson(at)fit.qut.edu.au Yvo Desmedt Whitfield Diffie Department of Computer Science Sun Microsystems, MPK15-214 Florida State University 901 San Antonio Road PO Box 4530, 206 Love Building Palo Alto, California 94303 Tallahassee, FL 32306-4530 Tel: +1 650 786 6359 USA Fax: +1 650 786 6445 Tel: +1 850 644 9298 Email: Fax: +1 850 644 0058 [whitfield.diffie(at)eng.sun.com] Email: desmedt(at)nu.cs.fsu.edu Joan Feigenbaum Kwangjo Kim Editor-in-Chief, Journal of School of Engineering Cryptology Information and Communications Univ. Department of Computer Science 58-4 Hwaam-dong Yusong-ku Yale University Taejon, 305-348 P. O. Box 208285 KOREA New Haven, CT 06520-8285 Tel: +82 42 866 6118 USA Fax: +82 42 866 6154 Email: Email: [kkj (at) icu.ac.kr] joan.feigenbaum(at)yale.edu or [jofc(at)iacr.org] Tel: +1 203 432 6432 Fax: +1 203 432 0593 Lars Knudsen Peter Landrock University of Bergen Mathematics Institute Dept. of Informatics Aarhus University Hightechcenter Ny Munkegade N-5020 Bergen 8000 Aarhus C NORWAY Denmark Tel: +47 55 58 41 57 Email: Fax: +47 55 58 41 99 [landrock(at)cryptomathic.aau.dk] Email: Lars.Knudsen(at)ii.uib.no Ueli Maurer Bart Preneel Department of Computer Science Department of Electrical Engineering ETH Zürich Katholieke Universiteit Leuven CH-8092 Zürich Kardinaal Mercierlaan 94 Switzerland B-3001 Heverlee Email: [maurer(at)inf.ethz.ch] BELGIUM Tel-1: +41 1 632 7420 Email: Tel-2: +41 1 632 7371 [bart.preneel(at)esat.kuleuven.ac.be] Fax: +41 1 632 1172 Tel: +32 16 32 11 48 Fax: +32 16 32 19 86 Reinhard Posch Eurocrypt 2001 General Chair Berry Schoenmakers Scientific Director Eurocrypt 2002 General Chair Secure Information Technology technische universiteit eindhoven Center - AUSTRIA /department of mathematics and Inffeldgasse 16a computing science A-8010 GRAZ HG 9.85, P.O. Box 513 AUSTRIA 5600 MB Eindhoven, The Netherlands Tel: +43 316 873 5510 Tel: +31 40 247 4769 Fax: +43 316 873 5520 Fax: +31 40 243 5810 Email: Email: berry(at)win.tue.nl Reinhard.Posch(at)iaik.at Hank Wolfe Rebecca Wright Asiacrypt 2002 General Chair Crypto 2002 General Chair Information Science Department AT&T Labs Research School of Business Room A213 University of Otago P.O. Box 971 P.O. Box 56 180 Park Avenue Dunedin, New Zealand Florham Park, NJ 07932-0971 Tel: +64 3 479 8141 USA Fax: +64 3 479 8311 Tel: +1 973 360 8346 Email: Fax: +1 973 360 8970 hwolfe(at)commerce.otago.ac.nz Email: rwright(at)research.att.com ______________________________________________________________________________ About the IACR Newsletter ______________________________________________________________________________ The IACR Newsletter is published three times a year and only available electronically. It is sent to IACR members by email (as a flat ASCII text) and published on the web at http://www.iacr.org/newsletter/ If you are a member of IACR and wish to receive the newsletter, you need to make sure that we know your email address! To update your email address in the IACR member database, please contact the membership services at iacrmem(at)iacr.org . Contributions, announcements, book announcements or reviews, calls for papers ... are most welcome! Please include a URL and/or e-mail addresses for any item submitted (if possible). For calls for papers, please submit a one page ASCII version. Send your contributions to newsletter(at)iacr.org The Next Issue Deadline for submissions to the next newsletter issue is January 31, 2002. However, many items will be posted on the website as soon as possible. ______________________________________________________________________________ End of IACR Newsletter, Vol. 18, No. 3, Fall 2001. ______________________________________________________________________________