Rational secret sharing and multiparty computation
From MaRDI portal
Recommendations
Cited in
(51)- Incentive-driven attacker for corrupting two-party protocols
- Game theoretic notions of fairness in multi-party coin toss
- Establishing rational networking using the DL04 quantum secure direct communication protocol
- Rational protocol of quantum secure multi-party computation
- Game theoretic security of quantum bit commitment
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Fair hierarchical secret sharing scheme based on smart contract
- Enforcing input correctness via certification in garbled circuit evaluation
- Improved signature schemes for secure multi-party computation with certified inputs
- A complete characterization of game-theoretically fair, multi-party coin toss
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem
- Sharing information with competitors
- Threshold changeable secret sharing with secure secret reconstruction
- A rational threshold signature model and protocol based on different permissions
- Scalable mechanisms for rational secret sharing
- Utility dependence in correct and fair rational secret sharing
- Secure message transmission on directed networks
- Overcoming free riding in multi-party computations -- the anonymous case
- Non-cooperative computation: Boolean functions with correctness and exclusivity
- Fair quantum secret sharing based on symmetric bivariate polynomial
- A game-theoretic security framework for quantum cryptography: performance analysis and application
- Rational quantum secret sharing scheme based on GHZ state
- Realizable Rational Multiparty Cryptographic Protocols
- A one-time rational secret sharing scheme based on Bayesian game
- Scalable rational secret sharing
- An optimally fair coin toss
- Utility Dependence in Correct and Fair Rational Secret Sharing
- Toward a game theoretic view of secure computation
- When is a semi-honest secure multiparty computation valuable?
- Realistic versus rational secret sharing
- Perfectly secure message transmission against independent rational adversaries
- Efficient rational secret sharing in standard communication networks
- Rational Secret Sharing, Revisited
- A rational framework for secure communication
- Distributed computing meets game theory
- Unmediated communication with partially verifiable types
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Rationality and Adversarial Behavior in Multi-party Computation
- Economically optimal variable tag length message authentication
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
- \(\log^\ast\)-round game-theoretically-fair leader election
- Data curation from privacy-aware agents
- Quantum advantage of threshold changeable secret sharing scheme
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
- Cryptanalysis and improvement of fair quantum secret sharing based on symmetric bivariate polynomial
- Maximizing miner revenue in transaction fee mechanism design
- Game-theoretically fair coin toss with arbitrary preferences
- Rational secret sharing with competition
- Verification of multi-agent systems with public actions against strategy logic
- Protocol completion incentive problems in cryptographic Vickrey auctions
This page was built for publication: Rational secret sharing and multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580953)
