Difference between revisions of "Frederik Armknecht"

From ESC2013
Jump to: navigation, search
 
Line 6: Line 6:
  
 
In this talk, we present various recent results on group-homomorphic encryption schemes like a security characterization in terms of an algebraic problem, a complete characterization both in terms of security and design of a specific sub-class called shift-type, and
 
In this talk, we present various recent results on group-homomorphic encryption schemes like a security characterization in terms of an algebraic problem, a complete characterization both in terms of security and design of a specific sub-class called shift-type, and
 
 
the general impossibility of group homomorphic encryption in the presence of quantum adversaries. Furthermore, we point out some connections to fully-homomorphic encryption schemes and state several research directions.
 
the general impossibility of group homomorphic encryption in the presence of quantum adversaries. Furthermore, we point out some connections to fully-homomorphic encryption schemes and state several research directions.
  
 
'''Slides''' [[Media:Armknecht_ESC.pdf|PDF]]
 
'''Slides''' [[Media:Armknecht_ESC.pdf|PDF]]

Latest revision as of 23:07, 21 January 2013

Title On group-homomorphic encryption

Abstract

Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation.

In this talk, we present various recent results on group-homomorphic encryption schemes like a security characterization in terms of an algebraic problem, a complete characterization both in terms of security and design of a specific sub-class called shift-type, and the general impossibility of group homomorphic encryption in the presence of quantum adversaries. Furthermore, we point out some connections to fully-homomorphic encryption schemes and state several research directions.

Slides PDF