Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
From MaRDI portal
Recommendations
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
- Hashing garbled circuits for free
- Fast garbling of circuits under standard assumptions
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
Cited in
(18)- On compiling Boolean circuits optimized for secure multi-party computation
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- Improvements for gate-hiding garbled circuits
- Efficient pseudorandom correlation generators from ring-LPN
- Garbled circuits with sublinear evaluator
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- Garbling XOR gates ``for free in the standard model
- Improved Garbled Circuit: Free XOR Gates and Applications
- Hashing garbled circuits for free
- SecGDB: graph encryption for exact shortest distance queries with efficient updates
- Mixed-technique multi-party computations composed of two-party computations
- Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
- Faster Privacy-Preserving Location Proximity Schemes
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- Secure approximate nearest neighbor search with locality-sensitive hashing
- Garbled circuit lookup tables with logarithmic number of ciphertexts
- Generation of authenticated secret-shared scaled unit vectors for beaver triples
This page was built for publication: Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648458)
