Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

DOI10.1145/277697.277716zbMath1333.94036OpenAlexW2036133214WikidataQ56806885 ScholiaQ56806885MaRDI QIDQ2790105

Michael O. Rabin, Tal Rabin, Rosario Gennaro

Publication date: 2 March 2016

Published in: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/277697.277716

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)

Related Items

YOSO: You only speak once. Secure MPC with stateless ephemeral roles, Fluid MPC: secure multiparty computation with dynamic participants, ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls, Implementing secure reporting of sexual misconduct -- revisiting WhoToo, Secure Multi-party Shuffling, Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials, Secure multi-party computation in large networks, How to deal with malicious users in privacy‐preserving distributed data mining, Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time, Asymptotically free broadcast in constant expected time via packed VSS, On multiparty garbling of arithmetic circuits, Constructing ideal secret sharing schemes based on Chinese remainder theorem, Cryptography and cryptographic protocols, Realistic versus Rational Secret Sharing, Improved building blocks for secure multi-party computation based on secret sharing with honest majority, Multi-party computation with conversion of secret sharing, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Secret-Sharing Schemes: A Survey, A full proof of the BGW protocol for perfectly secure multiparty computation, MPC vs. SFE : Unconditional and Computational Security, Block cipher invariants as eigenvectors of correlation matrices, Polynomial Evaluation and Side Channel Analysis, Efficient perfectly secure computation with optimal resilience, Efficient perfectly secure computation with optimal resilience, Reducing the Complexity in the Distributed Computation of Private RSA Keys, Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation, Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing, Secure distributed storage and retrieval, Practically Efficient Secure Single-Commodity Multi-market Auctions