TinyKeys: a new approach to efficient multi-party computation

DOI10.1007/978-3-319-96878-0_1zbMath1446.94135OpenAlexW2884328418MaRDI QIDQ5896075

Emmanuela Orsini, Carmit Hazay, 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

zbMATH Keywords

dishonest majority settingefficient MPC protocols with semi-honest security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

An efficient structural attack on NIST submission DAGS ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Short signatures from regular syndrome decoding in the head ⋮ Oblivious transfer with constant computational overhead ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits

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