Fast PCGs for batch-authenticated multiplication triples
From MaRDI portal
Cites work
- A new approach to practical active-secure two-party computation
- Circuits resilient to additive attacks with applications to secure computation
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Efficient pseudorandom correlation generators for any finite field
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Efficient pseudorandom correlation generators: silent OT extension and more
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Foundations of Cryptography
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty distributed point functions
- On the power of Sumcheck in secure multiparty computation
- Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding
- Secure multiparty computation with sublinear preprocessing
- Security and composition of multiparty cryptographic protocols
- Semi-homomorphic encryption and multiparty computation
- Stationary syndrome decoding for improved PCGs
- Sublinear GMW-style compiler for MPC with preprocessing
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
This page was built for publication: Fast PCGs for batch-authenticated multiplication triples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443581)