Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
From MaRDI portal
Publication:3648458
DOI10.1007/978-3-642-10433-6_1zbMath1287.94078OpenAlexW1534636449MaRDI QIDQ3648458
Vladimir Kolesnikov, Thomas Schneider, Ahmad-Reza Sadeghi
Publication date: 26 November 2009
Published in: Cryptology and Network Security (Search for Journal in Brave)
Full work available at URL: https://encrypto.de/papers/KSS09.pdf
Related Items (9)
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ Garbling XOR gates ``for free in the standard model ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ On compiling Boolean circuits optimized for secure multi-party computation ⋮ Faster Privacy-Preserving Location Proximity Schemes ⋮ Privacy-preserving outsourcing of image feature extraction in cloud computing ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates ⋮ Efficient pseudorandom correlation generators from ring-LPN
This page was built for publication: Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
