Accession Number:

ADA627416

Title:

Minimizing Overhead for Secure Computation and Fully Homomorphic Encryption: Overhead

Descriptive Note:

Final rept. Oct 2010-Jun 2015

Corporate Author:

VIRGINIA UNIV CHARLOTTESVILLE

Personal Author(s):

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

Report Date:

2015-11-01

Pagination or Media Count:

939.0

Abstract:

Investigating the overhead associated with Fully Homomorphic Encryption, this project examined a wide range of topics, including Improving the efficiency of generating Yaos 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.

Descriptors:

• *COMPUTER ACCESS CONTROL
• *COMPUTER NETWORK SECURITY
• *CRYPTOGRAPHY
• ALGORITHMS
• BOOLEAN ALGEBRA
• CENTRAL PROCESSING UNITS
• COMMUNICATIONS PROTOCOLS
• COMPILERS
• COMPUTER ARCHITECTURE
• COMPUTER VIRUSES
• DATA PROCESSING SECURITY
• GATES(CIRCUITS)
• INFORMATION ASSURANCE
• PARALLEL PROCESSING
• SIGNATURES
• SYSTEMS ENGINEERING
• TEST AND EVALUATION

Subject Categories:

• Computer Hardware
• Computer Systems Management and Standards
• Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE