Paper 2022/1278
Fast Evaluation of S-boxes with Garbled Circuits
Abstract
Garbling schemes are vital primitives for privacy-preserving protocols and secure two-party computation. In projective garbling schemes,
Note: This is the submitted version. For copyright reasons, the published version can be found in IEEE Transactions on Information Forensics and Security, vol. 19, pp. 5530-5544, 2024 or on https://arxiv.org/abs/2405.20713
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. IEEE Transactions on Information Forensics and Security
- DOI
- 10.1109/TIFS.2024.3402145
- Keywords
- garbled circuitsgarbling schemesubstitution-permutation cipherS-boxmulti-party computation
- Contact author(s)
-
erik pohle @ esat kuleuven be
aysajan abidin @ esat kuleuven be
bart preneel @ esat kuleuven be - History
- 2024-06-05: last of 3 revisions
- 2022-09-26: received
- See all versions
- Short URL
- https://ia.cr/2022/1278
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1278, author = {Erik Pohle and Aysajan Abidin and Bart Preneel}, title = {Fast Evaluation of S-boxes with Garbled Circuits}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1278}, year = {2022}, doi = {10.1109/TIFS.2024.3402145}, url = {https://eprint.iacr.org/2022/1278} }