Algebra and Cryptography Seminar, Fall 2014

Organizers: Robert Gilman, Delaram Kahrobaei, Alexei Myasnikov, and Vladimir Shpilrain


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

September 12, Graduate Center: Kurt Rohloff (New Jersey Institute of Technology), Towards Practical Implementations of Fully Homomorphic Encryption
Abstract: One of the first major breakthroughs of computer science in the 21st century is the demonstration of public-key Fully Homomorphic Encryption (FHE). Unfortunately, FHE was not practical when it was discovered - it was several orders of magnitude too inefficient to be economically feasible. In this talk we will discuss how we have been accelerating the development of practical implementations of Fully Homomorphic Encryption (FHE). For the past three years, our team has succeeded in accelerating various aspects of the FHE implementation resulting in implementations of FHE schemes that have achieved multiple orders of magnitude improvement in computation. Further means of parallel software and hardware acceleration, such as for multicore and FPGA hardware, can improve the speed of computation even further by several additional orders of magnitude. This talk will review our advances in FHE, from theory, implementation and application perspectives. We discuss our design and implementations of cryptographic primitives and that can make efficient use of multi/many-core and parallel computing capabilities in both software and hardware. We also discuss ours plan to continue this research that will enable practical secure out-sourced computation for specific application domains, such as to support homomorphic encryption in resource-limited environments such as on smartphones.

October 10, Graduate Center: Bren Cavallo (CUNY Graduate Center), Decoy-Based Secure Delegation of Computation, With Application to RSA.
Abstract: In this talk, I will introduce a method of secure delegation of computation where the security is not based on any computational assumptions, but rather on numerous "decoys". As an application, this method can be used by a computationally weak party to delegate the exponentiation that takes place in the RSA protocol. This is joint work with Delaram Kahrobaei and Vladimir Shpilrain.

October 24, Graduate Center: Andrey Nikolaev (Stevens Institute of Technology), Knapsack problems in products of groups
Abstract: The classic knapsack and related problems have natural generalizations to arbitrary (non-commutative) groups, collectively called knapsack-type problems in groups. We study the effect of free and direct products on their time complexity. We show that free products in certain sense preserve time complexity of knapsack-type problems, while direct products may amplify it. This is joint work with Elizaveta Frenkel and Alexander Ushakov.

October 31, Graduate Center: Prasad Rao (Hewlett Packard), TBA

November 14, Graduate Center: Sven Dietrich (John Jay College), TBA

December 5, Graduate Center: Manhattan Algebra Day


To subscribe to the seminar mailing list, click here

Spring 2014 talks

Fall 2013 talks

Spring 2013 talks

Fall 2012 talks

Spring 2012 talks

Fall 2011 talks

Spring 2011 talks

Fall 2010 talks

Spring 2010 talks

Fall 2009 talks

Spring 2009 talks

Fall 2008 talks

Spring 2008 talks

Fall 2007 talks

Spring 2007 talks

Fall 2006 talks

Spring 2006 talks

Fall 2005 talks