Processing math: 100%
Aggregate Encryption Individual Decryption for FPGA Bitstream Protection on Cloud | IEEE Conference Publication | IEEE Xplore

Aggregate Encryption Individual Decryption for FPGA Bitstream Protection on Cloud


Abstract:

Cloud computing platforms are progressively adopting Field Programmable Gate Arrays (FPGAs) to deploy specialized hardware accelerators for specific computational tasks. ...Show More

Abstract:

Cloud computing platforms are progressively adopting Field Programmable Gate Arrays (FPGAs) to deploy specialized hardware accelerators for specific computational tasks. However, the security of FPGA-based bitstream for Intellectual Property (IP) cores from unauthorized interception in cloud environments remains a prominent concern. Existing methodologies for protection of these bitstreams have several limitations, such as requiring a large number of keys, tying bitstreams to specific FPGAs, and relying on trusted third parties. This paper proposes AgEID (Aggregate Encryption and Individual Decryption), a cryptosystem based on key aggregation to enhance the security of FPGA-based bitstreams for IP cores and to address the pitfalls of previous related works. By this scheme, IP providers can encrypt their bitstreams using a single key for a given set of FPGA boards, and this same key then decrypts the bitstream on any of the FPGA boards within that set. Aggregate encryption of this single key is performed in a way which ensures that the key can solely be obtained onboard through individual decryption employing the board's private key, thus facilitating secure key provisioning, The proposed cryptosystem is evaluated mainly on Xilinx \text{Zynq}^{\text{TM}}7000 FPGAs. The outcomes demonstrate that our cryptosystem outperforms existing techniques with respect to resource, time and energy sianiflcantly,
Date of Conference: 16-17 May 2024
Date Added to IEEE Xplore: 05 November 2024
ISBN Information:
Conference Location: Orlando, FL, USA

References

References is not available for this document.