Minimizing Overhead for Secure Computation and Fully Homomorphic Encryption: Overhead

Abstract

Investigating the overhead associated with Fully Homomorphic Encryption, this project examined a wide range of topics, including; Improving the efficiency of generating Yao's Garbled Circuits, Secure 2 Party Computation, Non- Maleable and Zero-Proof Secure Computation, Digital Signatures, Fully Homomorphic Encryption and Somewhat Homomorphic Encryption, Program Obfuscation and a secure Bitcoin implementation. Many papers were written (see appendices) and much of this work has been presented in premier Security, Privacy and Cryptography Conferences.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2015
Accession Number
ADA627416

Entities

People

  • Abhi Shelat
  • Rafael Pass
  • Steven Myers
  • Susan Hohenberger

Organizations

  • University of Virginia

Tags

Communities of Interest

  • C4I
  • Cyber
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Asymetric Encryption
  • Automata
  • Blockchain
  • Coding
  • Communication Channels
  • Computational Science
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Cryptography
  • Electronic Mail
  • Mobile Phones
  • Network Science
  • Operating Systems
  • Security Protocols
  • Trees (Data Structures)

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computer Science.
  • Cybersecurity.

Technology Areas

  • Cyber
  • Cyber - Cryptography