TinyKeys: a new approach to efficient multi-party computation

DOI10.1007/978-3-319-96878-0_1zbMATH Open1446.94135OpenAlexW2884328418MaRDI QIDQ5896075FDOQ5896075

Authors: Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez 

Publication date: 30 June 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://pure.au.dk/portal/da/publications/tinykeys-a-new-approach-to-efficient-multiparty-computation(25341756-f60b-46e7-b2c2-31bcc8d8013c).html

Recommendations

• TinyKeys: a new approach to efficient multi-party computation
• scientific article; zbMATH DE number 1583776
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Secure multiparty computation with minimal interaction
• scientific article; zbMATH DE number 1848306
• Minimal complete primitives for secure multi-party computation
• Secure multi-party computation made simple
• scientific article; zbMATH DE number 1952886
• An Efficient Framework for Unconditionally Secure Multiparty Computation
• Generalizing efficient multiparty computation

zbMATH Keywords

dishonest majority settingefficient MPC protocols with semi-honest security

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (15)

• Oblivious transfer with constant computational overhead
• The hardness of LPN over any integer ring and field for PCG applications
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• TinyKeys: a new approach to efficient multi-party computation
• Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
• High-performance multi-party computation for binary circuits based on oblivious transfer
• \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
• Large scale, actively secure computation from LPN and free-XOR garbled circuits
• The more the merrier: reducing the cost of large scale MPC
• A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
• Short signatures from regular syndrome decoding in the head
• Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
• An efficient structural attack on NIST submission DAGS
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited

This page was built for publication: TinyKeys: a new approach to efficient multi-party computation

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