Ramp hyper-invertible matrices and their applications to MPC protocols
From MaRDI portal
Publication:6595682
Recommendations
- Perfectly-Secure MPC with Linear Communication Complexity
- Amortized complexity of information-theoretically secure MPC revisited
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Guaranteed output delivery comes free in honest majority MPC
Cites work
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- ATLAS: efficient and scalable MPC in the honest majority setting
- Advances in Cryptology - CRYPTO 2003
- Algebraic Function Fields and Codes
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Amortized complexity of information-theoretically secure MPC revisited
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Broadcast Interactive Proofs
- Communication-efficient unconditional MPC with guaranteed output delivery
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Cryptography in the multi-string model
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Fast large-scale honest-majority MPC for malicious adversaries
- Guaranteed output delivery comes free in honest majority MPC
- How to share a secret
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
- On the asymptotic behaviour of some towers of function fields over finite fields
- Optimal Rearrangeable Multistage Connecting Networks
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly-Secure MPC with Linear Communication Complexity
- Rational points on curves over finite fields. Theory and Applications
- Scalable Secure Multiparty Computation
- Scalable and Unconditionally Secure Multiparty Computation
- Secure Computation from Random Error Correcting Codes
- Secure multiparty computation and secret sharing
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
Cited in
(2)
This page was built for publication: Ramp hyper-invertible matrices and their applications to MPC protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595682)
