21 -- bringing down the complexity: fast composable protocols for card games without secret state

DOI10.1007/978-3-319-93638-3_4MaRDI QIDQ1784436zbMATH OpenOpenAlexFDO

Authors Bernardo David, Rafael Dowsley, Mario Larangeira

Publication date 26 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-93638-3_4

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial games (91A46)

Recommendations

• Instantaneous decentralized poker
• scientific article; zbMATH DE number 1024066
• Card-based cryptography meets formal verification
• Card-based cryptographic protocols using a minimal number of cards
• scientific article; zbMATH DE number 1617922

Cited in

(3)

• Practical construction for secure trick-taking games even with cards set aside
• scientific article; zbMATH DE number 1617922 (Why is no real title available?)
• Instantaneous decentralized poker

This page was built for publication: 21 -- bringing down the complexity: fast composable protocols for card games without secret state

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