Cryptography with weights: MPC, encryption and signatures

DOI10.1007/978-3-031-38557-5_10OpenAlexW4385654138MaRDI QIDQ6186595FDOQ6186595

Authors: Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang 

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38557-5_10

Recommendations

• Weighted secret sharing from wiretap channels
• Characterizing Ideal Weighted Threshold Secret Sharing
• Threshold schemes with weights
• Dynamic and verifiable secret sharing among weighted participants
• Distributive weighted threshold secret sharing schemes

zbMATH Keywords

secret-sharingsecure multiparty computationthreshold cryptographyweighted cryptography

Mathematics Subject Classification ID

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

Cites Work

• How to share a secret
• A Pseudorandom Generator from any One-way Function
• Security of Ramp Schemes
• An application of ramp schemes to broadcast encryption
• A full proof of the BGW protocol for perfectly secure multiparty computation
• Monotone circuits for monotone weighted threshold functions
• Weighted threshold secret sharing schemes
• Title not available (Why is that?)
• A modular approach to key safeguarding
• How to share a secret
• Secret-sharing schemes for general and uniform access structures
• Title not available (Why is that?)
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• On the Power of Nonlinear Secret-Sharing
• Progress in Cryptology - INDOCRYPT 2003
• Theory of Cryptography
• Breaking the circuit-size barrier in secret sharing
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Multilevel threshold secret sharing based on the Chinese remainder theorem
• Chinese remaindering with errors
• Order-C secure multiparty computation for highly repetitive circuits
• Better secret sharing via robust conditional disclosure of secrets
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles
• Fluid MPC: secure multiparty computation with dynamic participants
• Unconditional communication-efficient MPC via Hall's marriage theorem
• Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)

Cited In (3)

• Weighted secret sharing from wiretap channels
• Scalable multiparty computation from non-linear secret sharing
• Traceable secret sharing: strong security and efficient constructions

This page was built for publication: Cryptography with weights: MPC, encryption and signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186595)