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

DOI10.1007/978-3-030-77883-5_2MaRDI QIDQ2056780zbMATH OpenOpenAlexFDO

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

Publication date 8 December 2021

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• scientific article; zbMATH DE number 1024063 (Why is no real title available?)
• scientific article; zbMATH DE number 1951605 (Why is no real title available?)
• scientific article; zbMATH DE number 2009976 (Why is no real title available?)
• scientific article; zbMATH DE number 2086626 (Why is no real title available?)
• scientific article; zbMATH DE number 2086702 (Why is no real title available?)
• scientific article; zbMATH DE number 1394292 (Why is no real title available?)
• scientific article; zbMATH DE number 4182679 (Why is no real title available?)
• A Unified Approach to MPC with Preprocessing Using OT
• A new approach to practical active-secure two-party computation
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
• Dishonest majority multi-party computation for binary circuits
• Efficient constant round multi-party computation combining BMR and SPDZ
• Efficient scalable constant-round MPC via garbled circuits
• Garbling XOR gates ``for free in the standard model
• Improved Garbled Circuit: Free XOR Gates and Applications
• LPN decoded
• Low cost constant round MPC combining BMR and oblivious transfer
• More efficient constant-round multi-party computation from BMR and SHE
• Multiparty Computation from Somewhat Homomorphic Encryption
• Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
• Overdrive: making SPDZ great again
• Scalable and Unconditionally Secure Multiparty Computation
• TinyKeys: a new approach to efficient multi-party computation
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• \textsc{KangarooTwelve}: fast hashing based on \({\mathrm {KECCAK}\mathrm{-}p}{}\)

Cited in

(1)

• Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption

This page was built for publication: Large scale, actively secure computation from LPN and free-XOR garbled circuits

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