Reconciling Non-malleability with Homomorphic Encryption

Document Type

Presentation Abstract

Presentation Date

12-10-2008

Abstract

Jomomorphic encryption schemes allow for very simple "computations" on encrypted data, and are therefore convenient tools in the design of conceptually simple cryptographic protocols. Non-malleability is a property of encryption schemes that is necessary when making security guarantees against malicious adversaries. However, these two desirable properties of encryption are mutually exclusive.

In this talk, I will discuss how these two opposing demands can be reconciled into a powerful notion for public-key encryption. An interesting application of these new results is an anonymous data-collection protocol, which is efficient, conceptually simple, yet secure in the strongest known sense. I will also discuss some consequences regarding automated analysis of cryptographic protocols. This is joint work with Manoj Prabhakaran.

Additional Details

Wednesday, 10 December 2008
4:10 p.m. in Social Science 362
Refreshments in same room from 3:30 to 4:00

This document is currently not available here.

Share

COinS