The Garbled Circuit (GC) is now over thirty years old, and many optimization methodologies have been proposed, including point-and-permute, row-reduction, free-XOR, fixed-key blockcipher, half-and.
But, after Googling papers and forums, I can't find any concrete algorithmic descriptions which includes all of these optimizations. Does anyone know the exact descriptions of optimized GCs?
I ask because I need to implement the algorithm for personal use.