Large scale, actively secure computation from LPN and free-XOR garbled circuits

DOI10.1007/978-3-030-77883-5_2OpenAlexW3151125685MaRDI QIDQ2056780

Kelong Cong, Aner Ben-Efraim, Nigel P. Smart, Emmanuela Orsini, Eduardo Soria-Vazquez, Eran Omri

Publication date: 8 December 2021

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/676596

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
• Overdrive: making SPDZ great again
• \textsc{KangarooTwelve}: fast hashing based on \({\mathrm {KECCAK}\mathrm{-}p}{}\)
• LPN decoded
• Efficient scalable constant-round MPC via garbled circuits
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• A Unified Approach to MPC with Preprocessing Using OT
• Dishonest Majority Multi-Party Computation for Binary Circuits
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• More Efficient Constant-Round Multi-party Computation from BMR and SHE
• Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
• Improved Garbled Circuit: Free XOR Gates and Applications
• Scalable and Unconditionally Secure Multiparty Computation
• Garbling XOR Gates “For Free” in the Standard Model
• TinyKeys: a new approach to efficient multi-party computation
• Low cost constant round MPC combining BMR and oblivious transfer