A faster cryptographer's Conspiracy Santa

DOI10.1016/j.tcs.2020.05.034zbMath1453.68081arXiv2005.09244OpenAlexW3027400537MaRDI QIDQ2196567

Pascal Lafourcade, Jean-Guillaume Dumas, Jannik Dreier, Xavier Bultel

Publication date: 3 September 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.09244

zbMATH Keywords

secure multi-party computationSecret Santacryptocurrencyformal security modelsConspiracy Santaphysical cryptographyprivacy-preserving protocolssharing expenses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Privacy of data (68P27) Algorithmic game theory and complexity (91A68)

Cites Work

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Reducibility Among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A faster cryptographer's Conspiracy Santa