scientific article; zbMATH DE number 2009982
From MaRDI portal
Publication:4434901
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
secure multi-party computationlinear secret sharingmultiplicative span programsrandomizing polynomials
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (19)
Sumcheck arguments and their applications ⋮ Efficient information-theoretic multi-party computation over non-commutative rings ⋮ Best possible information-theoretic MPC ⋮ Communication Lower Bounds via Critical Block Sensitivity ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ Graph coloring applied to secure computation in non-abelian groups ⋮ \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks ⋮ Private simultaneous messages based on quadratic residues ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Efficient integer span program for hierarchical threshold access structure ⋮ Key-dependent message security: generic amplification and completeness ⋮ 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} \) ⋮ Generic Constant-Round Oblivious Sorting Algorithm for MPC ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer
This page was built for publication:
