Monday, August 28, 2:00PM
Babbio Center, Room 110
Stevens Institute of Technology
Abstract
Pairing-based cryptography is one of the most attractive and
extensively progressed areas in modern cryptography in the last
decade. This is because pairing technology has brought many
breakthroughs both in construction and analysis of cryptographic
schemes such as ID-based cryptosystem, short signatures, efficient
broadcast encryption, and MOV reduction. I will show a method of fast
pairing computation and its applications to anonymous signatures.