Rationality and Adversarial Behavior in Multi-party Computation
From MaRDI portal
Publication:5756639
DOI10.1007/11818175_11zbMath1161.94417OpenAlexW1533330079MaRDI QIDQ5756639
Nikos Triandopoulos, Anna Lysyanskaya
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11818175_11
Related Items (14)
One-time rational secret sharing scheme based on bayesian game ⋮ Bayesian mechanism for rational secret sharing scheme ⋮ Unnamed Item ⋮ Toward a game theoretic view of secure computation ⋮ The power of one evil secret agent ⋮ Utility dependence in correct and fair rational secret sharing ⋮ Protocol completion incentive problems in cryptographic Vickrey auctions ⋮ When Is a Semi-honest Secure Multiparty Computation Valuable? ⋮ A rational framework for secure communication ⋮ Unmediated communication with partially verifiable types ⋮ Unnamed Item ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Efficient Rational Secret Sharing in Standard Communication Networks ⋮ Scalable mechanisms for rational secret sharing
This page was built for publication: Rationality and Adversarial Behavior in Multi-party Computation
