Toward optimal player weights in secure distributed protocols

DOI10.1007/3-540-45311-3_22MaRDI QIDQ4788579zbMATH OpenFDO

Authors C. Pandu Rangan, V. Kamakoti, Kannan Srinathan

Publication date 28 January 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45311-3_22

zbMATH Keywords

complexityoptimal player weightsthreshold protocol

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Secure equilibria in weighted games
• Efficient player-optimal protocols for strong and differential consensus
• Distributed computing meets game theory
• Toward a game theoretic view of secure computation
• Towards a game theoretic view of secure computation
• Game-theoretically secure protocols for the ordinal random assignment problem
• Dynamic and verifiable secret sharing among weighted participants
• Secure Multi-party Computation: Information Flow of Outputs and Game Theory
• Passivity-based distributed strategies for stochastic Stackelberg security games

Cited in

(2)

• Optimizing Threshold Protocols in Adversarial Structures
• scientific article; zbMATH DE number 4021017 (Why is no real title available?)

This page was built for publication: Toward optimal player weights in secure distributed protocols

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