TinyLabels: how to compress garbled circuit input labels, efficiently

DOI10.1007/978-3-031-91095-1_9MaRDI QIDQ6891210zbMATH OpenFDO

Authors Marian Dietz, Hanjun Li, Huijia Lin

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91095-1_9

zbMATH Keywords

input label compression techniqueRing-LWE

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Adaptive garbled RAM from laconic oblivious transfer
• Adaptively secure garbling with near optimal online complexity
• Attribute-based encryption for circuits of unbounded depth from lattices
• Authenticated garbling from simple correlations
• Breaking the circuit size barrier for secure computation under DDH
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Efficient laconic cryptography from learning with errors
• Encoding functions with constant online rate or how to compress garbled circuits keys
• Flexor: Flexible garbling for XOR gates that beats free-XOR
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with polylog overhead
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Improved Garbled Circuit: Free XOR Gates and Applications
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Indistinguishability obfuscation for Turing machines with unbounded memory
• Indistinguishability obfuscation for Turing machines: constant overhead and amortization
• Multiparty Computation from Somewhat Homomorphic Encryption
• On the communication complexity of secure function evaluation with long output
• On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
• On the power of correlated randomness in secure computation
• On the security of the ``Free-XOR technique
• Reusable garbled circuits and succinct functional encryption
• Secure two-party computation is practical
• Secure two-party computation via cut-and-choose oblivious transfer
• Succinct computational secret sharing
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits
• Two halves make a whole: reducing data transfer in garbled circuits using half gates

This page was built for publication: TinyLabels: how to compress garbled circuit input labels, efficiently

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891210)