Algebra and Cryptography Seminar, Spring 2007

Organizers: Robert Gilman, Alexei Myasnikov, and Vladimir Shpilrain


2:00-3:00 pm
Room 8405, CUNY Graduate Center
365 Fifth Avenue at 34th Street


11:00 am-12:00 pm
Room Peirce 220, Stevens Institute of Technology
Hoboken, NJ

Security seminars at Stevens

January 22, 2:00, Room 110, Babbio Center, Stevens Institute: Rainer Steinwandt (Florida Atlantic University), On a Modular Approach to (Password-)Authenticated Group Key Establishment
Abstract: The talk discusses a protocol compiler enabling the derivation of a group key establishment protocol from a given 2-party solution. The compiler can be applied in the context of password-based authentication and does not introduce idealizing assumptions. For a scenario where an existentially unforgeable signature scheme is available, the talk addresses the question of how such a compiler could help in building a group key establishment protocol on a group-theoretic assumption.
Based on joint work with Michel Abdalla, Jens-Matthias Bohli and María Isabel González Vasco.

February 9, Graduate Center: Alex Miasnikov (Stevens Institute of Technology), On the length based attack

March 9, Graduate Center, 2:30 pm: Vladimir Shpilrain (City College), Search problems in combinatorial group theory and their use in public key cryptography
Abstract: In this talk, I will discuss connections, sometimes surprising, between the conjugacy search problem, decomposition search problem, and factorization search problem, and discuss public key cryptographic protocols based on these problems.

March 23, Graduate Center, 2:30 pm: Ayan Mahalanobis (Stevens Institute), The MOR cryptosystem
Abstract: In this talk we talk about the MOR cryptosystem. This is a simple and straightforward generalization of one of the most popular cryptosystems, the El-Gamal cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian platform group for the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equivalent to the El-Gamal cryptosystem over finite fields. For more information see the following paper:
and a related paper:

April 20, Room 104, Babbio Center, Stevens Institute: Sasa Radomirovic (University of Luxembourg), Compositional Verification of Security Protocols
Abstract: Protocol verification is in general a complex task. The time needed to verify a security protocol with modern methods employed by state of the art tools, such as Scyther or AVISPA, is still exponential with respect to the number of messages in the protocol. Therefore, security protocol analysis is currently only feasible for small protocols. Compositional protocol verification reduces the complexity of the verification of a large structured protocol to the complexity of its largest component.
In this talk I will present a recently developed framework for compositional verification of security protocols. The framework is intended to facilitate human as well as automatic verification of large structured security protocols. This is joint work with Andova, Cremers, Gjosteen, Mauw, and Mjolsnes.

April 27, Graduate Center, 2:30 pm: Vitaly Romankov (Omsk University, Russia and Stevens Institute), On general aspects of group-based cryptology
Abstract: The talk discusses a possible complex approach to constructing cryptographic protocols.

To subscribe to the seminar mailing list, click here

Fall 2006 talks

Spring 2006 talks

Fall 2005 talks