scientific article
From MaRDI portal
Publication:3374918
zbMath1082.94515MaRDI QIDQ3374918
Ronald Cramer, Ueli M. Maurer, Ivan B. Damgård
Publication date: 1 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (80)
Multi-party revocation in sovrin: performance through distributed trust ⋮ 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 ⋮ The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ Secret-sharing schemes for very dense graphs ⋮ ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ How to Share a Secret, Infinitely ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ On the (in)efficiency of non-interactive secure multiparty computation ⋮ Improving the round complexity of VSS in point-to-point networks ⋮ Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems ⋮ Secure multi-party computation protocol for sequencing problem ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ A group identification protocol with leakage resilience of secret sharing scheme ⋮ On \(d\)-multiplicative secret sharing ⋮ Properties of constacyclic codes under the Schur product ⋮ Secret sharing schemes with strong multiplication and a large number of players from toric varieties ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Quantum multi-party private set union protocol based on least common multiple and Shor’s algorithm ⋮ Coset bounds for algebraic geometric codes ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Revisiting group oriented secret sharing schemes ⋮ Perfect MPC over layered graphs ⋮ Bivariate polynomial-based secret sharing schemes with secure secret reconstruction ⋮ Ideal uniform multipartite secret sharing schemes ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures ⋮ Secret sharing on regular bipartite access structures ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ The optimal linear secret sharing scheme for any given access structure ⋮ Methods of encrypting monotonic access structures ⋮ Foundations of Homomorphic Secret Sharing ⋮ On Linear Secret Sharing for Connectivity in Directed Graphs ⋮ A note on ramp secret sharing schemes from error-correcting codes ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Secret-Sharing Schemes: A Survey ⋮ Ideal Secret Sharing Schemes for Useful Multipartite Access Structures ⋮ Secure Outsourced Computation ⋮ Processing secure, verifiable and efficient SQL over outsourced database ⋮ Construction of arithmetic secret sharing schemes by using torsion limits ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Secure multi-party computation made simple ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Secret sharing schemes based on graphical codes ⋮ Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes ⋮ Graph Design for Secure Multiparty Computation over Non-Abelian Groups ⋮ Strong \((n, t, n)\) verifiable secret sharing scheme ⋮ Efficient Simultaneous Broadcast ⋮ OT-Combiners via Secure Computation ⋮ Linear multi-secret sharing schemes based on multi-party computation ⋮ Secure publicly verifiable and proactive secret sharing schemes with general access structure ⋮ Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств ⋮ Squares of matrix-product codes ⋮ Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes ⋮ Generic Constant-Round Oblivious Sorting Algorithm for MPC ⋮ Round-efficient perfectly secure message transmission scheme against general adversary ⋮ High dimensional affine codes whose square has a designed minimum distance ⋮ Counting Method for Multi-party Computation over Non-abelian Groups ⋮ A Single Initialization Server for Multi-party Cryptography ⋮ Efficient explicit constructions of compartmented secret sharing schemes ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA ⋮ Unnamed Item ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ On Secret Sharing with Nonlinear Product Reconstruction ⋮ Oblivious transfer based on single-qubit rotations ⋮ New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
This page was built for publication:
