Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
From MaRDI portal
Publication:6595675
DOI10.1007/978-981-99-8721-4_4zbMATH Open1546.94072MaRDI QIDQ6595675
Chaoping Xing, Chen Yuan, Daniel E. Escudero, Cheng Hong, Hongqing Liu
Publication date: 30 August 2024
Cites Work
- Title not available (Why is that?)
- Algebraic function fields and codes
- Amortized complexity of information-theoretically secure MPC revisited
- Secure computation based on leaky correlations: high resilience setting
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- The more the merrier: reducing the cost of large scale MPC
- Constant-overhead unconditionally secure multiparty computation over binary fields
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Efficient information-theoretic multi-party computation over non-commutative rings
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient fully secure computation via distributed zero-knowledge proofs
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation
- Simple Functional Encryption Schemes for Inner Products
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- On Ideal Lattices and Learning with Errors over Rings
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Theory of Cryptography
- On interactive oracle proofs for Boolean R1CS statements
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
Related Items (2)
Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE ⋮ More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
This page was built for publication: Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595675)
