Cryptography with weights: MPC, encryption and signatures

DOI10.1007/978-3-031-38557-5_10MaRDI QIDQ6186595zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

secret-sharingsecure multiparty computationthreshold cryptographyweighted cryptography

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(3)

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

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)