Publication:4434901
From MaRDI portal
zbMath1038.94554MaRDI QIDQ4434901
Yuval Ishai, Eyal Kushilevitz, Serge Fehr, Ronald Cramer
Publication date: 26 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560596.htm
secure multi-party computation; linear secret sharing; multiplicative span programs; randomizing polynomials
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
94A62: Authentication, digital signatures and secret sharing
Related Items
Communication Lower Bounds via Critical Block Sensitivity, Garbled Circuits as Randomized Encodings of Functions: a Primer, \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks, Private simultaneous messages based on quadratic residues, Doubly efficient interactive proofs over infinite and non-commutative rings, Key-dependent message security: generic amplification and completeness, Best possible information-theoretic MPC, Towards breaking the exponential barrier for general secret sharing, Graph coloring applied to secure computation in non-abelian groups, On abelian and homomorphic secret sharing schemes, Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes, Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \), Sumcheck arguments and their applications, Efficient information-theoretic multi-party computation over non-commutative rings, Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings, Efficient integer span program for hierarchical threshold access structure, Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \), Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys, Generic Constant-Round Oblivious Sorting Algorithm for MPC
