Paper 2024/1532
Bitwise Garbling Schemes --- A Model with -bit Lower Bound of Ciphertexts
Abstract
At Eurocrypt 2015, Zahur, Rosulek, and Evans proposed the model of Linear Garbling Schemes.
This model proved a
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Garbled circuit2PCLinear garbling scheme
- Contact author(s)
-
xf555233 @ mail ustc edu cn
hghu2005 @ ustc edu cn
xuchangh @ mail ustc edu cn - History
- 2025-01-12: revised
- 2024-09-30: received
- See all versions
- Short URL
- https://ia.cr/2024/1532
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1532, author = {Fei Xu and Honggang Hu and Changhong Xu}, title = {Bitwise Garbling Schemes --- A Model with $\frac{3}{2}\kappa$-bit Lower Bound of Ciphertexts}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1532}, year = {2024}, url = {https://eprint.iacr.org/2024/1532} }