Paper 2024/1787
An Efficient and Secure Boolean Function Evaluation Protocol
Abstract
Boolean functions play an important role in designing and analyzing many cryptographic systems, such as block ciphers, stream ciphers, and hash functions, due to their unique cryptographic properties such as nonlinearity, correlation immunity, and algebraic properties. The secure evaluation of Boolean functions or Secure Boolean Evaluation (SBE) is an important area of research. SBE allows parties to jointly compute Boolean functions without exposing their private inputs. SBE finds applications in privacy-preserving protocols and secure multi-party computations. In this manuscript, we present an efficient and generic two-party protocol (namely $\textsf{BooleanEval}$) for the secure evaluation of Boolean functions by utilizing a 1-out-of-2 Oblivious Transfer (OT) as a building block. $\textsf{BooleanEval}$ only employs XOR operations as the core computational step, thus making it lightweight and fast. Unlike other lightweight state-of-the-art designs of SBE, $\textsf{BooleanEval}$ avoids the use of additional cryptographic primitives, such as hash functions and commitment schemes to reduce the computational overhead.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Boolean FunctionsSecure Boolean Function EvaluationOblivious TransferXOR
- Contact author(s)
-
sarkarsushmita408 @ gmail com
vikas math123 @ gmail com
mtapaswini37 @ gmail com
nknkundu @ gmail com
sd iitkgp @ gmail com - History
- 2024-11-04: approved
- 2024-11-01: received
- See all versions
- Short URL
- https://ia.cr/2024/1787
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1787, author = {Sushmita Sarkar and Vikas Srivastava and Tapaswini Mohanty and Nibedita Kundu and Sumit Kumar Debnath}, title = {An Efficient and Secure Boolean Function Evaluation Protocol}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1787}, year = {2024}, url = {https://eprint.iacr.org/2024/1787} }