Manoranjan Maiti
India
C. Pandu Rangan
India
Signcryption in standard model
Abstract.
This talk aims to present a survey of some recent results in signcryption in a tutorial fashion.
Signcryption is a primitive that combines encryption and signature in a single primitive and the goal
is to design a protocol that would be cheaper than the combined cost of individual execution of
encryption and signature. We examine provably secure protocols in standard model. We discuss
signcryption in both id based and certificate less settings and explain some attacks on some of the
existing systems. We will also propose a new system and discuss the details of its security.
Close
Abstract.
This talk aims to present a survey of some recent results in signcryption in a tutorial fashion.
Signcryption is a primitive that combines encryption and signature in a single primitive and the goal
is to design a protocol that would be cheaper than the combined cost of individual execution of
encryption and signature. We examine provably secure protocols in standard model. We discuss
signcryption in both id based and certificate less settings and explain some attacks on some of the
existing systems. We will also propose a new system and discuss the details of its security.
Close
Abhijit Das
India
Elliptic-Curve Cryptography (ECC)
Elliptic curves over finite fields are widely used in various public-key cryptographic protocols, and are preferred because they support smaller key
sizes than other popular cryptosystems. This talk focuses upon elliptic-curve arithmetic. The first topic to be covered is the double-and-add
scalar-multiplication algorithm along with its various windowed variants. This is followed by how scalar multiplication can be speeded up using
projective and mixed coordinate systems. Montgomery ladders which apply to x-coordinate-only computations and which are robust against side-channel
attacks are subsequently discussed. The last part of the talk introduces bilinear pairing maps on elliptic-curve groups and some of their recent
applications to pairing-based cryptography.
Close
Elliptic curves over finite fields are widely used in various public-key cryptographic protocols, and are preferred because they support smaller key
sizes than other popular cryptosystems. This talk focuses upon elliptic-curve arithmetic. The first topic to be covered is the double-and-add
scalar-multiplication algorithm along with its various windowed variants. This is followed by how scalar multiplication can be speeded up using
projective and mixed coordinate systems. Montgomery ladders which apply to x-coordinate-only computations and which are robust against side-channel
attacks are subsequently discussed. The last part of the talk introduces bilinear pairing maps on elliptic-curve groups and some of their recent
applications to pairing-based cryptography.
Close
