Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation
 
conference paper

EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation

Dathathri, Roshan
•
Kostova, Blagovesta  
•
Saarikivi, Olli
Show more
January 1, 2020
Proceedings Of The 41St Acm Sigplan Conference On Programming Language Design And Implementation (Pldi '20)
41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Fully-Homomorphic Encryption (FHE) offers powerful capabilities by enabling secure offloading of both storage and computation, and recent innovations in schemes and implementations have made it all the more attractive. At the same time, FHE is notoriously hard to use with a very constrained programming model, a very unusual performance profile, and many cryptographic constraints. Existing compilers for FHE either target simpler but less efficient FHE schemes or only support specific domains where they can rely on expert-provided high-level runtimes to hide complications.

This paper presents a new FHE language called Encrypted Vector Arithmetic (EVA), which includes an optimizing compiler that generates correct and secure FHE programs, while hiding all the complexities of the target FHE scheme. Bolstered by our optimizing compiler, programmers can develop efficient general-purpose FHE applications directly in EVA. For example, we have developed image processing applications using EVA, with a very few lines of code.

EVA is designed to also work as an intermediate representation that can be a target for compiling higher-level domain-specific languages. To demonstrate this, we have re-targeted CHET, an existing domain-specific compiler for neural network inference, onto EVA. Due to the novel optimizations in EVA, its programs are on average 5.3x faster than those generated by CHET. We believe that EVA would enable a wider adoption of FHE by making it easier to develop FHE applications and domain-specific FHE compilers.

  • Details
  • Metrics
Type
conference paper
DOI
10.1145/3385412.3386023
Web of Science ID

WOS:000614622300037

Author(s)
Dathathri, Roshan
Kostova, Blagovesta  
Saarikivi, Olli
Dai, Wei
Laine, Kim
Musuvathi, Madan
Date Issued

2020-01-01

Publisher

ASSOC COMPUTING MACHINERY

Publisher place

New York

Published in
Proceedings Of The 41St Acm Sigplan Conference On Programming Language Design And Implementation (Pldi '20)
ISBN of the book

978-1-4503-7613-6

Start page

546

End page

561

Subjects

Computer Science, Software Engineering

•

Computer Science, Theory & Methods

•

Computer Science

•

homomorphic encryption

•

compiler

•

neural networks

•

privacy-preserving machine learning

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LAMS  
Event nameEvent placeEvent date
41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

ELECTR NETWORK

Jun 15-20, 2020

Available on Infoscience
March 26, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/176603
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés