Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem

DOI10.1109/TIT.2020.2978385MaRDI QIDQ5124537zbMATH OpenOpenAlexFDO

Authors Benjamin Doerr, Marvin Künnemann

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2020.2978385

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of game theory (91A80) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited in

(4)

• Two-Prover Protocols---Low Error at Affordable Rates
• Cryptoschemes based on difficulty of simultaneous solving two different difficult problems
• scientific article; zbMATH DE number 5879525 (Why is no real title available?)
• The two sheriffs problem: cryptographic formalization and generalization

This page was built for publication: Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124537)