|
Back to list of 2004/05 seminars
Abstract for Seminar
  |   |   |
Escrow Free Cryptographic Workflow
|
Tuesday 1st February 2005
|
16:00
|
Brian Spratt Room
|
  |   |   |
Professor Nigel Smart
University of Bristol
|
|
|
  |   |   |
Cryptographic workflow is a term coined by Paterson for the use of ID-based
cryptography in a system where the recipient encrypts to keys whose private
component may not yet exist.
The idea is that the recipient has to engage in a "workflow" to obtain
the keys by performing some acts, or showing posession of data, for the
relevant authorization authorities.
The basic idea was introduced by Chen, Harrison, Soldera and Smart (later
generalized by Smart) and a related concept introduced by Li, Du and Boneh
in the context of trust negotiation for PKIs.
In this talk we present a full security model for such schemes for arbitrary
policies and present a provably secure scheme within the model. In addition,
our scheme is "escrow-free", by which we mean that the authorization
authorities can determine no information about the actual message being
encrypted, a property not holding for prior work in this area.
|
Cryptographic workflow is a term coined by Paterson for the use of ID-based
cryptography in a system where the recipient encrypts to keys whose private
component may not yet exist.
The idea is that the recipient has to engage in a "workflow" to obtain
the keys by performing some acts, or showing posession of data, for the
relevant authorization authorities.
The basic idea was introduced by Chen, Harrison, Soldera and Smart (later
generalized by Smart) and a related concept introduced by Li, Du and Boneh
in the context of trust negotiation for PKIs.
In this talk we present a full security model for such schemes for arbitrary
policies and present a provably secure scheme within the model. In addition,
our scheme is "escrow-free", by which we mean that the authorization
authorities can determine no information about the actual message being
encrypted, a property not holding for prior work in this area.
|
Last modified Mon Feb 14 10:22:43 GMT 2005
Problems with this page?
Contact the CS Webmaster
|
http://www.cs.kent.ac.uk/dept_info/seminars/2004_05/abs_2005_02_01.html
|
|