[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3474366acmconferencesBook PagePublication PagesccsConference Proceedingsconference-collections
WAHC '21: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography
ACM2021 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security Virtual Event Republic of Korea 15 November 2021
ISBN:
978-1-4503-8656-2
Published:
15 November 2021
Sponsors:
Next Conference
October 13 - 17, 2025
Taipei , Taiwan
Reflects downloads up to 02 Dec 2024Bibliometrics
Skip Abstract Section
Abstract

It is our great pleasure to welcome you to the WAHC 2021 - 9th Workshop on Encrypted Computing & Applied Homomorphic Cryptography. WAHC was created in 2013 as a forum to foster discussion of a wide variety of aspects of encrypted computing. This year's workshop continues its tradition of bringing together professionals, researchers and practitioners from industry, government, and academia to discuss the latest progress in topics such as homomorphic encryption, multiparty computation, functional encryption, secure function evaluation, private information retrieval and searchable encryption.

The call for papers attracted submissions from Asia, Europe, South America, and the United States. There were 21 submissions this year. Each submission was reviewed by at least three Program Committee members. This year, the submissions were of very high quality, and it was a challenging task to select 4 full papers and 3 demo papers that showcase the wide range of techniques and interests of the community.

Skip Table Of Content Section
SESSION: Session 1
research-article
Integer Functions Suitable for Homomorphic Encryption over Finite Fields

Fully Homomorphic Encryption (FHE) gives the ability to evaluate any function over encrypted data. However, despite numerous improvements during the last decade, the computational overhead caused by homomorphic computations is still very important. As a ...

short-paper
Open Access
Pyfhel: PYthon For Homomorphic Encryption Libraries

Fully Homomorphic Encryption (FHE) allows private computation over encrypted data, disclosing neither the inputs, intermediate values nor results. Thanks to recent advances, FHE has become feasible for a wide range of applications, resulting in an ...

SESSION: Session 2
research-article
Bootstrapping in FHEW-like Cryptosystems

FHEW and TFHE are fully homomorphic encryption (FHE) cryptosystems that can evaluate arbitrary Boolean circuits on encrypted data by bootstrapping after each gate evaluation. The FHEW cryptosystem was originally designed based on standard (Ring, ...

research-article
Open Access
Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors

Oblivious linear evaluation (OLE) is a fundamental building block in multi-party computation protocols. In OLE, a sender holds a description of an affine function $f_α,β (z)=α z+β$, the receiver holds an input x, and gets α x+β$ (where all computations ...

SESSION: Session 3
research-article
EVA Improved: Compiler and Extension Library for CKKS

Homomorphic encryption (HE), especially the CKKS scheme, can be extremely challenging to use. The EVA language and compiler (Dathathri et al., PLDI 2020) was an attempt at addressing this challenge. EVA allows a developer to express their encrypted ...

short-paper
Open Access
Intel HEXL: Accelerating Homomorphic Encryption with Intel AVX512-IFMA52

Modern implementations of homomorphic encryption (HE) rely heavily on polynomial arithmetic over a finite field. This is particularly true of the BGV, BFV, and CKKS HE schemes. Two of the biggest performance bottlenecks in HE primitives and applications ...

short-paper
Open Access
Towards Better Standard Cell Library: Optimizing Compound Logic Gates for TFHE

In this paper, we cryptographically optimize the constructions of3-input gates or multi-output gates using Fully Homomorphic Encryption (FHE) including Half Adder, Full Adder and AOI21. We implemented the gates over Torus Fully Homomorphic Encryption(...

Contributors
  • Gottfried Wilhelm Leibniz University Hannover
  • University of London
  • New Jersey Institute of Technology
  1. Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography
      Please enable JavaScript to view thecomments powered by Disqus.

      Recommendations

      Acceptance Rates

      Overall Acceptance Rate 6 of 17 submissions, 35%
      YearSubmittedAcceptedRate
      WAHC '1817635%
      Overall17635%