Quadratic multiparty randomized encodings beyond honest majority and their applications

DOI10.1007/978-3-031-15985-5_16MaRDI QIDQ6166962zbMATH OpenOpenAlexFDO

Authors Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra

Publication date 7 July 2023

Published in Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15985-5_16

zbMATH Keywords

information-theoretic securitysecure multiparty computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• Perfect secure computation in two rounds
• Perfect secure computation in two rounds
• Succinct randomized encodings and their applications
• Computationally private randomizing polynomials and their applications
• On the power of secure two-party computation

Cites work

• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Communication Complexity of Simultaneous Messages
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Cryptography in NC^0
• Foundations of homomorphic secret sharing
• Founding Cryptography on Oblivious Transfer – Efficiently
• General constructions for information-theoretic private information retrieval
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1030984 (Why is no real title available?)
• Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
• On \(d\)-multiplicative secret sharing
• On perfectly secure 2PC in the OT-hybrid model
• On the power of correlated randomness in secure computation
• Perfect secure computation in two rounds
• Separating two-round secure computation from oblivious transfer
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• Two-round MPC: information-theoretic and black-box
• Two-round multiparty secure computation from minimal assumptions
• Unconditional and composable security using a single stateful Tamper-proof hardware token

Cited in

(1)

• Additive randomized encodings and their applications

This page was built for publication: Quadratic multiparty randomized encodings beyond honest majority and their applications

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