Robust and secure implementation: equivalence theorems
From MaRDI portal
Publication:2016223
Recommendations
- Safe equivalences for security properties
- Complete robustness in identity-based encryption
- Equational security proofs of oblivious transfer protocols
- scientific article; zbMATH DE number 1030995
- 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
Cites work
- Bayesian Implementation
- Implementation in differential information economies
- Implementation with Incomplete Information in Exchange Economies
- Robust Mechanism Design
- Robust implementation in direct mechanisms
- Robust implementation in general mechanisms
- Robust virtual implementation: toward a reinterpretation of the Wilson doctrine
- Secure implementation in Shapley-Scarf housing markets
- Secure implementation in allotment economies
- Secure implementation in economies with indivisible objects and money
- Strategic requirements with indifference: single-peaked versus single-plateaued preferences
Cited in
(6)- An alternative equivalent formulation for robust implementation
- Securely implementable social choice rules with partially honest agents
- Sub-core solutions of the problem of strong implementation
- The robustness of robust implementation
- Robust coalitional implementation
- New necessary and sufficient conditions for secure implementation
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)
