FASE: FPGA Acceleration of Secure Function Evaluation
Authors:
- 1 April 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 24, 280-288
Abstract
We present FASE, an FPGA accelerator for Secure Function Evaluation (SFE) by employing the well-known cryptographic protocol named Yao's Garbled Circuit (GC). SFE allows two parties to jointly compute a function on their private data and learn the output without revealing their inputs to each other. FASE is designed to allow cloud servers to provide secure services to a large number of clients in parallel while preserving the privacy of the data from both sides. Current SFE accelerators either target specific applications, and therefore are not amenable to generic use, or have low throughput due to inefficient management of resources. In this work, we present a pipelined architecture along with an efficient scheduling scheme to ensure optimal usage of the available resources. The scheme is built around a simulator of the hardware design that schedules the workload and assigns the most suitable task to the encryption cores at each cycle. This, coupled with optimal management of the read and write cycles of the Block RAM on FPGA, results in a minimum 2 orders of magnitude improvement in terms of throughput per core for the reported benchmarks compared to the most recent generic GC accelerator. Moreover, our encryption core requires 17% less resource compared to the most recent secure GC realization.Keywords
This publication has 26 references indexed in Scilit:
- TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits2015
- Computer science: The learning machinesNature, 2014
- A survey of pipelined workflow schedulingACM Computing Surveys, 2013
- Classification and generation of disturbance vectors for collision attacks against SHA-1Designs, Codes and Cryptography, 2011
- Analysis and Enhancement of Random Number Generator in FPGA Based on Oscillator RingsInternational Journal of Reconfigurable Computing, 2009
- Improved Garbled Circuit: Free XOR Gates and Applications2008
- Finding Collisions in the Full SHA-12005
- Hardware Architecture and Cost Estimates for Breaking SHA-1Lecture Notes in Computer Science, 2005
- Machine learning in automated text categorizationACM Computing Surveys, 2002
- Benchmarking and Comparison of the Task Graph Scheduling AlgorithmsJournal of Parallel and Distributed Computing, 1999