TinyKeys: a new approach to efficient multi-party computation
From MaRDI portal
Recommendations
- TinyKeys: a new approach to efficient multi-party computation
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Concrete efficiency improvements for multiparty garbling with an honest majority
- ATLAS: efficient and scalable MPC in the honest majority setting
- Perfectly-Secure MPC with Linear Communication Complexity
Cites work
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- A new approach to practical active-secure two-party computation
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- A simpler variant of universally composable security for standard multiparty computation
- A Unified Approach to MPC with Preprocessing Using OT
- Advances in Cryptology - CRYPTO 2003
- Analysis of information set decoding for a sub-linear error weight
- Attacking and Defending the McEliece Cryptosystem
- Concrete efficiency improvements for multiparty garbling with an honest majority
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Cryptography with constant input locality
- Decoding linear codes with high error rate and its impact for LPN security
- Decoding one out of many
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Efficient constant round multi-party computation combining BMR and SPDZ
- Efficient scalable constant-round MPC via garbled circuits
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- Garbling XOR gates ``for free in the standard model
- scientific article; zbMATH DE number 4179278 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 3793915 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improved OT extension for transferring short secrets
- Linearization Attacks Against Syndrome Based Hashes
- Low cost constant round MPC combining BMR and oblivious transfer
- More efficient constant-round multi-party computation from BMR and SHE
- Multiparty computation with low communication, computation and interaction via threshold FHE
- New generic algorithms for hard knapsacks
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the computational overhead of MPC with dishonest majority
- On the inherent intractability of certain coding problems (Corresp.)
- Scalable and Unconditionally Secure Multiparty Computation
- Security bounds for the design of code-based cryptosystems
- Smaller decoding exponents: ball-collision decoding
- Subspace LWE
- The extended \(k\)-tree algorithm
- TinyKeys: a new approach to efficient multi-party computation
Cited in
(5)- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- A protocol for provably secure authentication of a tiny entity to a high performance computing one
- Communication-efficient proactive MPC for dynamic groups with dishonest majorities
- TinyKeys: a new approach to efficient multi-party computation
- The regular multivariate quadratic problem
This page was built for publication: TinyKeys: a new approach to efficient multi-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918657)
