The Centre for Computer and Information Security Research (CCISR) invites you to attend the Crypto Seminar with the following detail:
Date/time: Friday, 30 October 2015, 11:00-12:00
Venue: 214 Infrastructure Security Lab, Smart Building
Title: On the feasibility of Fully Homomorphic Encryption (FHE): A case study of sorting data in the encrypted domain
Speaker: Dr Praveen Gauravaram
Abstract: Fully Homomorphic Encryption (FHE) is a cryptographic technology invented by Gentry in 2009. FHE algorithms enable arbitrary computations on the encrypted data and still preserve confidentiality of the data. This property of FHE has great utility in cloud computing allowing data to be stored and managed securely in a cloud environment managed by (untrusted) cloud service providers. Since the invention of FHE there has been prolific growth in the design and analysis of FHE algorithms in the process of attaining efficient FHE algorithms. However, the practical viability of FHE, in general, has not seen a similar level of research progress.
In this talk, we focus on our recent work on assessing the practical nature of FHE algorithms with data sorting as the case study. We present analytical results of sorting algorithms that sort data encrypted with a FHE design based on Integers. Results show that Odd-Even Merge Sort has better performance than Insertion, Bubble and Bitonic sorting algorithms. We also observe that complexity of sorting in homomorphic domain will always have worst-case complexity independent of the nature of input. In addition, we show that combining different sorting algorithms to sort encrypted data does not give any performance gain when compared to the application of sorting algorithms individually.
Bio: Dr. Praveen Gauravaram is a research fellow and Unit-coordinator and Lecturer for cryptography at Queensland University of Technology. Praveen has both industrial and academic research experience and published more than 40 research papers and consultancy reports on various topics including Cryptographic hash functions, Block ciphers, Cloud computing, Fully Homomorphic Encryption and RFID protocols. He is a co-designer of Grøstl cryptographic hash function, a finalist in the SHA3 competition conducted by US National Institute of Standards and Technology (NIST) during 2007-12. He has also filed 3 US patents and has close association with Tata Consultancy Services Ltd.