CSE web calendar

Thursday, 23 May, 2013
Department Calendar

5:00am	BTP II stage presentation Last day of instructions
6:00am
7:00am
8:00am
9:00am
10:00am
11:00am
12:00pm
1:00pm
2:00pm
3:00pm	[3:00pm] Title: Functional encryption systems from hard lattice problems.
4:00pm
5:00pm

User:: Department Calendar
Send Reminder:: Yes - 25 hours 0 minutes before start
Description:: Speaker: Dr. Shweta Agarwal

Time: Wednesday, 18 April 2012, 3:00pm
Venue: K.R. Conference room, 01st Floor, ‘C’ Block, Dept. of CSE, Kanwal Rekhi Bldg.

Abstract:
Data security challenges faced in the modern world demand functionality from encryption systems that traditional public key cryptography falls far short in delivering.

Take the example of cloud computing, a paradigm which allows users to outsource their data storage and computing needs to a powerful third party server such as Amazon. Though such a service is very useful, users may be reluctant to trust third party servers with sensitive data. Organizations utilizing these services must also ensure that their clients are secure from each other. At the same time, meaningful functionality must be provided. For example a server storing medical data might be required to grant users access to certain useful functions computed on the entire user database, such as the success rate of some medication for a given disease, while making sure that individual medical privacy is not compromised.

To address these emerging needs, a new paradigm of encryption was recently put forward â€“ Functional Encryption. In functional encryption, a user's secret key can be associated with its holder's credentials, while the ciphertext can be associated with an access policy. We may ask that decryption succeed if and only if the credentials satisfy the access policy.

I will describe several special cases of functional encryption that we have constructed - systems for the identity function (identity based encryption or IBE), threshold function (fuzzy IBE) and linear functions. I will describe ongoing work to provide a general framework for these Constructions and challenges faced in supporting more general functions. The technical tool we use in these constructions is the worst-case hardness of lattice problems. Lattices have traditionally been used in cryptography for breaking cryptosystems and their use in building cryptosystems is surprising and elegant.

Speaker's Profile:
Shweta Agarwal, postdoctoral scholar at the University of California, Los Angeles. Her research interests lie in the general areas of cryptography and information theory. Dr. Shweta received PhD in February 2011 from the University of Texas at Austin; her thesis studied efficient and provably secure code constructions for encoding information. Detailed information can be found on my website (http://www.cs.ucla.edu/~shweta).

Organization:
University of California, Los Angeles

Host:

[Printer Friendly]