MSc. Shaza Zeitouni

Research Assistant

Mornewegstraße 30
D-64293 Darmstadt
GERMANY

Building: S4|14
Room:4.1.09
Phone:+49 (0)6151 / 16 - 25321
Email:shaza.zeitouni(a-t)crisp-da.de
Website:https://www.trust.informatik.tu-darmstadt.de/people/shaza-zeitouni/

 

Vita

Since 2014

Research Assistant

at CYSEC and Technische Universität DarmstadtGermany

2012-2014

M.Sc. CSE

at Technische Universität Braunschweig, Germany

2001-2006

B.Sc. Electrical Engineering

at Aleppo University, Syria

 

 

Publications

Automated Synthesis of Optimized Circuits for Secure Computation

Author Daniel Demmler, Ghada Dessouky, Farinaz Koushanfar, Ahmad-Reza Sadeghi, Thomas Schneider, Shaza Zeitouni
Date October 2015
Kind Inproceedings
Book title22nd ACM Conference on Computer and Communications Security (CCS'15)
LocationDenver, Colorado, USA
KeyTUD-CS-2015-1340
Research Areas System Security Lab, E3, CYSEC, Engineering Cryptographic Protocols, Solutions, S2, Primitives, P3, CROSSING, Engineering
Abstract In the recent years, secure computation has been the subject of intensive research, emerging from theory to practice. In order to make secure computation usable by non-experts, Fairplay (USENIX Security 2004) initiated a line of research in compilers that allow to automatically generate circuits from high-level descriptions of the functionality that is to be computed securely. Most recently, TinyGarble (IEEE S\&P 2015) demonstrated that it is natural to use existing hardware synthesis tools for this task. In this work, we present how to use industrial-grade hardware synthesis tools to generate circuits that are not only optimized for size, but also for depth. These are required for secure computation protocols with non-constant round complexity. We compare a large variety of circuits generated by our toolchain with hand-optimized circuits and show reduction of depth by up to 14\%. The main advantages of our approach are developing customized libraries of depth-optimized circuit constructions which we map to high-level functions and operators, and using existing libraries available in the industrial-grade logic synthesis tools which are heavily tested. In particular, we show how to easily obtain circuits for IEEE 754 compliant floating-point operations. We extend the open source ABY framework (NDSS 2015) to securely evaluate circuits generated with our toolchain and show between 0.5 to 21.4 times faster floating-point operations than previous protocols of Aliasgari et al. (NDSS 2013), even though our protocols work for two parties instead of three or more. As application we consider privacy-preserving proximity testing on Earth.
[Export this entry to BibTeX]

Important Copyright Notice:

The documents contained in these directories are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
A A A | Drucken Drucken | Impressum Impressum | Sitemap Sitemap | Kontakt Kontakt | Webseitenanalyse: Mehr Informationen
zum Seitenanfangzum Seitenanfang