Ramp hyper-invertible matrices and their applications to MPC protocols
From MaRDI portal
Publication:6595682
DOI10.1007/978-981-99-8721-4_7zbMATH Open1546.94086MaRDI QIDQ6595682FDOQ6595682
Chen Yuan, Yanjiang Yang, Chaoping Xing, Hongqing Liu
Publication date: 30 August 2024
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)
Cites Work
- On the asymptotic behaviour of some towers of function fields over finite fields
- Rational points on curves over finite fields. Theory and Applications
- How to share a secret
- Algebraic Function Fields and Codes
- Title not available (Why is that?)
- Secure Computation from Random Error Correcting Codes
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Advances in Cryptology - CRYPTO 2003
- Scalable and Unconditionally Secure Multiparty Computation
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Optimal Rearrangeable Multistage Connecting Networks
- Perfectly-Secure MPC with Linear Communication Complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scalable Secure Multiparty Computation
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
- Cryptography in the multi-string model
- ATLAS: efficient and scalable MPC in the honest majority setting
- Fast large-scale honest-majority MPC for malicious adversaries
- Amortized complexity of information-theoretically secure MPC revisited
- Secure Multiparty Computation and Secret Sharing
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Guaranteed output delivery comes free in honest majority MPC
- Communication-efficient unconditional MPC with guaranteed output delivery
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- Broadcast Interactive Proofs
- 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)
