Robust and secure implementation: equivalence theorems
From MaRDI portal
Publication:2016223
DOI10.1016/J.GEB.2014.03.015zbMATH Open1296.91096OpenAlexW2011384232MaRDI QIDQ2016223FDOQ2016223
Publication date: 19 June 2014
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2014.03.015
Cites Work
- Robust Mechanism Design
- Robust Implementation in Direct Mechanisms
- Implementation in differential information economies
- Implementation with Incomplete Information in Exchange Economies
- Bayesian Implementation
- Robust implementation in general mechanisms
- Secure implementation in economies with indivisible objects and money
- Secure implementation in allotment economies
- Robust virtual implementation: toward a reinterpretation of the Wilson doctrine
- Secure implementation in Shapley-Scarf housing markets
- Strategic requirements with indifference: single-peaked versus single-plateaued preferences
Cited In (3)
Recommendations
- Safe Equivalences for Security Properties π π
- Complete Robustness in Identity-Based Encryption π π
- Equational security proofs of oblivious transfer protocols π π
- Title not available (Why is that?) π π
- Robust Authenticated Encryption and the Limits of Symmetric Cryptography π π
- The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols π π
- A decidable class of security protocols for both reachability and equivalence properties π π
- Strong and tight security guarantees against integral distinguishers π π
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes π π
- Efficient perfectly secure computation with optimal resilience π π
This page was built for publication: Robust and secure implementation: equivalence theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016223)