Efficient information-theoretic multi-party computation over non-commutative rings
From MaRDI portal
Publication:2128567
DOI10.1007/978-3-030-84245-1_12zbMath1486.94149OpenAlexW3192050161MaRDI QIDQ2128567
Eduardo Soria-Vazquez, Daniel E. Escudero
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_12
Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
MinRank in the head. Short signatures from zero-knowledge proofs ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings
Cites Work
- Unnamed Item
- Unnamed Item
- Amortized complexity of information-theoretically secure MPC revisited
- Graph coloring applied to secure computation in non-abelian groups
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae
- How to share a secret
- Scalable and Unconditionally Secure Multiparty Computation
- The Byzantine Generals Problem
- Computing Algebraic Formulas Using a Constant Number of Registers
- On linear systems and noncommutative rings
- Definability of linear equation systems over groups and rings
- On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
- Perfectly-Secure MPC with Linear Communication Complexity
This page was built for publication: Efficient information-theoretic multi-party computation over non-commutative rings
